A frequency-dependent p-adaptive technique for spectral methods

@article{Xia2021AFP,
  title={A frequency-dependent p-adaptive technique for spectral methods},
  author={Mingtao Xia and Sihong Shao and Tom Chou},
  journal={J. Comput. Phys.},
  year={2021},
  volume={446},
  pages={110627}
}
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… Expand
1 Citations

Figures and Tables from this paper

Efficient Scaling and Moving Techniques for Spectral Methods in Unbounded Domains
TLDR
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 and to track the blowup of average cell sizes in a model for cell proliferation. Expand

References

SHOWING 1-10 OF 34 REFERENCES
Efficient Scaling and Moving Techniques for Spectral Methods in Unbounded Domains
TLDR
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 and to track the blowup of average cell sizes in a model for cell proliferation. Expand
Computing nearly singular solutions using pseudo-spectral methods
  • T. Hou, Ruo Li
  • Mathematics, Computer Science
  • J. Comput. Phys.
  • 2007
TLDR
It is demonstrated that the pseudo-spectral method with the high order Fourier smoothing gives a much better performance than the Pseudo-spectrals with the 2/3 dealiasing rule, and that the error produced by the high orders is highly localized near the region where the solution is most singular. Expand
A finite-difference method for the one-dimensional time-dependent schrödinger equation on unbounded domain
A finite-difference scheme is proposed for the one-dimensional time-dependent Schrodinger equation. We introduce an artificial boundary condition to reduce the original problem into anExpand
Stability and Error Analysis for a Second-Order Fast Approximation of the One-dimensional Schrödinger Equation Under Absorbing Boundary Conditions
A second-order Crank--Nicolson finite difference method, integrating a fast approximation of an exact discrete absorbing boundary condition, is proposed for solving the one-dimensional SchrodingerExpand
On p-robust saturation for hp-AFEM
TLDR
It is shown that the analysis can be transferred from the patches to a reference triangle, and therein it is provided clear-cut computational evidence that any increment proportional to the polynomial degree yields the desired reduction. Expand
Spectral Methods: Algorithms, Analysis and Applications
Along with finite differences and finite elements, spectral methods are one of the three main methodologies for solving partial differential equations on computers. This book provides a detailedExpand
An Adaptive hp–DG–FE Method for Elliptic Problems: Convergence and Optimality in the 1D Case
We propose and analyze an hp-adaptive DG–FEM algorithm, termed \(\varvec {hp}\)-ADFEM, and its one-dimensional realization, which is convergent, instance optimal, and h- and p-robust. The procedureExpand
An Iterative Grid Redistribution Method for Singular Problems in Multiple Dimensions
We introduce an iterative grid redistribution method based on the variational approach. The iterative procedure enables us to gain more precise control of the grid distribution near the regions ofExpand
Fast Fourier-like Mapped Chebyshev Spectral-Galerkin Methods for PDEs with Integral Fractional Laplacian in Unbounded Domains
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) theExpand
Analytical and numerical aspects of certain nonlinear evolution equations. II. Numerical, nonlinear Schrödinger equation
Abstract Various numerical methods are employed in order to approximate the nonlinear Schrodinger equation, namely: (i) The classical explicit method, (ii) hopscotch method, (iii) implicit-explicitExpand
...
1
2
3
4
...