Modifying the generalized singular value decomposition with application in direction-of-arrival finding
The classes of updating and downdating algorithms for modifying the generalized singular value decomposition (GSVD) of a matrix pair are developed. The method based on CS decomposition is more accurate but computationally more expensive than the method based on the generalized eigenvalue decomposition. In both cases the updating and downdating problems can be reduced to a rank-one SVD updating problem. Applications in direction-of-arrival finding are derived. Numerical experiments are carried out to show the tracking ability of the algorithms.
- Computing the CS and the generalized singular value decompositions
- Computing the Generalized Singular Value Decomposition
- Downdating the Singular Value Decomposition
- Generalizing the Singular Value Decomposition
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 4150052 (Why is no real title available?)
- scientific article; zbMATH DE number 3810798 (Why is no real title available?)
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization
- Towards a Generalized Singular Value Decomposition
This page was built for publication: Modifying the generalized singular value decomposition with application in direction-of-arrival finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387252)