Finding off-diagonal entries of the inverse of a large symmetric sparse matrix
From MaRDI portal
Publication:5397304
Recommendations
- A fast algorithm for sparse matrix computations related to inversion
- Computing entries of the inverse of a sparse matrix using the FIND algorithm
- Fast sparse selected inversion
- A probing method for computing the diagonal of a matrix inverse.
- On computing inverse entries of a sparse matrix in an out-of-core environment
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- A hybrid method for the parallel computation of Green's functions
- 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
- Nested Dissection of a Regular Finite Element Mesh
- On computing certain elements of the inverse of a sparse matrix
Cited in
(7)- A fast algorithm for sparse matrix computations related to inversion
- Computing entries of the inverse of a sparse matrix using the FIND algorithm
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- A probing method for computing the diagonal of a matrix inverse.
- Fast sparse selected inversion
- Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches
- On computing inverse entries of a sparse matrix in an out-of-core environment
This page was built for publication: Finding off-diagonal entries of the inverse of a large symmetric sparse matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397304)
