Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4967573 | Journal of Computational Physics | 2017 | 25 Pages |
Abstract
For boundary integral equations, we demonstrate that using a qtt decomposition to construct preconditioners for a Krylov subspace method leads to an efficient and robust solver with a small memory footprint. We test the qtt preconditioners in the iterative solution of an exterior elliptic boundary value problem (Laplace) formulated as a boundary integral equation in complex, multiply connected geometries.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Eduardo Corona, Abtin Rahimian, Denis Zorin,