A Contour Integral-Based Algorithm for Computing Generalized Singular Values

Abstract

We propose a contour integral-based algorithm for computing a few singular values of a matrix or a few generalized singular values of a matrix pair. Mathematically, the generalized singular values of a matrix pair are the eigenvalues of an equivalent Hermitian-definite matrix pencil, known as the Jordan-Wielandt matrix pencil. However, direct application of the FEAST algorithm does not fully exploit the structure of this problem. We analyze several projection strategies on the Jordan-Wielandt matrix pencil, and propose an effective and robust scheme tailored to GSVD. Both theoretical analysis and numerical experiments demonstrate that our algorithm achieves rapid convergence and satisfactory accuracy.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…