A Fast Direct Solver for Elliptic PDEs on a Hierarchy of Adaptively Refined Quadtrees
<|reference_start|>A Fast Direct Solver for Elliptic PDEs on a Hierarchy of Adaptively Refined Quadtrees: We describe a fast, direct solver for elliptic partial differential equations on a two-dimensional hierarchy of adaptively refined, Cartesian meshes. Our solver, inspired by the Hierarchical Poincar\'e-Steklov (HPS) method introduced by Gillman and Martinsson (SIAM J. Sci. Comput., 2014) uses fast solvers on locally uniform Cartesian patches stored in the leaves of a quadtree and is the first such solver that works directly with the adaptive quadtree mesh managed using the grid management library \pforest (C. Burstedde, L. Wilcox, O. Ghattas, SIAM J. Sci. Comput. 2011). Within each Cartesian patch, stored in leaves of the quadtree, we use a second order finite volume discretization on cell-centered meshes. Key contributions of our algorithm include 4-to-1 merge and split implementations for the HPS build stage and solve stage, respectively. We demonstrate our solver on Poisson and Helmholtz problems with a mesh adapted to the high local curvature of the right-hand side.<|reference_end|>
@article{chipman2024a,
    title={A Fast Direct Solver for Elliptic PDEs on a Hierarchy of Adaptively
  Refined Quadtrees},
    author={Damyn Chipman and Donna Calhoun and Carsten Burstedde},
    journal={arXiv preprint arXiv:2402.14936},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.14936},
    primaryClass={math.NA cs.NA}
}