A Rational Spectral Collocation Method with Adaptively Transformed Chebyshev Grid Points

Authors:
T. W. Tee;Lloyd N. Trefethen
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2006

Citing 0
Cited 7

Algorithm 882: Near-Best Fixed Pole Rational Interpolation with Applications in Spectral Methods

ACM Transactions on Mathematical Software (TOMS)
Adaptive rational spectral methods for the linear stability analysis of nonlinear fourth-order problems

Journal of Computational Physics
A rational spectral collocation method for solving a class of parameterized singular perturbation problems

Journal of Computational and Applied Mathematics
Barycentric rational interpolation with asymptotically monitored poles

Numerical Algorithms
Direct Expansion Method of Boundary Condition for solving 3D elliptic equations with small parameters in the irregular domain

Computers & Mathematics with Applications
Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples

SIAM Review
Recent advances in linear barycentric rational interpolation

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

A spectral collocation method based on rational interpolants and adaptive grid points is presented. The rational interpolants approximate analytic functions with exponential accuracy by using prescribed barycentric weights and transformed Chebyshev points. The locations of the grid points are adapted to singularities of the underlying solution, and the locations of these singularities are approximated by the locations of poles of Chebyshev-Pade´ approximants. Numerical experiments on two time-dependent problems, one with finite time blow-up and one with a moving front, indicate that the method far outperforms the standard Chebyshev spectral collocation method for problems whose solutions have singularities in the complex plane close to $[-1,1]$.