A general scheme for log-determinant computation of matrices via stochastic polynomial approximation
From MaRDI portal
Publication:1732398
DOI10.1016/j.camwa.2017.11.001zbMath1409.65029OpenAlexW2768220934MaRDI QIDQ1732398
Publication date: 25 March 2019
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2017.11.001
Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)
Related Items (2)
On randomized trace estimates for indefinite matrices with an application to determinants ⋮ The lifetime of micron scale topological chiral magnetic states with atomic resolution
Uses Software
Cites Work
- Sparse inverse covariance estimation with the graphical lasso
- On the distribution of the roots of certain symmetric matrices
- Improved bounds on sample size for implicit matrix trace estimators
- Parameter estimation in high dimensional Gaussian distributions
- Log-det approximation based on uniformly distributed seeds and its application to Gaussian process regression
- Monte Carlo estimates of the log determinant of large sparse matrices
- New method for counting the number of spanning trees in a two-tree network
- A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
- Randomized matrix-free trace and log-determinant estimators
- Counting spanning trees in self-similar networks by evaluating determinants
- Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature
- Approximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev Approximations
- Algorithm 837
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A general scheme for log-determinant computation of matrices via stochastic polynomial approximation
