A probing method for computing the diagonal of a matrix inverse

DOI10.1002/nla.779zbMath1274.65132OpenAlexW2043310665MaRDI QIDQ4922262

J. M. Tang, Yousef Saad

Publication date: 29 May 2013

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.779

zbMATH Keywords

Green's functioniterative methodgraph theorycovariance matrixsparse matrixmatrix inverseKrylov-subspace methodprobingsparse approximate inversesmatrix diagonal extraction

Mathematics Subject Classification ID

Related Items (33)

Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix ⋮ Estimation of the bilinear form \(y^\ast f(A)x\) for Hermitian matrices ⋮ Alternating Minimization Algorithm with Automatic Relevance Determination for Transmission Tomography under Poisson Noise ⋮ Variance reduction with practical all-to-all lattice propagators ⋮ Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse ⋮ Randomized matrix-free trace and log-determinant estimators ⋮ Fast Computation of Spectral Densities for Generalized Eigenvalue Problems ⋮ Fast Sparse Selected Inversion ⋮ A Multilevel Approach to Variance Reduction in the Stochastic Estimation of the Trace of a Matrix ⋮ Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement ⋮ Parameter estimation in high dimensional Gaussian distributions ⋮ GCV for Tikhonov regularization by partial SVD ⋮ Optimizing shift selection in multilevel Monte Carlo for disconnected diagrams in lattice QCD ⋮ Efficient estimation of eigenvalue counts in an interval ⋮ Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications ⋮ Extending Hierarchical Probing for Computing the Trace of Matrix Inverses ⋮ Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides ⋮ Large-scale Sparse Inverse Covariance Matrix Estimation ⋮ The e-MoM approach for approximating matrix functionals ⋮ Estimation of the Robin coefficient field in a Poisson problem with uncertain conductivity field ⋮ Mitigating the influence of the boundary on PDE-based covariance operators ⋮ Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions ⋮ Efficient Covariance Approximations for Large Sparse Precision Matrices ⋮ GCV for Tikhonov regularization via global Golub–Kahan decomposition ⋮ An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation ⋮ Multigrid deflation for lattice QCD ⋮ A fast convergent iterative solver for approximate inverse of matrices ⋮ Unnamed Item ⋮ Parallel Computation of Entries of ${A}^{-1}$ ⋮ Moments of a linear operator, with applications to the trace of the inverse of matrices and the solution of equations ⋮ Interpolating log-determinant and trace of the powers of matrix \(\mathbf{A}+ t\mathbf{B}\) ⋮ Bounding matrix functionals via partial global block Lanczos decomposition ⋮ Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure

Uses Software

• ParaSails

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
• Probing methods for saddle-point problems
• Deflated GMRES for systems with multiple shifts and multiple right-hand sides
• Computing entries of the inverse of a sparse matrix using the FIND algorithm
• An inversion algorithm for a banded matrix
• Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems
• Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Approximate sparsity patterns for the inverse of a matrix and preconditioning
• A comparative study of sparse approximate inverse preconditioners
• Bounds for the entries of matrix functions with applications to preconditioning
• Estimates in quadratic formulas
• An estimator for the diagonal of a matrix
• Some large-scale matrix computation problems
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
• Recycling Krylov Subspaces for Sequences of Linear Systems
• Efficient sampling for spatial uncertainty quantification in multibody system dynamics applications
• Decay Rates for Inverses of Band Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• The Interface Probing Technique in Domain Decomposition
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
• Decay Rates of the Inverse of Nonsymmetric Tridiagonal and Band Matrices
• A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
• Toward an Effective Sparse Approximate Inverse Preconditioner
• Graph Colorings
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines

This page was built for publication: A probing method for computing the diagonal of a matrix inverse