Fast global spectral methods for three-dimensional partial differential equations
arXiv:2111.04585 · doi:10.1093/imanum/drac030
Abstract
Global spectral methods offer the potential to compute solutions of partial differential equations numerically to very high accuracy. In this work, we develop a novel global spectral method for linear partial differential equations on cubes by extending ideas of Chebop2 [Townsend and Olver, J. Comput. Phys., 299 (2015)] to the three-dimensional setting utilizing expansions in tensorized polynomial bases. Solving the discretized PDE involves a linear system that can be recast as a linear tensor equation. Under suitable additional assumptions, the structure of these equations admits for an efficient solution via the blocked recursive solver [Chen and Kressner, Numer. Algorithms, 84 (2020)]. In the general case, when these assumptions are not satisfied, this solver is used as a preconditioner to speed up computations.
References in corpus (8)
- A multidomain spectral method for solving elliptic equations
- Spectral tensor-train decomposition
- Spectral/hp element methods: recent developments, applications, and perspectives
- The automatic solution of partial differential equations using a global spectral method
- The ultraspherical spectral element method
- Functional Tensor-Train Chebyshev Method for Multidimensional Quantum Dynamics Simulations
- Dynamically orthogonal tensor methods for high-dimensional nonlinear PDEs
- Functional Tucker approximation using Chebyshev interpolation