Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEfficient Scaling and Moving Techniques for Spectral Methods in Unbounded Domains
186
0
0.0
(
0
)
Added by
Sihong Shao
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
When using Laguerre and Hermite spectral methods to numerically solve PDEs in unbounded domains, the number of collocation points assigned inside the region of interest is often insufficient, particularly when the region is expanded or translated to safely capture the unknown solution. Simply increasing the number of collocation points cannot ensure a fast convergence to spectral accuracy. In this paper, we propose a scaling technique and a moving technique to adaptively cluster enough collocation points in a region of interest in order to achieve a fast spectral convergence. Our scaling algorithm employs an indicator in the frequency domain that is used to determine when scaling is needed and informs the tuning of a scaling factor to redistribute collocation points to adapt to the diffusive behavior of the solution. Our moving technique adopts an exterior-error indicator and moves the collocation points to capture the translation. Both frequency and exterior-error indicators are defined using only the numerical solutions. We apply our methods to a number of different models, including diffusive and moving Fermi-Dirac distributions and nonlinear Dirac solitary waves, and demonstrate recovery of spectral convergence for time-dependent simulations. Performance comparison in solving a linear parabolic problem shows that our frequency scaling algorithm outperforms the existing scaling approaches. We also show our frequency scaling technique is able to track the blowup of average cell sizes in a model for cell proliferation.
rate research
Read More
In this paper, we propose a fast spectral-Galerkin method for solving PDEs involving integral fractional Laplacian in $mathbb{R}^d$, which is built upon two essential components: (i) the Dunford-Taylor formulation of the fractional Laplacian; and (ii) Fourier-like bi-orthogonal mapped Chebyshev functions (MCFs) as basis functions. As a result, the fractional Laplacian can be fully diagonalised, and the complexity of solving an elliptic fractional PDE is quasi-optimal, i.e., $O((Nlog_2N)^d)$ with $N$ being the number of modes in each spatial direction. Ample numerical tests for various decaying exact solutions show that the convergence of the fast solver perfectly matches the order of theoretical error estimates. With a suitable time-discretization, the fast solver can be directly applied to a large class of nonlinear fractional PDEs. As an example, we solve the fractional nonlinear Schr{o}dinger equation by using the fourth-order time-splitting method together with the proposed MCF-spectral-Galerkin method.
In this paper, we study a multi-scale deep neural network (MscaleDNN) as a meshless numerical method for computing oscillatory Stokes flows in complex domains. The MscaleDNN employs a multi-scale structure in the design of its DNN using radial scalings to convert the approximation of high frequency components of the highly oscillatory Stokes solution to one of lower frequencies. The MscaleDNN solution to the Stokes problem is obtained by minimizing a loss function in terms of L2 normof the residual of the Stokes equation. Three forms of loss functions are investigated based on vorticity-velocity-pressure, velocity-stress-pressure, and velocity-gradient of velocity-pressure formulations of the Stokes equation. We first conduct a systematic study of the MscaleDNN methods with various loss functions on the Kovasznay flow in comparison with normal fully connected DNNs. Then, Stokes flows with highly oscillatory solutions in a 2-D domain with six randomly placed holes are simulated by the MscaleDNN. The results show that MscaleDNN has faster convergence and consistent error decays in the simulation of Kovasznay flow for all four tested loss functions. More importantly, the MscaleDNN is capable of learning highly oscillatory solutions when the normal DNNs fail to converge.
When using spectral methods, a question arises as how to determine the expansion order, especially for time-dependent problems in which emerging oscillations may require adjusting the expansion order. In this paper, we propose a frequency-dependent $p$-adaptive technique that adaptively adjusts the expansion order based on a frequency indicator. Using this $p$-adaptive technique, combined with recently proposed scaling and moving techniques, we are able to devise an adaptive spectral method in unbounded domains that can capture and handle diffusion, advection, and oscillations. As an application, we use this adaptive spectral method to numerically solve the Schr{o}dinger equation in the whole domain and successfully capture the solutions oscillatory behavior at infinity.
We show how to solve hyperbolic equations numerically on unbounded domains by compactification, thereby avoiding the introduction of an artificial outer boundary. The essential ingredient is a suitable transformation of the time coordinate in combination with spatial compactification. We construct a new layer method based on this idea, called the hyperboloidal layer. The method is demonstrated on numerical tests including the one dimensional Maxwell equations using finite differences and the three dimensional wave equation with and without nonlinear source terms using spectral techniques.
We present a 3D hybrid method which combines the Finite Element Method (FEM) and the Spectral Boundary Integral method (SBIM) to model nonlinear problems in unbounded domains. The flexibility of FEM is used to model the complex, heterogeneous, and nonlinear part -- such as the dynamic rupture along a fault with near fault plasticity -- and the high accuracy and computational efficiency of SBIM is used to simulate the exterior half spaces perfectly truncating all incident waves. The exact truncation allows us to greatly reduce the domain of spatial discretization compared to a traditional FEM approach, leading to considerable savings in computational cost and memory requirements. The coupling of FEM and SBIM is achieved by the exchange of traction and displacement boundary conditions at the computationally defined boundary. The method is suited to implementation on massively parallel computers. We validate the developed method by means of a benchmark problem. Three more complex examples with a low velocity fault zone, low velocity off-fault inclusion, and interaction of multiple faults, respectively, demonstrate the capability of the hybrid scheme in solving problems of very large sizes. Finally, we discuss potential applications of the hybrid method for problems in geophysics and engineering.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
