Fast solvers for elliptic PDEs form a pillar of scientific computing. They enable detailed and accurate simulations of electromagnetic fields, fluid flows, biochemical processes, and much more. This textbook provides an introduction to fast solvers from the point of view of integral equation formulations, which lead to unparalleled accuracy and speed in many applications. The focus is on fast algorithms for handling dense matrices that arise in the discretization of integral operators, such as the fast multipole method and fast direct solvers. While the emphasis is on techniques for dense matrices, the text also describes how similar techniques give rise to linear complexity algorithms for computing the inverse or the LU factorization of a sparse matrix resulting from the direct discretization of an elliptic PDE. This is the first textbook to detail the active field of fast direct solvers, introducing readers to modern linear algebraic techniques for accelerating computations, such as randomized algorithms, interpolative decompositions, and data-sparse hierarchical matrix representations. Written with an emphasis on mathematical intuition rather than theoretical details, it is richly illustrated and provides pseudocode for all key techniques. Fast Direct Solvers for Elliptic PDEs is appropriate for graduate students in applied mathematics and scientific computing, engineers and scientists looking for an accessible introduction to integral equation methods and fast solvers, and researchers in computational mathematics who want to quickly catch up on recent advances in randomized algorithms and techniques for working with data-sparse matrices.
Cited By
- Chen C and Martinsson P Solving linear systems on a GPU with hierarchically off-diagonal low-rank approximations Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, (1-15)
- Wu B and Martinsson P (2021). Corrected trapezoidal rules for boundary integral equations in three dimensions, Numerische Mathematik, 149:4, (1025-1071), Online publication date: 1-Dec-2021.
Recommendations
Fast parallel solvers for elliptic problems
In an earlier work [1], we have considered the use of @t [2] preconditioners for the solution of Dirichlet boundary value problems by means of the preconditioned conjugate gradients methods. In this paper we propose the use of Toeplitz matrices for the ...
Parallel preconditioners for elliptic PDEs
Supercomputing '96: Proceedings of the 1996 ACM/IEEE conference on SupercomputingIterative schemes for solving sparse linear systems arising from elliptic PDEs are very suitable for efficient implementation on large scale multiprocessors. However, these methods rely heavily on effective preconditioners which must also be amenable to ...
Spatially Dispersionless, Unconditionally Stable FC---AD Solvers for Variable-Coefficient PDEs
We present fast, spatially dispersionless and unconditionally stable high-order solvers for partial differential equations (PDEs) with variable coefficients in general smooth domains. Our solvers, which are based on (i) A certain "Fourier continuation" (...