Pages that link to "Item:Q4050025"
From MaRDI portal
The following pages link to On computing certain elements of the inverse of a sparse matrix (Q4050025):
Displayed 15 items.
- Approximate Bayesian inference for hierarchical Gaussian Markov random field models (Q148994) (← links)
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions (Q422929) (← links)
- Milestones in the development of iterative solution methods (Q543018) (← links)
- A nested iterative scheme for indefinite linear systems in particulate flows (Q704466) (← links)
- A hybrid method for the parallel computation of Green's functions (Q834057) (← links)
- Computing entries of the inverse of a sparse matrix using the FIND algorithm (Q955257) (← links)
- Incomplete block matrix factorization preconditioning methods. The ultimate answer? (Q1064733) (← links)
- A direct method for the solution of sparse linear least squares problems (Q1157668) (← links)
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse (Q1674709) (← links)
- Fitting very large sparse Gaussian graphical models (Q1927038) (← links)
- A nested dissection approach to modeling transport in nanodevices: Algorithms and applications (Q2952324) (← links)
- Differentiation of matrix functionals using triangular factorization (Q3015047) (← links)
- Computational complexity of operations involving perfect elimination sparse matrices (Q4120049) (← links)
- Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix (Q5397304) (← links)
- Smoothing noisy data with spline functions (Q5902942) (← links)