A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
From MaRDI portal
Publication:3225537
Recommendations
- Compressing Rank-Structured Matrices via Randomized Sampling
- Fast algorithms for hierarchically semiseparable matrices
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- A Fast Solver for HSS Representations via Sparse Matrices
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
Cited in
(85)- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Lattice Green function methods for atomistic/continuum coupling: theory and data-sparse implementation
- A Hierarchical Preconditioner for Wave Problems in Quasilinear Complexity
- Single-pass randomized QLP decomposition for low-rank approximation
- Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids
- Simple non-extensive sparsification of the hierarchical matrices
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization
- New efficient and robust HSS Cholesky factorization of SPD matrices
- Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- On the complexity of some hierarchical structured matrix algorithms
- Interconnected hierarchical structures for fast direct elliptic solution
- FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions
- A hierarchical butterfly LU preconditioner for two-dimensional electromagnetic scattering problems involving open surfaces
- Exact computations with quasiseparable matrices
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- scientific article; zbMATH DE number 6796233 (Why is no real title available?)
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- Efficient preconditioning of \(h p\)-FEM matrix sequences with slowly-varying coefficients: an application to topology optimization
- A fast adaptive solver for hierarchically semiseparable representations
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized compression of rank-structured matrices accelerated with graph coloring
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations
- Extending Hierarchical Probing for Computing the Trace of Matrix Inverses
- An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries
- On the stability of some hierarchical rank structured matrix algorithms
- Iterative representing set selection for nested cross approximation.
- Randomized recompression of \(\mathcal {H}\)-matrices for BEM
- Fast algorithms for hierarchically semiseparable matrices
- Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices
- SlabLU: a two-level sparse direct solver for elliptic PDEs
- Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices
- Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations
- Scalable Physics-Based Maximum Likelihood Estimation Using Hierarchical Matrices
- Fast structured LU factorization for nonsymmetric matrices
- Efficient Identification of Butterfly Sparse Matrix Factorizations
- Subspace Iteration Randomization and Singular Value Problems
- A hierarchical semi-separable Moore-Penrose equation solver
- Effective matrix-free preconditioning for the augmented immersed interface method
- Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations
- Preconditioners for hierarchical matrices based on their extended sparse form
- Randomized quaternion QLP decomposition for low-rank approximation
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Bridging and Improving Theoretical and Computational Electrical Impedance Tomography via Data Completion
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- SMASH: structured matrix approximation by separation and hierarchy.
- Multidimensional butterfly factorization
- Hierarchical Decompositions for the Computation of High-Dimensional Multivariate Normal Probabilities
- A hybrid stochastic interpolation and compression method for kernel matrices
- Fast approximate computations with Cauchy matrices and polynomials
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- A low-rank Schwarz method for radiative transfer equation with heterogeneous scattering coefficient
- A Fast Solver for HSS Representations via Sparse Matrices
- Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- On the application of a hierarchically semi-separable compression for space-fractional parabolic problems with varying time steps
- A direct solver with O(N) complexity for integral equations on one-dimensional domains
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A fast semidirect least squares algorithm for hierarchically block separable matrices
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Random sampling and efficient algorithms for multiscale PDEs
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
- Computing functions of symmetric hierarchically semiseparable matrices
- Compressing Rank-Structured Matrices via Randomized Sampling
- Data-sparse approximation on the computation of a weakly singular Fredholm equation: a stellar radiative transfer application
- Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs
- Interpolative Decomposition Butterfly Factorization
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- Learning elliptic partial differential equations with randomized linear algebra
- A fast randomized eigensolver with structured LDL factorization update
- Streaming low-rank matrix approximation with an application to scientific simulation
- A robust inner-outer hierarchically semi-separable preconditioner.
- Butterfly factorization
- A low-rank technique for computing the quasi-stationary distribution of subcritical Galton-Watson processes
- Recent Advances in Acoustic Boundary Element Methods
- Rank‐structured approximation of some Cauchy matrices with sublinear complexity
- Structured matrix recovery from matrix‐vector products
- Point spread function approximation of high-rank Hessians with locally supported nonnegative integral kernels
- Hm-toolbox: MATLAB software for HODLR and HSS matrices
- On the Best Approximation of the Hierarchical Matrix Product
This page was built for publication: A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225537)
