On computing the inverse of a sparse matrix
From MaRDI portal
Publication:3038500
DOI10.1002/nme.1620191009zbMath0525.65014OpenAlexW2073507973MaRDI QIDQ3038500
No author found.
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
numerical experimentsLDU decompositionbifactorizationcomparison of several algorithmsinverse of a sparse symmetric diagonally dominant matrix
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A hybrid method for the parallel computation of Green's functions ⋮ Explicit preconditioned iterative methods for solving large unsymmetric finite element systems ⋮ Explicit preconditioned methods for solving 3d boundary-value problems by approximate inverse finite element matrix techniques ⋮ Differentiation of matrix functionals using triangular factorization ⋮ Gaussian Markov Random Fields for Discrete Optimization via Simulation: Framework and Algorithms ⋮ A three-dimensional explicit preconditioned solver ⋮ Interpolating log-determinant and trace of the powers of matrix \(\mathbf{A}+ t\mathbf{B}\)
Uses Software