betaFeedback

WorksMathematics

Scaling H2 Factorization to Billion-Unknown Three-Dimensional Problems

Abstract

Strong recursive skeletonization provides approximate direct solvers for dense matrices from integral equations and kernel methods, but distributed implementations face substantial communication costs and limited parallelism, especially in three dimensions. We present a distributed-memory H2\mathcal{H}^2 factorization solver for symmetric matrices that combines spatial box coloring, delayed Schur complement updates, streamed sketching-based interpolative decomposition, and BLAS-3 and shared-memory kernels. Spatial coloring enables every process to participate in each boundary stage, while delayed updates and streamed sketching reduce dense storage and communication. To our knowledge, this is the first distributed-memory strong recursive skeletonization factorization demonstrated for three-dimensional volume integral equations at billion-unknown scale. Experiments on up to 512 compute nodes demonstrate factorization of a three-dimensional Laplace system with 3.62 billion unknowns, alongside three-dimensional Helmholtz tests and a two-dimensional Matérn system with 268 million unknowns. Combining streamed sketching and fully delayed updates reduces factorization time by 6.9×6.9\times for Laplace and 8.5×8.5\times for Helmholtz relative to the unsketched, eager configuration, while reducing maximum per-process resident memory by 57% and 54%, respectively.

Paper details

vlnc:W_5zxxrqa5
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…