Metraipolis › archive › dc_945149fa9fd3

The Refined Joint Bidiagonalization Method and an Implicitly Restarted Algorithm for Large GSVD Computations — arXiv:2608.04360

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04360
License (as archived)
CC0-1.0
Archived
2026-10-31T11:45:48.590Z
SHA-256 of the archived text
cd0d8ae5e9b26d1a90587153715c360ca0238d71fa1f2af14dfdfb19bd460feb
Stable URL of this page
https://metraipolis.com/documento/dc_945149fa9fd3

How to cite

The Refined Joint Bidiagonalization Method and an Implicitly Restarted Algorithm for Large GSVD Computations — arXiv:2608.04360 — arXiv (en), https://arxiv.org/abs/2608.04360 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_945149fa9fd3 (Metraipolis archive dc_945149fa9fd3, sha256 cd0d8ae5e9b26d1a90587153715c360ca0238d71fa1f2af14dfdfb19bd460feb)
BibTeX
@misc{dc945149fa9fd3,
  title = {The Refined Joint Bidiagonalization Method and an Implicitly Restarted Algorithm for Large GSVD Computations — arXiv:2608.04360},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04360},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_945149fa9fd3; sha256 cd0d8ae5e9b26d1a90587153715c360ca0238d71fa1f2af14dfdfb19bd460feb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04360. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We make a convergence analysis on the joint bidiagonalization (JBD) method that computes several extreme generalized singular value decomposition (GSVD) components of a regular matrix pair $\{A,L\}$, and show that the right and left Ritz vectors obtained by it may converge erratically and even may fail to converge, while Ritz values converge. These convergence results hold for a class of general Rayleigh--Ritz projection methods for the GSVD problem under the hypothesis that the deviation of a desired right generalized singular vector from the right subspace tends to zero. We prove the interlacing property of Ritz values and generalized singular values, and extend it to the generalized singular values of $\{A,L\}$ and the matrix pairs consisting of subsets of its columns. To overcome the irregular convergence or possible non-convergence of the JBD method, we nontrivially extend the refined Rayleigh--Ritz projection for the eigenvalue problem to the GSVD problem, and propose a refined JBD (RJBD) method that replaces the right Ritz vectors by new approximations, called the right refined Ritz vectors, satisfying certain residual optimality; we define new approximate left generalized singular vectors, called the left refined Ritz vectors. We prove that the left and right refined Ritz vectors unconditionally converge under the same hypothesis. We extend the implicit restarting scheme to the RJBD method, and develop an implicitly restarted RJBD algorithm with the refined shifts proposed. Numerical experiments illustrate that the new algorithm is at least competitive and often considerably more efficient than the implicitly restarted JBD algorithm.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2608.04360 — 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-31T11:34:54.264Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).