Improved bounds on sample size for implicit matrix trace estimators

From MaRDI portal
Revision as of 15:51, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:887152

DOI10.1007/S10208-014-9220-1zbMath1323.65043arXiv1308.2475OpenAlexW3105113144MaRDI QIDQ887152

Farbod Roosta-Khorasani, Uri M. Ascher

Publication date: 28 October 2015

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.2475




Related Items (34)

Algorithms that satisfy a stopping criterion, probablyMonte Carlo Methods for Estimating the Diagonal of a Real Symmetric MatrixRandomized approaches to accelerate MCMC algorithms for Bayesian inverse problemsA Fast and Scalable Method for A-Optimal Design of Experiments for Infinite-dimensional Bayesian Nonlinear Inverse ProblemsSpectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and HardnessImproved Bounds for Small-Sample EstimationRandomized matrix-free trace and log-determinant estimatorsImproved Variants of the Hutch++ Algorithm for Trace EstimationOn randomized trace estimates for indefinite matrices with an application to determinantsMonte Carlo estimators for the Schatten \(p\)-norm of symmetric positive semidefinite matricesA Multilevel Approach to Variance Reduction in the Stochastic Estimation of the Trace of a MatrixSchur properties of convolutions of gamma random variablesFast Estimation of $tr(f(A))$ via Stochastic Lanczos QuadratureApproximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev ApproximationsA FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matricesEfficient estimation of eigenvalue counts in an intervalRandomized Low-Rank Approximation of Monotone Matrix FunctionsHypercontractivity via tensor calculusTaylor approximation and variance reduction for PDE-constrained optimal control under uncertaintyFast Estimation of Approximate Matrix Ranks Using Spectral DensitiesA general scheme for log-determinant computation of matrices via stochastic polynomial approximationMean-Variance Risk-Averse Optimal Control of Systems Governed by PDEs with Random Parameter Fields Using Quadratic ApproximationsNorm and Trace Estimation with Random Rank-one VectorsError bounds for computed least squares estimatorsRandomized block Krylov subspace methods for trace and log-determinant estimatorsFull Waveform Inversion Using Extended and Simultaneous SourcesGoing Off the Grid: Iterative Model Selection for Biclustered Matrix CompletionScalable Gaussian Process Computations Using Hierarchical MatricesStochastic sampling for deterministic structural topology optimization with many load cases: density-based and ground structure approachesStreaming Low-Rank Matrix Approximation with an Application to Scientific SimulationHow Accurately Should I Compute Implicit Matrix-Vector Products When Applying the Hutchinson Trace Estimator?A multilevel approach to stochastic trace estimationUnnamed ItemUnnamed Item




Cites Work




This page was built for publication: Improved bounds on sample size for implicit matrix trace estimators