Metraipolis › archive › dc_94aef139fff5
Randomized Jacobi-Davidson method — arXiv:2609.29651
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29651
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:08:24.278Z
- SHA-256 of the archived text
4c44530023b79cb82c4736cfb44175b1942f0dbd084c0d95a0a619e4bc0a4e50- Stable URL of this page
https://metraipolis.com/documento/dc_94aef139fff5
How to cite
Randomized Jacobi-Davidson method — arXiv:2609.29651 — arXiv (en), https://arxiv.org/abs/2609.29651 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_94aef139fff5 (Metraipolis archive dc_94aef139fff5, sha256 4c44530023b79cb82c4736cfb44175b1942f0dbd084c0d95a0a619e4bc0a4e50)
BibTeX
@misc{dc94aef139fff5,
title = {Randomized Jacobi-Davidson method — arXiv:2609.29651},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29651},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_94aef139fff5; sha256 4c44530023b79cb82c4736cfb44175b1942f0dbd084c0d95a0a619e4bc0a4e50},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29651. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 and, in a distributed setting, requires a global synchronization at every iteration. We introduce a randomized Jacobi-Davidson method that replaces this orthogonalization with a much cheaper randomized orthogonalization process, which requires no inner products involving full-dimensional vectors. We prove that, under a uniform separation condition, the randomized method retains the local quadratic convergence of classical Jacobi-Davidson for non-Hermitian problems. The key step is showing that an exact solution of the randomized correction equation is one step of sketched inverse iteration for an arbitrary shift, which lets us extend the analysis to harmonic and refined variants of the sketched extraction, better suited to interior eigenvalues. Numerical experiments on real and synthetic non-Hermitian eigenvalue problems confirm the predicted convergence order and show that the randomized method matches the reliability of classical Jacobi-Davidson while reducing orthogonalization cost. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.29651 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T05:35:20.338Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).