A Fast Solver for HSS Representations via Sparse Matrices

DOI10.1137/050639028zbMATH Open1135.65317OpenAlexW2141719776MaRDI QIDQ5446452FDOQ5446452

Authors:

Publication date: 6 March 2008

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d15e9b192c5a3f29d9dc27ffb887388de1cf41ab

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

zbMATH Keywords

numerical experimentsfast multipole methodsparse direct solversdense structured linear systemshierarchically semiseparable representationsystem of block sparse equations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Cited In (58)

• Sparse hierarchical solvers with guaranteed convergence
• Randomized compression of rank-structured matrices accelerated with graph coloring
• Random walks in frequency and the reconstruction of obstacles with cavities from multi-frequency data
• Broadband recursive skeletonization
• Effective elastic properties of three-dimensional multiple crack problems with the isogeometric boundary element parallel fast direct solver
• 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
• Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
• Fast high-order integral equation methods for solving boundary value problems of two dimensional heat equation in complex geometry
• Simple non-extensive sparsification of the hierarchical matrices
• SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
• Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
• A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
• Linear-Cost Covariance Functions for Gaussian Random Fields
• Fast, adaptive, high-order accurate discretization of the Lippmann-Schwinger equation in two dimensions
• A simple filter for detecting low-rank submatrices
• 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
• Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
• The inverse fast multipole method: using a fast approximate direct dolver as a preconditioner for dense linear systems
• Butterfly factorization via randomized matrix-vector multiplications
• ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
• A recursive skeletonization factorization based on strong admissibility
• Towards a unified approach to electromagnetic analysis of objects embedded in multilayers
• Efficient mesh deformation based on radial basis function interpolation by means of the inverse fast multipole method
• On the robustness of inverse scattering for penetrable, homogeneous objects with complicated boundary
• Hierarchical interpolative factorization for elliptic operators: integral equations
• 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
• A tensor-train accelerated solver for integral equations in complex geometries
• Acoustic inverse scattering via Helmholtz operator factorization and optimization
• A neural network warm-start approach for the inverse acoustic obstacle scattering problem
• A hierarchical semi-separable Moore-Penrose equation solver
• 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
• Transformations of matrix structures work again
• 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
• Fast sparse selected inversion
• A fast direct solver for scattering from periodic structures with multiple material interfaces in two dimensions
• 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
• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• 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
• Overlapping domain decomposition preconditioner for integral equations
• A stable matrix version of the fast multipole method: stabilization strategies and examples
• A technique for updating hierarchical skeletonization-based factorizations of integral operators
• A robust inner-outer hierarchically semi-separable preconditioner.
• Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver
• 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

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)