Characterizing GSVD by singular value expansion of linear operators and its computation (Q7016669)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8005345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing GSVD by singular value expansion of linear operators and its computation |
scientific article; zbMATH DE number 8005345 |
Statements
Characterizing GSVD by singular value expansion of linear operators and its computation (English)
0 references
6 March 2025
0 references
In this paper, the author provides a new understanding of GSVD from the viewpoint of SVD. He proposes a new iterative method for computing nontrivial GSVD components of a large scale matrix pair. By introducing two linear operators \(\mathcal{A}\) and \(\mathcal{L}\) induced by \(\{ A,L\}\) between two finite-dimensional Hilbert spaces and applying the theory of singular value expansion (SVE) for linear compact operators, he shows that the GSVD of \(\{ A,L\}\) is only the SVEs of \(\mathcal{A}\) and \(\mathcal{L}\). This result characterizes completely the structure of GSVD for any matrix pair with the same number of columns. As a direct application, he generalizes the standard Golub-Kahan bidiagonalization (GKB) such that the resulting generalized GKB (gGKB) process can be used to approximate nontrivial extreme GSVD components of \(\{ A,L\}\). This process is called gGKB-GSVD algorithm. Then he also uses the GSVD of \(\{ A,L\}\) to study several basic properties of gGKB and also provides preliminary results about convergence and accuracy of gGKB-GSVD for GSVD computations. Illustrative numerical experiments are presented.
0 references
linear operator
0 references
singular value expansion
0 references
generalized Golub-Kahan bidiagonalization
0 references
Krylov subspace
0 references
0 references
0 references
0 references
0 references
0 references