Optimal Query Complexity for Estimating the Trace of a Matrix

DOI10.1007/978-3-662-43948-7_87zbMath1410.68391arXiv1405.7112OpenAlexW1510593638MaRDI QIDQ5167814

Karl Wimmer, Yi Wu, Peng Zhang

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Randomized algorithms (68W20)

Related Items (2)

On randomized trace estimates for indefinite matrices with an application to determinants ⋮ How Accurately Should I Compute Implicit Matrix-Vector Products When Applying the Hutchinson Trace Estimator?

This page was built for publication: Optimal Query Complexity for Estimating the Trace of a Matrix