Randomized numerical linear algebra: Foundations and algorithms
This survey describes probabilistic algorithms for linear algebraic computations, such as
factorizing matrices and solving linear systems. It focuses on techniques that have a proven …
factorizing matrices and solving linear systems. It focuses on techniques that have a proven …
Randomized algorithms for matrices and data
MW Mahoney - Foundations and Trends® in Machine …, 2011 - nowpublishers.com
Randomized algorithms for very large matrix problems have received a great deal of
attention in recent years. Much of this work was motivated by problems in large-scale data …
attention in recent years. Much of this work was motivated by problems in large-scale data …
A mathematical guide to operator learning
Operator learning aims to discover properties of an underlying dynamical system or partial
differential equation (PDE) from data. Here, we present a step-by-step guide to operator …
differential equation (PDE) from data. Here, we present a step-by-step guide to operator …
An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
We present a sparse linear system solver that is based on a multifrontal variant of Gaussian
elimination and exploits low-rank approximation of the resulting dense frontal matrices. We …
elimination and exploits low-rank approximation of the resulting dense frontal matrices. We …
Scaling the “memory wall” for multi-dimensional seismic processing with algebraic compression on cerebras cs-2 systems
We exploit the high memory bandwidth of AI-customized Cerebras CS-2 systems for seismic
processing. By leveraging low-rank matrix approximation, we fit memory-hungry seismic …
processing. By leveraging low-rank matrix approximation, we fit memory-hungry seismic …
Solving sparse linear systems faster than matrix multiplication
Can linear systems be solved faster than matrix multiplication? While there has been
remarkable progress for the special cases of graph structured linear systems, in the general …
remarkable progress for the special cases of graph structured linear systems, in the general …
Learning Green's functions associated with time-dependent partial differential equations
Neural operators are a popular technique in scientific machine learning to learn a
mathematical model of the behavior of unknown physical systems from data. Neural …
mathematical model of the behavior of unknown physical systems from data. Neural …
[BOOK][B] Hierarchical matrices: algorithms and analysis
W Hackbusch - 2015 - Springer
Usually one avoids numerical algorithms involving operations with large, fully populated
matrices. Instead one tries to reduce all algorithms to matrix-vector multiplications involving …
matrices. Instead one tries to reduce all algorithms to matrix-vector multiplications involving …
A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
PG Martinsson - SIAM Journal on Matrix Analysis and Applications, 2011 - SIAM
Randomized sampling has recently been proven a highly efficient technique for computing
approximate factorizations of matrices that have low numerical rank. This paper describes …
approximate factorizations of matrices that have low numerical rank. This paper describes …
Elliptic PDE learning is provably data-efficient
Partial differential equations (PDE) learning is an emerging field that combines physics and
machine learning to recover unknown physical systems from experimental data. While deep …
machine learning to recover unknown physical systems from experimental data. While deep …