A Kogbetliantz-type algorithm for the hyperbolic SVD

From MaRDI portal
Publication:2138394

DOI10.1007/S11075-021-01197-4zbMATH Open1492.65091arXiv2003.06701OpenAlexW3200667788WikidataQ115602962 ScholiaQ115602962MaRDI QIDQ2138394FDOQ2138394


Authors: Vedran Novaković, Sanja Singer Edit this on Wikidata


Publication date: 11 May 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: In this paper a two-sided, parallel Kogbetliantz-type algorithm for the hyperbolic singular value decomposition (HSVD) of real and complex square matrices is developed, with a single assumption that the input matrix, of order n, admits such a decomposition into the product of a unitary, a non-negative diagonal, and a J-unitary matrix, where J is a given diagonal matrix of positive and negative signs. When J=pmI, the proposed algorithm computes the ordinary SVD. The paper's most important contribution -- a derivation of formulas for the HSVD of 2imes2 matrices -- is presented first, followed by the details of their implementation in floating-point arithmetic. Next, the effects of the hyperbolic transformations on the columns of the iteration matrix are discussed. These effects then guide a redesign of the dynamic pivot ordering, being already a well-established pivot strategy for the ordinary Kogbetliantz algorithm, for the general, nimesn HSVD. A heuristic but sound convergence criterion is then proposed, which contributes to high accuracy demonstrated in the numerical testing results. Such a J-Kogbetliantz algorithm as presented here is intrinsically slow, but is nevertheless usable for matrices of small orders.


Full work available at URL: https://arxiv.org/abs/2003.06701




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: A Kogbetliantz-type algorithm for the hyperbolic SVD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138394)