Sum-accelerated pseudospectral methods: The Euler-accelerated sinc algorithm (Q804219)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sum-accelerated pseudospectral methods: The Euler-accelerated sinc algorithm |
scientific article |
Statements
Sum-accelerated pseudospectral methods: The Euler-accelerated sinc algorithm (English)
0 references
1991
0 references
Pseudospectral discretizations yield a much more accurate method than the standard finite difference or finite element discretizations. The price is that the pseudospectral matrix is dense. The author shows that the Euler summation can be applied to a standard pseudospectral scheme to produce an algorithm which is both exponentially accurate and yet generates sparse matrices. For illustration, a sinc basis with an evenly spaced grid on \([-\infty,\infty]\) is used. However, this technique can also be applied to Chebyshev and Fourier polynomials.
0 references
sum-accelerated pseudospectral methods
0 references
sinc algorithm
0 references
Euler summation
0 references
sinc basis
0 references