Double-variable trace maximization for extreme generalized singular quartets of a matrix pair: A geometric method
- 16 February 2024
- journal article
- research article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 93 (349) , 2331-2359
Abstract
In this paper, we consider the problem of computing an arbitrary generalized singular value of a Grassman or real matrix pair and a triplet of associated generalized singular vectors. Based on the QR factorization, the problem is reformulated as two novel trace maximization problems, each of which has double variables with unitary constraints or orthogonal constraints. Theoretically, we show that the arbitrarily prescribed extreme generalized singular values and associated triplets of generalized singular vectors can be determined by the global solutions of the constrained trace optimization problems. Then we propose a geometric inexact Newton–conjugate gradient (Newton-CG) method for solving their equivalent trace minimization problems over the Riemannian manifold of all fixed-rank partial isometries. The proposed method can extract not only the prescribed extreme generalized singular values but also associated triplets of generalized singular vectors. Under some mild assumptions, we establish the global and quadratic convergence of the proposed method. Finally, numerical experiments on both synthetic and real data sets show the effectiveness and high accuracy of our method.Keywords
This publication has 38 references indexed in Scilit:
- GSVD Comparison of Patient-Matched Normal and Tumor aCGH Profiles Reveals Global Copy-Number Alterations Predicting Glioblastoma Multiforme SurvivalPLOS ONE, 2012
- Comparing Two Matrices by Means of Isometric Projections2011
- A New Approach to Generalized Singular Value DecompositionSIAM Journal on Matrix Analysis and Applications, 2005
- Optimization algorithms exploiting unitary constraintsIEEE Transactions on Signal Processing, 2002
- Analysis and Properties of the Generalized Total Least Squares Problem $AX \approx B$ When Some or All Columns in A are Subject to ErrorSIAM Journal on Matrix Analysis and Applications, 1989
- Computing the Generalized Singular Value DecompositionSIAM Journal on Scientific and Statistical Computing, 1986
- Computing the CS and the generalized singular value decompositionsNumerische Mathematik, 1985
- On the Method of Weighting for Equality-Constrained Least-Squares ProblemsSIAM Journal on Numerical Analysis, 1985
- The general linear model and the generalized singular value decompositionLinear Algebra and its Applications, 1985
- Computing theCS decomposition of a partitioned orthonormal matrixNumerische Mathematik, 1982