On the complexity of some hierarchical structured matrix algorithms
From MaRDI portal
Recommendations
- Fast algorithms for hierarchically semiseparable matrices
- Algorithms to solve hierarchically semi-separable systems
- On the stability of some hierarchical rank structured matrix algorithms
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- scientific article; zbMATH DE number 6796233
Cited in
(33)- On the hardness of approximating the permanent of structured matrices
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- Interconnected hierarchical structures for fast direct elliptic solution
- Effective matrix-free preconditioning for the augmented immersed interface method
- Fast structured LU factorization for nonsymmetric matrices
- An \(O(N)\) direct solver for integral equations on the plane
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- On the stability of some hierarchical rank structured matrix algorithms
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Fast sparse selected inversion
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- A Hessenberg Reduction Algorithm for Rank Structured Matrices
- Algorithms to solve hierarchically semi-separable systems
- The LR Cholesky algorithm for symmetric hierarchical matrices
- A fast contour-integral eigensolver for non-Hermitian matrices
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- A robust multilevel approximate inverse preconditioner for symmetric positive definite matrices
- Fast structured Jacobi-Jacobi transforms
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
- Transformations of matrix structures work again
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- Fast approximate computations with Cauchy matrices and polynomials
- scientific article; zbMATH DE number 6796233 (Why is no real title available?)
- Low-rank approximation of a matrix: novel insights, new progress, and extensions
- Nearly optimal computations with structured matrices
- Rank‐structured approximation of some Cauchy matrices with sublinear complexity
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Hierarchical matrix arithmetic with accumulated updates
- Computing functions of symmetric hierarchically semiseparable matrices
- Multi-layer hierarchical structures
- Tree quasi-separable matrices: a simultaneous generalization of sequentially and hierarchically semiseparable representations
This page was built for publication: On the complexity of some hierarchical structured matrix algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910962)
