Skip to content

Author

Taejun Park

University of Oxford

We have 2 of 22 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Randomized Jacobi-Davidson method

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, it orthogonalizes each new expansion vector against the whole search basis, at a cost that grows quadratically with the subspace dimension...

L. Grigori, Taejun Park, Igor Simunec · 0 citations
Preprint Aug 2026

Randomized Block Davidson Eigensolvers for Plane-Wave Density-Functional Theory

Iterative diagonalization is the dominant cost of plane-wave density-functional theory (DFT), with search-space orthogonalization scaling particularly quickly with problem size and the number of target states. We present a randomized block Davidson-type eigensolver that replaces Euclidean orthogonalization with randomi...

Moritz Gubler, Taejun Park, Augustin Bussy et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.