On the complexity of some hierarchical structured matrix algorithms

DOI10.1137/110827788MaRDI QIDQ2910962zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

matrix factorizationnumerical examplesgraph techniqueshierarchically semiseparable matriceshierarchical structured matrix algorithms

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

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

(31)

• Algorithms to solve hierarchically semi-separable systems
• Parallel randomized and matrix-free direct solvers for large structured dense linear systems
• Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
• Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
• 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
• Interconnected hierarchical structures for fast direct elliptic solution
• Low-rank approximation of a matrix: novel insights, new progress, and extensions
• scientific article; zbMATH DE number 6796233 (Why is no real title available?)
• 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 hardness of approximating the permanent of structured matrices
• On the stability of some hierarchical rank structured matrix algorithms
• Fast structured LU factorization for nonsymmetric matrices
• Hierarchical matrix arithmetic with accumulated updates
• Effective matrix-free preconditioning for the augmented immersed interface method
• Transformations of matrix structures work again
• An \(O(N)\) direct solver for integral equations on the plane
• A parallel geometric multifrontal solver using hierarchically semiseparable structure
• A fast contour-integral eigensolver for non-Hermitian matrices
• Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
• Fast approximate computations with Cauchy matrices and polynomials
• Fast structured Jacobi-Jacobi transforms
• Fast sparse selected inversion
• Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
• Nearly optimal computations with structured matrices
• Computing functions of symmetric hierarchically semiseparable matrices
• A Hessenberg Reduction Algorithm for Rank Structured Matrices
• A stable matrix version of the fast multipole method: stabilization strategies and examples
• The LR Cholesky algorithm for symmetric hierarchical matrices
• Rank‐structured approximation of some Cauchy matrices with sublinear complexity

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)