Efficient Scaling and Moving Techniques for Spectral Methods in Unbounded Domains

by   Mingtao Xia, et al.

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.



There are no comments yet.


page 1

page 2

page 3

page 4


A frequency-dependent p-adaptive technique for spectral methods

When using spectral methods, a question arises as how to determine the e...

Spectral analysis of matrix scaling and operator scaling

We present a spectral analysis for matrix scaling and operator scaling. ...

Parallel Tempering for the planted clique problem

The theoretical information threshold for the planted clique problem is ...

Multi-scale Deep Neural Network (MscaleDNN) for Solving Poisson-Boltzmann Equation in Complex Domains

In this paper, we propose novel multi-scale DNNs (MscaleDNN) using the i...

Analysis of radial complex scaling methods: scalar resonance problems

We consider radial complex scaling/perfectly matched layer methods for s...

Spectral Methods in the Presence of Discontinuities

Spectral methods provide an elegant and efficient way of numerically sol...

Spectral shock detection for dynamically developing discontinuities

Pseudospectral schemes are a class of numerical methods capable of solvi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.