Fast Sparse Selected Inversion
From MaRDI portal
Publication:2947058
DOI10.1137/14095755XzbMath1323.65024OpenAlexW1216695915MaRDI QIDQ2947058
Venkataramanan Balakrishnan, Yuanzhe Xi, Jian-Lin Xia, Stephen Cauley
Publication date: 21 September 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/14095755x
factorizationlinear complexitynumerical testdata sparsitystructured multifrontal methodHSS matrixlow-rank propertyfast selected inversion
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Linear-scaling selected inversion based on hierarchical interpolative factorization for self Green's function for modified Poisson-Boltzmann equation in two dimensions, A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems, Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse, Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions, Efficient Covariance Approximations for Large Sparse Precision Matrices, On the Stability of Some Hierarchical Rank Structured Matrix Algorithms, A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems
Uses Software
Cites Work
- Unnamed Item
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- A fast direct solver for elliptic problems on general meshes in 2D
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- A fast direct solver for a class of elliptic partial differential equations
- Rational approximation to the Fermi-Dirac function with applications in density functional theory
- A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains
- Computing entries of the inverse of a sparse matrix using the FIND algorithm
- Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Introduction to hierarchical matrices with applications.
- \(\mathcal H\)-FAINV: hierarchically factored approximate inverse preconditioners
- Hierarchical matrices based on a weak admissibility criterion
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
- On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs
- Fast algorithms for hierarchically semiseparable matrices
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
- Domain-Decomposition-Type Methods for Computing the Diagonal of a Matrix Inverse
- On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Adaptive Variable-Rank Approximation of General Dense Matrices
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- A probing method for computing the diagonal of a matrix inverse
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- Randomized Sparse Direct Solvers
- A Fast Solver for HSS Representations via Sparse Matrices
- Nested Dissection of a Regular Finite Element Mesh
- A fast algorithm for particle simulations
