A probing method for computing the diagonal of a matrix inverse.
From MaRDI portal
(Redirected from Publication:4922262)
Recommendations
- Extending Hierarchical Probing for Computing the Trace of Matrix Inverses
- scientific article; zbMATH DE number 1406961
- Finding off-diagonal entries of the inverse of a large symmetric sparse matrix
- Hierarchical probing for estimating the trace of the matrix inverse on toroidal lattices
- Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
Cites work
- A comparative study of sparse approximate inverse preconditioners
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
- An estimator for the diagonal of a matrix
- An inversion algorithm for a banded matrix
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Bounds for the entries of matrix functions with applications to preconditioning
- Computing entries of the inverse of a sparse matrix using the FIND algorithm
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Decay Rates for Inverses of Band Matrices
- Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices
- Decay Rates of the Inverse of Nonsymmetric Tridiagonal and Band Matrices
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- Efficient sampling for spatial uncertainty quantification in multibody system dynamics applications
- Estimates in quadratic formulas
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems
- Gaussian processes for machine learning.
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Graph Colorings
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3430031 (Why is no real title available?)
- IDR(s): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- Probing methods for saddle-point problems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Some large-scale matrix computation problems
- The Interface Probing Technique in Domain Decomposition
- Toward an Effective Sparse Approximate Inverse Preconditioner
- Transport in multilayered nanostructures. The dynamical mean-field theory approach.
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
Cited in
(45)- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- GCV for Tikhonov regularization by partial SVD
- Mitigating the influence of the boundary on PDE-based covariance operators
- Portrait of the inverse of a sparse matrix
- Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides
- The e-MoM approach for approximating matrix functionals
- Interpolating log-determinant and trace of the powers of matrix \(\mathbf{A}+ t\mathbf{B}\)
- Bounding matrix functionals via partial global block Lanczos decomposition
- Randomized matrix-free trace and log-determinant estimators
- Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
- Estimation of the bilinear form y^ f(A)x for Hermitian matrices
- GCV for Tikhonov regularization via global Golub-Kahan decomposition.
- Moments of a linear operator, with applications to the trace of the inverse of matrices and the solution of equations.
- Fast sparse selected inversion
- Efficient estimation of eigenvalue counts in an interval.
- Domain-Decomposition-Type Methods for Computing the Diagonal of a Matrix Inverse
- Variance reduction with practical all-to-all lattice propagators
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
- Efficient Covariance Approximations for Large Sparse Precision Matrices
- Alternating minimization algorithm with automatic relevance determination for transmission tomography under Poisson noise
- Fast computation of spectral densities for generalized eigenvalue problems
- Large-scale sparse inverse covariance matrix estimation
- Estimation of the Robin coefficient field in a Poisson problem with uncertain conductivity field
- Divide-and-conquer methods for functions of matrices with banded or hierarchical low-rank structure
- 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
- Extending Hierarchical Probing for Computing the Trace of Matrix Inverses
- scientific article; zbMATH DE number 7404608 (Why is no real title available?)
- An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation
- Parallel computation of entries of \({A}^{-1}\)
- Finding off-diagonal entries of the inverse of a large symmetric sparse matrix
- A fast convergent iterative solver for approximate inverse of matrices
- Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix
- Optimizing shift selection in multilevel Monte Carlo for disconnected diagrams in lattice QCD
- Skyrmion crystals in the triangular Kondo lattice model
- Kernel polynomial method for linear spin wave theory
- Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices
- Parallel selected inversion for space-time Gaussian Markov random fields
- Neumann-Neumann type domain decomposition of elliptic problems on metric graphs
- Diagonal of pseudoinverse of graph Laplacian: fast estimation and exact results
- Efficient estimates for matrix-inverse quadratic forms
- Fixed-sparsity matrix approximation from matrix-vector products
- Quasi-optimal hierarchically semi-separable matrix approximation
- Multigrid deflation for lattice QCD
- Parameter estimation in high dimensional Gaussian distributions
This page was built for publication: A probing method for computing the diagonal of a matrix inverse.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922262)
