Publications

2026

• Randomized Jacobi-Davidson method
  L. Grigori, T. Park and I. Simunec. Preprint.
  arXiv

• IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch
  N. Pritchard, T. Park, Y. Nakatsukasa and P.-G. Martinsson.
  SIAM Journal on Scientific Computing, to appear.
  arXiv

• SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA
  I. Haas, M. Meier, Y. Nakatsukasa and T. Park.
  Preprint.
  arXiv

• Randomized Block Davidson Eigensolvers for Plane-Wave Density-Functional Theory
  M. Gubler, T. Park, A. Bussy, J. Laute, N. Marzari, I. Timrov and L. Grigori.
  Preprint.
  arXiv

• Nystrom method for symmetric indefinite matrices
  Y. Chen, Y. Nakatsukasa, A. Narendran and T. Park.
  Preprint.
  arXiv

• Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices
  E. N. Epperly, T. Park and Y. Nakatsukasa.
  Preprint.
  arXiv

• Approximating Sparse Matrices and their Functions using Matrix-vector Products
  T. Park and Y. Nakatsukasa.
  Applied and Computational Harmonic Analysis, 83, 101869.
  DOI · arXiv

2025

• Numerical Stability of the Nyström Method
  A. Bucci, Y. Nakatsukasa and T. Park.
  Preprint.
  arXiv

• Low-rank Approximation of Parameter-dependent Matrices via CUR Decomposition
  T. Park and Y. Nakatsukasa.
  SIAM Journal on Scientific Computing, 47(3), A1858–A1887.
  DOI · arXiv

• Accuracy and Stability of CUR Decompositions with Oversampling
  T. Park and Y. Nakatsukasa.
  SIAM Journal on Matrix Analysis and Applications, 46(1), 780–810.
  DOI · arXiv

2023

• Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
  Y. Nakatsukasa and T. Park.
  SIAM Journal on Matrix Analysis and Applications, 44(3), 1370–1392.
  DOI · arXiv

• A Fast Randomized Algorithm for Computing an Approximate Null Space
  T. Park and Y. Nakatsukasa.
  BIT Numerical Mathematics, 63, 36.
  DOI · arXiv

PhD Dissertation

• On the Accuracy and Robustness of Randomised Methods for Matrix Computations DPhil thesis, University of Oxford, 2025.
  Oxford Research Archive