Pages that link to "Item:Q2404966"

The following pages link to A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix (Q2404966):

Displaying 15 items.

• A general scheme for log-determinant computation of matrices via stochastic polynomial approximation (Q1732398) (← links)
• Randomized block Krylov subspace methods for trace and log-determinant estimators (Q2045172) (← links)
• GADE: a generative adversarial approach to density estimation and its applications (Q2056114) (← links)
• A multilevel approach to stochastic trace estimation (Q2074958) (← links)
• Faster stochastic trace estimation with a Chebyshev product identity (Q2233297) (← links)
• Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks (Q2329831) (← links)
• Randomized matrix-free trace and log-determinant estimators (Q2408935) (← links)
• On randomized trace estimates for indefinite matrices with an application to determinants (Q2671299) (← links)
• Data-driven learning of differential equations: combining data and model uncertainty (Q2686515) (← links)
• Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature (Q4588935) (← links)
• (Q4633029) (← links)
• Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
• Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
• Nonintrusive approximation of parametrized limits of matrix power algorithms – application to matrix inverses and log-determinants (Q5226427) (← links)
• The lifetime of micron scale topological chiral magnetic states with atomic resolution (Q6104393) (← links)