On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
From MaRDI portal
Publication:3165415
DOI10.1137/100799411zbMath1252.05108OpenAlexW1986377370MaRDI QIDQ3165415
François-Henry Rouet, Bora Uçar, Yves Robert, Jean-Yves L'Excellent, Iain S. Duff, Patrick R. Amestoy
Publication date: 26 October 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/53601
Computational methods for sparse matrices (65F50) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (11)
Fast Sparse Selected Inversion ⋮ Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement ⋮ Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates ⋮ On Exploiting Sparsity of Multiple Right-Hand Sides in Sparse Direct Solvers ⋮ Comments on the hierarchically structured bin packing problem ⋮ A high performance level-block approximate LU factorization preconditioner algorithm ⋮ Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations ⋮ A survey of direct methods for sparse linear systems ⋮ Parallel finite element solver for multi-core computers with shared memory ⋮ Efficient Covariance Approximations for Large Sparse Precision Matrices ⋮ Parallel Computation of Entries of ${A}^{-1}$
Uses Software
This page was built for publication: On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
