New Formulation and Computation for Generalized Singular Values of Grassman Matrix Pair

04/05/2020
by   Wei-Wei Xu, et al.
0

In this paper, we derive new model formulations for computing generalized singular values of a Grassman matrix pair. These new formulations make use of truncated filter matrices to locate the i-th generalized singular value of a Grassman matrix pair. The resulting matrix optimization problems can be solved by using numerical methods involving Newton's method on Grassmann manifold. Numerical examples on synthetic data sets and gene expression data sets are reported to demonstrate the high accuracy and the fast computation of the proposed new ormulations for computing arbitrary generalized singular value of Grassman matrix pair.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2019

On choices of formulations of computing the generalized singular value decomposition of a matrix pair

For the computation of the generalized singular value decomposition (GSV...
research
12/18/2019

Cross product-free matrix pencils for computing generalized singular values

It is well known that the generalized (or quotient) singular values of a...
research
01/09/2022

Two harmonic Jacobi–Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair

Two harmonic extraction based Jacobi–Davidson (JD) type algorithms are p...
research
04/21/2022

Singularity-Avoiding Multi-Dimensional Root-Finder

We proposed in this paper a new method, which we named the W4 method, to...
research
12/18/2019

A rounding error analysis of the joint bidiagonalization process with applications to the GSVD computation

The joint bidiagonalization(JBD) process is a useful algorithm for appro...
research
10/29/2021

Takagi factorization of matrices depending on parameters and locating degeneracies of singular values

In this work we consider the Takagi factorization of a matrix valued fun...

Please sign up or login with your details

Forgot password? Click here to reset