Stable and Efficient Computation of Generalized Polar Decompositions

04/14/2021
by   Peter Benner, et al.
0

We present methods for computing the generalized polar decomposition of a matrix based on the dynamically weighted Halley (DWH) iteration. This method is well established for computing the standard polar decomposition. A stable implementation is available, where matrix inversion is avoided and QR decompositions are used instead. We establish a natural generalization of this approach for computing generalized polar decompositions with respect to signature matrices. Again the inverse can be avoided by using a generalized QR decomposition called hyperbolic QR decomposition. However, this decomposition does not show the same favorable stability properties as its orthogonal counterpart. We overcome the numerical difficulties by generalizing the CholeskyQR2 method. This method computes the standard QR decomposition in a stable way via two successive Cholesky factorizations. An even better numerical stability is achieved by employing permuted graph bases, yielding residuals of order 10^-14 even for badly conditioned matrices, where other methods fail.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/11/2020

GR decompositions and their relations to Cholesky-like factorizations

For a given matrix, we are interested in computing GR decompositions A=G...
research
03/13/2023

CPQR-based randomized algorithms for generalized CUR decompositions

Based on the column pivoted QR decomposition, we propose some randomized...
research
09/21/2022

Incremental Updates of Generalized Hypertree Decompositions

Structural decomposition methods, such as generalized hypertree decompos...
research
06/29/2022

Generalized Pseudoskeleton Decompositions

We characterize some variations of pseudoskeleton (also called CUR) deco...
research
08/26/2022

Generalized and Multiscale Modal Analysis

This chapter describes modal decompositions in the framework of matrix f...
research
10/23/2022

Computing the minimum distance of the C(𝕆_3,6) polar Orthogonal Grassmann code with elementary methods

The polar orthogonal Grassmann code C(𝕆_3,6) is the linear code associat...
research
08/08/2022

Unitary canonical forms over Clifford algebras, and an observed unification of some real-matrix decompositions

We show that the spectral theorem – which we understand to be a statemen...

Please sign up or login with your details

Forgot password? Click here to reset