On computing certain elements of the inverse of a sparse matrix

Authors:
A. M. Erisman;W. F. Tinney
Affiliations:
Boeing Computer Services, Seattle, WA;Bonneville Power Administration, Portland, OR
Venue:
Communications of the ACM
Year:
1975

Citing 0
Cited 11

Numerical methods for infinite Markov processes

PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Computing entries of the inverse of a sparse matrix using the FIND algorithm

Journal of Computational Physics
Covariance selection for nonchordal graphs via chordal embedding

Optimization Methods & Software - Mathematical programming in data mining and machine learning
A hybrid method for the parallel computation of Green's functions

Journal of Computational Physics
SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix

ACM Transactions on Mathematical Software (TOMS)
Milestones in the development of iterative solution methods

Journal on Image and Video Processing - Special issue on iterative signal processing in communications
Approximate Marginals in Latent Gaussian Models

The Journal of Machine Learning Research
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations

SIAM Journal on Scientific Computing
Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions

Journal of Computational Physics
Fitting very large sparse Gaussian graphical models

Computational Statistics & Data Analysis
Fast methods for computing selected elements of the green's function in massively parallel nanoelectronic device simulations

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing

Quantified Score

Hi-index	48.23

Visualization

Abstract

A recursive algorithm for computing the inverse of a matrix from the LU factors based on relationships in Takahashi, et al., is examined. The formulas for the algorithm are given; the dependency relationships are derived; the computational costs are developed; and some general comments on application and stability are made.