Sum-accelerated pseudospectral methods: The Euler-accelerated sinc algorithm (Q804219): Difference between revisions

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.