Krylov-aware stochastic trace estimation T Chen, E Hallman SIAM Journal on Matrix Analysis and Applications 44 (3), 1218-1244, 2023 | 19 | 2023 |
On the fast convergence of minibatch heavy ball momentum R Bollapragada, T Chen, R Ward arXiv preprint arXiv:2206.07553, 2022 | 19 | 2022 |
Analysis of stochastic Lanczos quadrature for spectrum approximation T Chen, T Trogdon, S Ubaru Proceedings of the 38th International Conference on Machine Learning 139 …, 2021 | 15 | 2021 |
Error bounds for lanczos-based matrix function approximation T Chen, A Greenbaum, C Musco, C Musco SIAM Journal on Matrix Analysis and Applications 43 (2), 787-811, 2022 | 11 | 2022 |
Randomized matrix-free quadrature for spectrum and spectral sum approximation T Chen, T Trogdon, S Ubaru arXiv preprint arXiv:2204.01941, 2022 | 8 | 2022 |
Predict-and-recompute conjugate gradient variants T Chen, E Carson SIAM Journal on Scientific Computing 42 (5), A3084-A3108, 2020 | 8 | 2020 |
Numerical computation of the equilibrium-reduced density matrix for strongly coupled open quantum systems T Chen, YC Cheng The Journal of Chemical Physics 157 (6), 064106, 2022 | 7 | 2022 |
On the convergence rate of variants of the conjugate gradient algorithm in finite precision arithmetic A Greenbaum, H Liu, T Chen SIAM Journal on Scientific Computing 43 (5), S496-S515, 2021 | 6 | 2021 |
Low-memory Krylov subspace methods for optimal rational matrix function approximation T Chen, A Greenbaum, C Musco, C Musco SIAM Journal on Matrix Analysis and Applications 44 (2), 670-692, 2023 | 5 | 2023 |
GMRES, pseudospectra, and Crouzeix’s conjecture for shifted and scaled Ginibre matrices T Chen, A Greenbaum, T Trogdon Mathematics of Computation, 2024 | 2 | 2024 |
Optimal polynomial approximation to rational matrix functions using the Arnoldi algorithm T Chen, A Greenbaum, N Wellen arXiv preprint arXiv:2306.17308, 2023 | 2 | 2023 |
Near-Optimal Approximation of Matrix Functions by the Lanczos Method N Amsel, T Chen, A Greenbaum, C Musco, C Musco arXiv preprint arXiv:2303.03358, 2023 | 2* | 2023 |
Lanczos-based methods for matrix functions T Chen University of Washington, 2022 | 2 | 2022 |
A posteriori error bounds for the block-Lanczos method for matrix function approximation Q Xu, T Chen Numerical Algorithms, 1-25, 2024 | 1 | 2024 |
Stability of the Lanczos algorithm on matrices with regular spectral distributions T Chen, T Trogdon Linear Algebra and its Applications 682, 191-237, 2024 | 1 | 2024 |
Non‐asymptotic moment bounds for random variables rounded to non‐uniformly spaced sets T Chen Stat, e395, 2021 | 1 | 2021 |
Near-optimal convergence of the full orthogonalization method T Chen, G Meurant arXiv preprint arXiv:2403.07259, 2024 | | 2024 |
Fixed-sparsity matrix approximation from matrix-vector products N Amsel, T Chen, F Duman Keles, D Halikias, C Musco, C Musco arXiv preprint arXiv:2402.09379, 2024 | | 2024 |
Faster randomized partial trace estimation T Chen, R Chen, K Li, S Nzeuton, Y Pan, Y Wang arXiv preprint arXiv:2310.12364, 2023 | | 2023 |
A spectrum adaptive kernel polynomial method T Chen The Journal of Chemical Physics 159 (11), 114101, 2023 | | 2023 |