Matrices with Hierarchical Low-Rank Structures
From MaRDI portal
Publication:2971626
DOI10.1007/978-3-319-49887-4_3zbMath1361.65023OpenAlexW2583849828MaRDI QIDQ2971626
Daniel Kressner, Jonas Ballani
Publication date: 7 April 2017
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-49887-4_3
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items (11)
Likelihood approximation with hierarchical matrices for large spatial datasets ⋮ Optimized cycle basis in volume integral formulations for large scale eddy-current problems ⋮ Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support ⋮ hm-toolbox: MATLAB Software for HODLR and HSS Matrices ⋮ Recompression of Hadamard Products of Tensors in Tucker Format ⋮ Fast Computation of Spectral Projectors of Banded Matrices ⋮ Matrices with Hierarchical Low-Rank Structures ⋮ Learning elliptic partial differential equations with randomized linear algebra ⋮ Large-scale Sparse Inverse Covariance Matrix Estimation ⋮ Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations ⋮ Tucker tensor analysis of Matérn functions in spatial statistics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- On the low-rank approximation by the pivoted Cholesky decomposition
- Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
- A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic
- On selecting a maximum volume sub-matrix of a matrix and related problems
- 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
- Adaptive low-rank approximation of collocation matrices
- The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
- Incomplete cross approximation in the mosaic-skeleton method
- Approximation of boundary element matrices
- \(\mathcal H\)-matrix approximation for the operator exponential with applications
- Computing the eigenvalues of symmetric \(\mathcal{H}^2\)-matrices by slicing the spectrum
- Hierarchical matrices based on a weak admissibility criterion
- A fast direct solver for boundary integral equations in two dimensions
- The generalized empirical interpolation method: stability theory on Hilbert spaces with an application to the Stokes equation
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Computing the singular value decomposition with high relative accuracy
- Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
- An \(O(N)\) direct solver for integral equations on the plane
- Hybrid cross approximation of integral operators
- New estimates for the recursive low-rank truncation of block-structured matrices
- Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
- Sublinear Randomized Algorithms for Skeleton Decompositions
- Computing All or Some Eigenvalues of Symmetric $\mathcal{H}_{\ell}$-Matrices
- On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices
- Hierarchical Matrices: Algorithms and Analysis
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices
- Matrices with Hierarchical Low-Rank Structures
- Fast algorithms for hierarchically semiseparable matrices
- Direct Methods for Sparse Linear Systems
- New Fast and Accurate Jacobi SVD Algorithm. I
- A note on the representation and definition of semiseparable matrices
- Fast direct solvers for integral equations in complex three-dimensional domains
- Decay Rates for Inverses of Band Matrices
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- ARPACK Users' Guide
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Comparison of Some Reduced Representation Approximations
- A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure
- The preconditioned inverse iteration for hierarchical matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Perturbation bounds in connection with singular value decomposition
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
- An algebraic multifrontal preconditioner that exploits the low‐rank property
- A fast algorithm for particle simulations
This page was built for publication: Matrices with Hierarchical Low-Rank Structures
