1 January 2020 in SIAM Journal on Matrix Analysis and Applications
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam
We propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification...
1 November 2019 in Journal of Computational Physics
1 January 2019 in SIAM Journal on Scientific Computing
Integral equations are commonly encountered when solving complex physical problems. Their discretization leads to a dense kernel matrix that is block or hierarchically low-rank. This paper proposes a new way to build a low-rank factorization of those low-rank blocks at a nearly optimal cost of $\mathcal{O}\!\left(nr\right)$ for an $n\times n$ block submatrix of rank $r$. This is done by first sampling the kernel function at new interpolation points, then selecting a subset of those using a CUR decomposition and finally using this reduced set of points as pivots for a rank-revealing LU-type factorization. We also explain how this implicitly builds an optimal interpolation basis for the kernel under consideration. We show the asymptotic convergence of the algorithm, explain its stability, and demonstrate on numerical examples that it performs very well in practice, allowing us to obtain rank nearly equal to the optimal rank at a fraction of the cost of the naive algorithm.
12 August 2022 in International Journal for Numerical Methods in Engineering