Fast construction of hierarchical matrix representation from matrix-vector multiplication
Publication:544585
DOI10.1016/J.JCP.2011.02.033zbMath1218.65038arXiv1001.0149OpenAlexW2169370352MaRDI QIDQ544585
Lexing Ying, Lin Lin, Jian-feng Lu
Publication date: 15 June 2011
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.0149
Green's functionnumerical examplesfast algorithmelliptic operatormatrix-vector multiplicationrandomized singular value decompositionhierarchical matrix construction
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Integral representations of solutions to PDEs (35C15) Boundary element methods for boundary value problems involving PDEs (65N38)
Related Items (42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- CUR matrix decompositions for improved data analysis
- A fast direct solver for a class of elliptic partial differential equations
- A fast adaptive solver for hierarchically semiseparable representations
- A fast randomized algorithm for the approximation of matrices
- On the fast matrix multiplication in the boundary element method by panel clustering
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A theory of pseudoskeleton approximations
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Randomized algorithms for the low-rank approximation of matrices
- Fast wavelet transforms and numerical algorithms I
- Metric-based upscaling
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- A Multigrid Tutorial, Second Edition
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Nested Dissection of a Regular Finite Element Mesh
- A fast algorithm for particle simulations
This page was built for publication: Fast construction of hierarchical matrix representation from matrix-vector multiplication