A numerical comparison of Chebyshev methods for solving fourth order semilinear initial boundary value problems

Journal article

In solving semilinear initial boundary value problems with prescribed non-periodic boundary conditions using implicit–explicit and implicit time stepping schemes, both the function and derivatives of the function may need to be computed accurately at each time step. To determine the best Chebyshev collocation method to do this, the accuracy of the real space Chebyshev differentiation, spectral space preconditioned Chebyshev tau, real space Chebyshev integration and spectral space Chebyshev integration methods are compared in the L² and W^2,2 norms when solving linear fourth order boundary value problems; and in the L^∞([0,T]; L²) and L^∞([0,T]; W^2,2) norms when solving initial boundary value problems. We find that the best Chebyshev method to use for high resolution computations of solutions to initial boundary value problems is the spectral space Chebyshev integration method which uses sparse matrix operations and has a computational cost comparable to Fourier spectral discretization.

Authors: Muite, B

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Elsevier
• Journal: Journal of Computational and Applied Mathematics
• Volume: 234
• Issue: 2
• Pages: 317-342
• Publication date: 2010-05-01
• Edition: Publisher's version
• DOI: 10.1016/j.cam.2009.12.029
• ISSN: 0377-0427
• Language: English
• Keywords: time stepping; spectral collocation; fast methods
• Subjects: Mathematics; Computer science (mathematics)