16 citations · 81 across the 20 of their papers we have counts for
5 papers · 1 filter
A spectrum adaptive kernel polynomial method
Tyler Chen
The kernel polynomial method (KPM) is a powerful numerical method for approximating spectral densities. Typical implementations of the KPM require an a prior estimate for an interv…
Optimal Polynomial Approximation to Rational Matrix Functions Using the Arnoldi Algorithm
Tyler Chen, Anne Greenbaum, Natalie Wellen
Given an by matrix and an -vector , along with a rational function , we show how to find the optimal approximation to from the K…
GMRES, pseudospectra, and Crouzeix's conjecture for shifted and scaled Ginibre matrices
Tyler Chen, Anne Greenbaum, Thomas Trogdon
We study the GMRES algorithm applied to linear systems of equations involving a scaled and shifted matrix whose entries are independent complex Gaussians. When the righ…
Nearly Optimal Approximation of Matrix Functions by the Lanczos Method
Noah Amsel, Tyler Chen, Anne Greenbaum +2
Approximating the action of a matrix function on a vector is an increasingly important primitive in machine learning, data science, and statistics, wit…
Stability of the Lanczos algorithm on matrices with regular spectral distributions
Tyler Chen, Thomas Trogdon
We study the stability of the Lanczos algorithm run on problems whose eigenvector empirical spectral distribution is near to a reference measure with well-behaved orthogonal polyno…