Stochastic Trace Estimation for Parameter Dependent Matrices

We consider matrices [Formula: see text] that depend, possibly nonlinearly, on a parameter [Formula: see text] from a compact parameter space [Formula: see text]. We present a Monte Carlo estimator for minimizing [Formula: see text] over all [Formula: see text], and determine the sampling amount so that the backward error of the estimator is bounded with high probability. We derive two types of bounds, based on epsilon nets and on generic chaining. Both types predict a small sampling amount for matrices [Formula: see text] with small offdiagonal mass, and parameter spaces [Formula: see text] of small “size.” Dependence on the matrix dimension [Formula: see text] is only weak or not explicit. The bounds based on epsilon nets are easier to evaluate and come with fully specified constants. In contrast, the bounds based on chaining depend on the Talagrand functionals, which are difficult to evaluate, except in very special cases. Comparisons between the two types of bounds are difficult, although the literature suggests that chaining bounds can be superior.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Matrix Analysis and Applications
Published
2026-11-18
DOI
https://doi.org/10.1137/26m1854148
Citations
1
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
1.60

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Stochastic Trace Estimation for Parameter Dependent Matrices

Ilse C. F. Ipsen, Arvind Krishna Saibaba
1 citations
SIAM Journal on Matrix Analysis and Applications
Matrix Theory and Algorithms
1.60
article

Stochastic Trace Estimation for Parameter Dependent Matrices

Ilse C. F. Ipsen, Arvind Krishna Saibaba
article en
1 citations

Abstract

We consider matrices [Formula: see text] that depend, possibly nonlinearly, on a parameter [Formula: see text] from a compact parameter space [Formula: see text]. We present a Monte Carlo estimator for minimizing [Formula: see text] over all [Formula: see text], and determine the sampling amount so that the backward error of the estimator is bounded with high probability. We derive two types of bounds, based on epsilon nets and on generic chaining. Both types predict a small sampling amount for matrices [Formula: see text] with small offdiagonal mass, and parameter spaces [Formula: see text] of small “size.” Dependence on the matrix dimension [Formula: see text] is only weak or not explicit. The bounds based on epsilon nets are easier to evaluate and come with fully specified constants. In contrast, the bounds based on chaining depend on the Talagrand functionals, which are difficult to evaluate, except in very special cases. Comparisons between the two types of bounds are difficult, although the literature suggests that chaining bounds can be superior.

SIAM Journal on Matrix Analysis and ApplicationsVol. 47(4)
North Carolina State University (US)
National Science Foundation, U.S. Department of Energy
Openalex Percentile: Top 25%
Matrix Theory and Algorithms
1.60
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon