Numerical evaluation of the pth derivative of Jacobi series
Applied Numerical Mathematics
Fast algorithms for spectral collocation with non-periodic boundary conditions
Journal of Computational Physics
An iterated pseudospectral method for delay partial differential equations
Applied Numerical Mathematics
Higher order pseudospectral differentiation matrices
Applied Numerical Mathematics
Spectral collocation solution of a generalized Hirota-Satsuma coupled KdV equation
International Journal of Computer Mathematics
Adaptive pseudospectral solution of a diffuse interface model
Journal of Computational and Applied Mathematics
Journal of Computational Physics
Higher order pseudospectral differentiation matrices
Applied Numerical Mathematics
An iterated pseudospectral method for delay partial differential equations
Applied Numerical Mathematics
A fast algorithm for simulating vesicle flows in three dimensions
Journal of Computational Physics
Mathematical and Computer Modelling: An International Journal
Automatic Fréchet Differentiation for the Numerical Solution of Boundary-Value Problems
ACM Transactions on Mathematical Software (TOMS)
Optimal Gegenbauer quadrature over arbitrary integration nodes
Journal of Computational and Applied Mathematics
Hi-index | 0.02 |
A new method is investigated to reduce the roundoff error in computing derivatives using Chebyshev collocation methods. By using a grid mapping derived by Kosloff and Tal-Ezer, and the proper choice of the parameter $\alpha$, the roundoff error of the $k$th derivative can be reduced from $O(N^{2k})$ to $O((N \lge)^k)$, where $\epsilon$ is the machine precision and $N$ is the number of collocation points. This drastic reduction of roundoff error makes mapped Chebyshev methods competitive with any other algorithm in computing second or higher derivatives with large $N$. Several other aspects of the mapped Chebyshev differentiation matrix are also studied, revealing that the mapped Chebyshev methods require much less than $\pi$ points to resolve a wave; the eigenvalues are less sensitive to perturbation by roundoff error; and larger time steps can be used for solving PDEs. All these advantages of the mapped Chebyshev methods can be achieved while maintaining spectral accuracy.