On accurate quotient singular value computation in floating-point arithmetic
From MaRDI portal
The authors propose a new algorithm for floating-point computation of the quotient singular value decomposition of an arbitrary matrix pair \((A,B)\in \mathbb{R}^{m\times n}\times \mathbb{R}^{p\times n}\). The algorithm proposed in the paper is an improvement and generalization of the tangent algorithm and it is designed to reduce a general pair \((A,B)\) to a (regular) pair with finite quotient singular values.
Recommendations
- A Tangent Algorithm for Computing the Generalized Singular Value Decomposition
- scientific article; zbMATH DE number 270062
- Accurate singular values and differential qd algorithms
- Implementation of Jacobi Rotations for Accurate Singular Value Computation in Floating Point Arithmetic
- New Accurate Algorithms for Singular Value Decomposition of Matrix Triplets
Cited in
(5)- Simultaneous multidiagonalization for the CS decomposition
- On the explicit expression of chordal metric between generalized singular values of Grassmann matrix pairs with applications
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- A new matrix maximization model for computing ratios of generalized singular values from high-order GSVD
- Singular value decomposition in extended double precision arithmetic
This page was built for publication: On accurate quotient singular value computation in floating-point arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706293)