Schwarz methods use a decomposition of the computational domain into subdomains and
need to impose boundary conditions on the subdomain boundaries. In domain truncation …

We have ported the numerical factorization and triangular solve phases of the sparse direct
solver STRUMPACK to GPU. STRUMPACK implements sparse LU factorization using the …

This paper presents an adaptive randomized algorithm for computing the butterfly
factorization of an m*n matrix with m≈n provided that both the matrix and its transpose can …

We are interested in solving linear systems arising from three applications:(1) kernel
methods in machine learning,(2) discretization of boundary integral equations from …

A butterfly-accelerated volume integral equation (VIE) solver is proposed for fast and
accurate electromagnetic (EM) analysis of scattering from heterogeneous objects. The …

Factorization of large dense matrices are ubiquitous in engineering and data science
applications, eg preconditioners for iterative boundary integral solvers, frontal matrices in …

We present a butterfly-compressed representation of the Hadamard–Babich (HB) ansatz for
the Green's function of the high-frequency Helmholtz equation in smooth inhomogeneous …

This article presents a fast and approximate multifrontal solver for large sparse linear
systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver …

Inspired by the row and column action methods for solving large-scale linear systems, in this
work, we explore the use of frontal slices for solving tensor linear systems. In particular, this …

An algorithm based on the Paterson-Stockmeyer (PS) scheme and filtering technology is
developed to compute the large matrix functions in dynamic problems accurately and …