On computing certain elements of the inverse of a sparse matrix
From MaRDI portal
Cited in
(25)- Incomplete block matrix factorization preconditioning methods. The ultimate answer?
- A direct method for the solution of sparse linear least squares problems
- Approximate Bayesian inference for hierarchical Gaussian Markov random field models
- A sparse linear algebra algorithm for fast computation of prediction variances with Gaussian Markov random fields
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Penalising model component complexity: a principled, practical approach to constructing priors
- Fitting very large sparse Gaussian graphical models
- A nested dissection approach to modeling transport in nanodevices: algorithms and applications
- Differentiation of matrix functionals using triangular factorization
- Efficient Covariance Approximations for Large Sparse Precision Matrices
- Computational complexity of operations involving perfect elimination sparse matrices
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- Gaussian Markov random fields for discrete optimization via simulation: framework and algorithms
- Smoothing Splines and Rank Structured Matrices: Revisiting the Spline Kernel
- Numerical solution of large scale Hartree-Fock-Bogoliubov equations
- Numerical methods for Kohn–Sham density functional theory
- Finding off-diagonal entries of the inverse of a large symmetric sparse matrix
- Milestones in the development of iterative solution methods
- Smoothing noisy data with spline functions
- A fast boundary element based solver for localized inelastic deformations
- Parallel selected inversion for space-time Gaussian Markov random fields
- A nested iterative scheme for indefinite linear systems in particulate flows
- An iterative block matrix inversion (IBMI) algorithm for symmetric positive definite matrices with applications to covariance matrices
- A hybrid method for the parallel computation of Green's functions
- Computing entries of the inverse of a sparse matrix using the FIND algorithm
This page was built for publication: On computing certain elements of 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 Q4050025)
