Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices
From MaRDI portal
Recommendations
- Extending Hierarchical Probing for Computing the Trace of Matrix Inverses
- Fast estimation of \(\mathrm{tr}(f(A))\) via stochastic Lanczos quadrature
- Krylov-Aware Stochastic Trace Estimation
- Hierarchical probing for estimating the trace of the matrix inverse on toroidal lattices
- Estimating the trace of matrix functions with application to complex networks
Cites work
- A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
- A multilevel approach to stochastic trace estimation
- A Multilevel Approach to Variance Reduction in the Stochastic Estimation of the Trace of a Matrix
- A probing method for computing the diagonal of a matrix inverse.
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
- Analytic functions ofM-matrices and generalizations
- Bounds for the decay of the entries in inverses and Cauchy-Stieltjes functions of certain sparse, normal matrices.
- Bounds for the entries of matrix functions with applications to preconditioning
- Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods
- Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian
- Decay Rates for Inverses of Band Matrices
- Deflation as a method of variance reduction for estimating the trace of a matrix inverse
- Extending Hierarchical Probing for Computing the Trace of Matrix Inverses
- Gaussian processes for machine learning.
- Graph energy
- Hierarchical probing for estimating the trace of the matrix inverse on toroidal lattices
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- Hutch++: Optimal Stochastic Trace Estimation
- Improved bounds on sample size for implicit matrix trace estimators
- Improved Variants of the Hutch++ Algorithm for Trace Estimation
- Krylov-Aware Stochastic Trace Estimation
- Matrix functions in network analysis
- Network properties revealed through matrix functions
- On randomized trace estimates for indefinite matrices with an application to determinants
- Optimal query complexity for estimating the trace of a matrix
- Optimizing shift selection in multilevel Monte Carlo for disconnected diagrams in lattice QCD
- Parameter estimation in high dimensional Gaussian distributions
- Random Geometric Graphs
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Refined decay bounds on the entries of spectral projectors associated with sparse Hermitian matrices
- Revisiting the Nyström method for improved large-scale machine learning
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation
Cited in
(2)
This page was built for publication: Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657191)
