4 citations · 7 across the 8 of their papers we have counts for
9 papers
Simultaneous Matrix-Free HSS Compression and Factorization with Adaptive Ranks
Elly Do, Chao Chen
Many dense matrices in scientific computing have hierarchically low-rank off-diagonal structure but are accessible only through routines that apply the matrix and, in general, its…
Adaptive, Matrix-Free Low-Rank Approximation
Arnel I. Smith, Elly Do, Chao Chen
We study fixed-tolerance low-rank approximation in the matrix-free setting, where a matrix or linear operator is accessible only through matrix-vector products and its…
A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
Zheng Li, Weiyan Wang, Ruiyuan Li +5
The torrential influx of floating-point data from domains like IoT and HPC necessitates high-performance lossless compression to mitigate storage costs while preserving absolute da…
Parametric Hierarchical Matrix Approximations to Kernel Matrices
Abraham Khan, Chao Chen, Vishwas Rao +1
Kernel matrices are ubiquitous in computational mathematics, often arising from applications in machine learning and scientific computing. In two or three spatial or feature dimens…
Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking
Tianyu Liang, Chao Chen, Yotam Yaniv +6
Incomplete Cholesky (IC) preconditioners are the standard black-box, memory-efficient first resort for large graph Laplacian systems, but classical IC can break down on irregular g…
Adaptive Parallelizable Algorithms for Interpolative Decompositions via Partially Pivoted LU
Katherine J. Pearce, Chao Chen, Yijun Dong +1
Interpolative and CUR decompositions involve "natural bases" of row and column subsets, or skeletons, of a given matrix that approximately span its row and column spaces. These low…
A Simplified Fast Multipole Method Based on Strong Recursive Skeletonization
Anna Yesypenko, Chao Chen, Per-Gunnar Martinsson
This work introduces a kernel-independent, multilevel, adaptive algorithm for efficiently evaluating a discrete convolution kernel with a given source distribution. The method is b…
An O(N) distributed-memory parallel direct solver for planar integral equations
Tianyu Liang, Chao Chen, Per-Gunnar Martinsson +1
Boundary value problems involving elliptic PDEs such as the Laplace and the Helmholtz equations are ubiquitous in mathematical physics and engineering. Many such problems can be al…
Robust Blockwise Random Pivoting: Fast and Accurate Adaptive Interpolative Decomposition
Yijun Dong, Chao Chen, Per-Gunnar Martinsson +1
The interpolative decomposition (ID) aims to construct a low-rank approximation formed by a basis consisting of row/column skeletons in the original matrix and a corresponding inte…