On the stability of some hierarchical rank structured matrix algorithms
From MaRDI portal
Publication:2827062
DOI10.1137/15M1026195zbMATH Open1348.65064OpenAlexW2523571399MaRDI QIDQ2827062FDOQ2827062
Recommendations
- On the complexity of some hierarchical structured matrix algorithms
- Fast algorithms for hierarchically semiseparable matrices
- Algorithms to solve hierarchically semi-separable systems
- On the description and stability of orthogonal transformations of rank structured matrices
- A Fast Solver for HSS Representations via Sparse Matrices
Cites Work
- scientific article; zbMATH DE number 1531793 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A bibliography on semiseparable matrices
- A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains
- A direct solver with \(O(N)\) complexity for variable coefficient elliptic PDEs discretized via a high-order composite spectral collocation method
- A fast algorithm for particle simulations
- A fast direct solver for structured linear systems by recursive skeletonization
- A fast implicit QR eigenvalue algorithm for companion matrices
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A fast randomized eigensolver with structured LDL factorization update
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Accuracy and Stability of Numerical Algorithms
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Construction of data-sparse \(\mathcal{H}^2\)-matrices by hierarchical compression
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient structured multifrontal factorization for general large sparse matrices
- Fast algorithms for hierarchically semiseparable matrices
- Fast sparse selected inversion
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchische Matrizen
- Introduction to hierarchical matrices with applications.
- Nested product decomposition of quasiseparable matrices
- On a new class of structured matrices
- On the complexity of some hierarchical structured matrix algorithms
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices
- Stable solutions of linear systems involving long chain of matrix multiplications
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
Cited In (14)
- 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
- A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems
- Numerical algorithms for high-performance computational science
- Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices
- A fast contour-integral eigensolver for non-Hermitian matrices
- Fast structured Jacobi-Jacobi transforms
- On the description and stability of orthogonal transformations of rank structured matrices
- Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices
- A Hessenberg Reduction Algorithm for Rank Structured Matrices
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- A hierarchical low rank Schur complement preconditioner for indefinite linear systems
Uses Software
This page was built for publication: On the stability of some hierarchical rank structured matrix algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827062)
