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

12/18/2019
by   Haibo Li, et al.
0

The joint bidiagonalization(JBD) process is a useful algorithm for approximating some extreme generalized singular values and vectors of a large sparse or structured matrix pair A, L. We present a rounding error analysis of the JBD process in finite precision arithmetic. The analysis builds connections between the JBD process and the two joint Lanczos bidiagonalizations. We investigate the loss of orthogonalities of the three groups of Lanczos vectors computed by the JBD process and show that semiorthogonality of the Lanczos vectors is enough to guarantee the accuracy of the computed quantities, which is a guidance for designing an efficient semiorthogonalization strategy for the JBD process. Based on the results of rounding error analysis, we investigate the convergence and accuracy of the approximate generalized values and vectors of A, L. We also analyze the residual norm appeared in the GSVD computation and show that we can use the residual norm as a stopping criterion for approximating generalized singular values and vectors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/10/2020

The joint bidiagonalization process with partial reorthogonalization

The joint bidiagonalization(JBD) process is a useful algorithm for the c...
research
03/13/2023

The joint bidiagonalization of a matrix pair with inaccurate inner iterations

The joint bidiagonalization (JBD) process iteratively reduces a matrix p...
research
12/15/2022

A skew-symmetric Lanczos bidiagonalization method for computing several largest eigenpairs of a large skew-symmetric matrix

The spectral decomposition of a real skew-symmetric matrix A can be math...
research
04/05/2020

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

In this paper, we derive new model formulations for computing generalize...
research
10/07/2019

BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property

We introduce an iterative method named BiLQ for solving general square l...
research
01/30/2022

Comparison of Matrix Norm Sparsification

Matrix sparsification is a well-known approach in the design of efficien...
research
09/02/2020

Approximate Generalized Inverses with Iterative Refinement for ε-Accurate Preconditioning of Singular Systems

We introduce a new class of preconditioners to enable flexible GMRES to ...

Please sign up or login with your details

Forgot password? Click here to reset