| 000 | 02306 a2200193 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20230914112613.0 | ||
| 008 | 230914b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9781611976038 | ||
| 040 | _aICTS-TIFR | ||
| 100 | _aMartinsson, Per-Gunnar | ||
| 245 | _aFast direct solvers for elliptic PDEs | ||
| 260 |
_bSociety for Industrial and Applied Mathematics, _aPhiladelphia, PA : _c[c2020] |
||
| 300 | _a315 p. | ||
| 490 |
_aCBMS-NSF Regional Conference Series in Applied Mathematics _vvol. 96 |
||
| 520 | _aFast 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. | ||
| 856 |
_uhttps://epubs.siam.org/doi/epdf/10.1137/1.9781611976045.fm _yTable of Contents |
||
| 942 |
_2lcc _cBK |
||
| 999 |
_c32916 _d32916 |
||