Fast algorithms for hierarchically semiseparable matrices
Publication:3090808
DOI10.1002/NLA.691zbMath1240.65087OpenAlexW2089958289MaRDI QIDQ3090808
Xiaoye Sherry Li, Ming Gu, Jian-Lin Xia, Shivkumar Chandrasekaran
Publication date: 2 September 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.691
numerical exampleslinear complexitysymmetric positive definiteHSS matrixlow-rank propertyhierarchically semiseparable (HSS) matrixULV factorizationfast HSS algorithmsgeneralized HSS Cholesky factorizationpostordering HSS tree
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- A fast direct solver for a class of elliptic partial differential equations
- A fast adaptive solver for hierarchically semiseparable representations
- A tree-based dataflow model for the unsymmetric multifrontal method
- Rapid solution of integral equations of scattering theory in two dimensions
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- On a new class of structured matrices
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A fast direct solver for boundary integral equations in two dimensions
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs
- The Role of Elimination Trees in Sparse Factorization
- A note on the representation and definition of semiseparable matrices
- A QR-Based Solver for Rank Structured Matrices
- Fast Condition Estimation for a Class of Structured Eigenvalue Problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- LAPACK Users' Guide
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- An introduction to hierarchical matrices
- Statistical Condition Estimation for the Roots of Polynomials
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- The Theory of Elimination Trees for Sparse Unsymmetric Matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Nested Dissection of a Regular Finite Element Mesh
- A bibliography on semiseparable matrices
- A fast algorithm for particle simulations
This page was built for publication: Fast algorithms for hierarchically semiseparable matrices