On the complexity of some hierarchical structured matrix algorithms
DOI10.1137/110827788zbMATH Open1250.65050OpenAlexW2060492405MaRDI QIDQ2910962FDOQ2910962
Authors: Jianlin Xia 
Publication date: 12 September 2012
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2d2f301c5ee96ba3efef4b70794cf55928f2d37b
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
matrix factorizationnumerical examplesgraph techniqueshierarchically semiseparable matriceshierarchical structured matrix algorithms
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)
Cited In (31)
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- A robust multilevel approximate inverse preconditioner for symmetric positive definite 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
- Interconnected hierarchical structures for fast direct elliptic solution
- Low-rank approximation of a matrix: novel insights, new progress, and extensions
- Title not available (Why is that?)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- On the stability of some hierarchical rank structured matrix algorithms
- On the hardness of approximating the permanent of structured matrices
- Hierarchical matrix arithmetic with accumulated updates
- Fast structured LU factorization for nonsymmetric matrices
- Effective matrix-free preconditioning for the augmented immersed interface method
- An \(O(N)\) direct solver for integral equations on the plane
- Transformations of matrix structures work again
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- A fast contour-integral eigensolver for non-Hermitian matrices
- Fast approximate computations with Cauchy matrices and polynomials
- Fast structured Jacobi-Jacobi transforms
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- Fast sparse selected inversion
- Computing functions of symmetric hierarchically semiseparable matrices
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
- Nearly optimal computations with structured matrices
- A Hessenberg Reduction Algorithm for Rank Structured Matrices
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- Rank‐structured approximation of some Cauchy matrices with sublinear complexity
- The LR Cholesky algorithm for symmetric hierarchical matrices
- Algorithms to solve hierarchically semi-separable systems
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
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)
