Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix

DOI10.1002/nla.1826zbMath1289.65042OpenAlexW2128985516MaRDI QIDQ5397304

Justin W. L. Wan, S. Eastwood

Publication date: 19 February 2014

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.1826

zbMATH Keywords

algorithmcomputational complexitynumerical examplessparse matrixmatrix inversionnested dissectioncomputational meshoff-diagonal entries

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Uses Software

• symrcm

Cites Work

• Unnamed Item
• 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
• On computing certain elements of the inverse of a sparse matrix
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix