Algorithm approximates spectral density of normal matrices to EMD O(1/m + log m/sqrt(n)) with m matvec queries and proves Omega(1/epsilon) lower bound even for symmetric case.
Estimating the numerical range with a K rylov subspace
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral density estimation for normal matrices
Algorithm approximates spectral density of normal matrices to EMD O(1/m + log m/sqrt(n)) with m matvec queries and proves Omega(1/epsilon) lower bound even for symmetric case.