7 citations · 23 across the 12 of their papers we have counts for
4 papers · 2 filters
Randomized Jacobi-Davidson method
Laura Grigori, Taejun Park, Igor Simunec
The Jacobi-Davidson method is a widely used subspace method for computing a few eigenpairs of a large, sparse, non-Hermitian matrix closest to a target. Like other subspace methods…
Randomized Block Davidson Eigensolvers for Plane-Wave Density-Functional Theory
Moritz Gubler, Taejun Park, Augustin Bussy +4
Iterative diagonalization is the dominant cost of plane-wave density-functional theory (DFT), with search-space orthogonalization scaling particularly quickly with problem size and…
Nyström method for symmetric indefinite matrices
Yijia Chen, Yuji Nakatsukasa, Anjali Narendran +1
The Nyström method approximates , where is a column subset ma…
Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices
Ethan N. Epperly, Taejun Park, Yuji Nakatsukasa
In this paper, we develop RLOBPCG, an efficient method for computing a small number of singular triplets corresponding to the smallest singular values of large, tall matrices. The…