On computing the inverse of a sparse matrix

DOI10.1002/NME.1620191009MaRDI QIDQ3038500zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nme.1620191009

zbMATH Keywords

bifactorizationcomparison of several algorithmsinverse of a sparse symmetric diagonally dominant matrixLDU decompositionnumerical experiments

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Cited in

(7)

• Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
• A three-dimensional explicit preconditioned solver
• Interpolating log-determinant and trace of the powers of matrix \(\mathbf{A}+ t\mathbf{B}\)
• Differentiation of matrix functionals using triangular factorization
• Explicit preconditioned methods for solving 3d boundary-value problems by approximate inverse finite element matrix techniques
• Gaussian Markov random fields for discrete optimization via simulation: framework and algorithms
• A hybrid method for the parallel computation of Green's functions

Describes a project that uses

Uses Software

• LINPACK
• MA27
• YSMP

This page was built for publication: On computing the inverse of a sparse matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3038500)