A Fast Solver for HSS Representations via Sparse Matrices
From MaRDI portal
Publication:5446452
Recommendations
- Fast algorithms for hierarchically semiseparable matrices
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A fast adaptive solver for hierarchically semiseparable representations
- scientific article; zbMATH DE number 6796233
Cited in
(58)- A class of iterative solvers for the Helmholtz equation: factorizations, sweeping preconditioners, source transfer, single layer potentials, polarized traces, and optimized Schwarz methods
- Fast spatial Gaussian process maximum likelihood estimation via skeletonization factorizations
- HODLR\(d\)D: a new black-box fast algorithm for \(N\)-body problems in \(d\)-dimensions with guaranteed error bounds. Applications to integral equations and support vector machines
- Sparse hierarchical solvers with guaranteed convergence
- Simple non-extensive sparsification of the hierarchical matrices
- Fast high-order integral equation methods for solving boundary value problems of two dimensional heat equation in complex geometry
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Fast, adaptive, high-order accurate discretization of the Lippmann-Schwinger equation in two dimensions
- Linear-Cost Covariance Functions for Gaussian Random Fields
- A simple filter for detecting low-rank submatrices
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- Randomized compression of rank-structured matrices accelerated with graph coloring
- Efficient sum-of-exponentials approximations for the heat kernel and their applications
- Reconstruction of a compactly supported sound profile in the presence of a random background medium
- The inverse fast multipole method: using a fast approximate direct dolver as a preconditioner for dense linear systems
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
- Towards a unified approach to electromagnetic analysis of objects embedded in multilayers
- Butterfly factorization via randomized matrix-vector multiplications
- A recursive skeletonization factorization based on strong admissibility
- Efficient mesh deformation based on radial basis function interpolation by means of the inverse fast multipole method
- Hierarchical interpolative factorization for elliptic operators: integral equations
- On the robustness of inverse scattering for penetrable, homogeneous objects with complicated boundary
- On the stability of some hierarchical rank structured matrix algorithms
- Simulation of two-dimensional steady-state heat conduction problems by a fast singular boundary method
- Fast algorithms for hierarchically semiseparable matrices
- An efficient, memory-saving approach for the Loewner framework
- Fast direct solvers for integral equations in complex three-dimensional domains
- Acoustic inverse scattering via Helmholtz operator factorization and optimization
- A tensor-train accelerated solver for integral equations in complex geometries
- A neural network warm-start approach for the inverse acoustic obstacle scattering problem
- A hierarchical semi-separable Moore-Penrose equation solver
- Random walks in frequency and the reconstruction of obstacles with cavities from multi-frequency data
- Transformations of matrix structures work again
- Broadband recursive skeletonization
- Preconditioners for hierarchical matrices based on their extended sparse form
- An \(O(N)\) direct solver for integral equations on the plane
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- High resolution inverse scattering in two dimensions using recursive linearization
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- Fast approximate computations with Cauchy matrices and polynomials
- A fast direct solver for scattering from periodic structures with multiple material interfaces in two dimensions
- Fast sparse selected inversion
- A fast block low-rank dense solver with applications to finite-element matrices
- Multifrequency inverse obstacle scattering with unknown impedance boundary conditions using recursive linearization
- Application of the inverse fast multipole method as a preconditioner in a 3D Helmholtz boundary element method
- A fast direct singular boundary method for three-dimensional potential problems
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Overlapping domain decomposition preconditioner for integral equations
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- A robust inner-outer hierarchically semi-separable preconditioner.
- A technique for updating hierarchical skeletonization-based factorizations of integral operators
- Effective elastic properties of three-dimensional multiple crack problems with the isogeometric boundary element parallel fast direct solver
- Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver
This page was built for publication: A Fast Solver for HSS Representations via Sparse Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446452)
