Abstract
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 α, the roundoff error of the kth derivative can be reduced from O(N2k) to O((N\lge)k), where ε 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 1. the mapped Chebyshev methods require much less than π points to resolve a wave; 2. the eigenvalues are less sensitive to perturbation by roundoff error; and 3. larger time steps can be used for solving PDEs. All these advantages of the mapped Chebyshev methods can be achieved while maintaining spectral accuracy.
| Original language | English |
|---|---|
| Pages (from-to) | 1040-1055 |
| Number of pages | 16 |
| Journal | SIAM Journal on Scientific Computing |
| Volume | 18 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Jul 1997 |
User-Defined Keywords
- Chebyshev collocation
- Differentiation matrix
- Roundoff error
- Tal-Ezer mapping