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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

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...
04/12/2021

Characterization of Decomposition of Matrix Multiplication Tensors

In this paper, the canonical polyadic (CP) decomposition of tensors that...
07/29/2019

Perspectives on CUR Decompositions

This note discusses an interesting matrix factorization called the CUR D...
05/10/2021

Effective Methods of QR-Decompositions of Square Complex Matrices by Fast Discrete Signal-Induced Heap Transforms

The purpose of this work is to present an effective tool for computing d...
12/15/2021

A recursive eigenspace computation for the Canonical Polyadic decomposition

The canonical polyadic decomposition (CPD) is a compact decomposition wh...
12/11/2012

Tree Projections and Structural Decomposition Methods: Minimality and Game-Theoretic Characterization

Tree projections provide a mathematical framework that encompasses all t...
12/17/2018

Proper Generalized Decomposition of Parameterized Electrothermal Problems Discretized by the Finite Integration Technique

The proper generalized decomposition is applied to a static electrotherm...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.