GR decompositions and their relations to Cholesky-like factorizations

06/11/2020
by   Peter Benner, et al.
0

For a given matrix, we are interested in computing GR decompositions A=GR, where G is an isometry with respect to given scalar products. The orthogonal QR decomposition is the representative for the Euclidian scalar product. For a signature matrix, a respective factorization is given as the hyperbolic QR decomposition. Considering a skew-symmetric matrix leads to the symplectic QR decomposition. The standard approach for computing GR decompositions is based on the successive elimination of subdiagonal matrix entries. For the hyperbolic and symplectic case, this approach does in general not lead to a satisfying numerical accuracy. An alternative approach computes the QR decomposition via a Cholesky factorization, but also has bad stability. It is improved by repeating the procedure a second time. In the same way, the hyperbolic and the symplectic QR decomposition are related to the LDL^T and a skew-symmetric Cholesky-like factorization. We show that methods exploiting this connection can provide better numerical stability than elimination-based approaches.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/14/2021

Stable and Efficient Computation of Generalized Polar Decompositions

We present methods for computing the generalized polar decomposition of ...
07/29/2019

Perspectives on CUR Decompositions

This note discusses an interesting matrix factorization called the CUR D...
10/15/2019

Matrix Spectral Factorization for SA4 Multiwavelet

In this paper, we investigate Bauer's method for the matrix spectral fac...
06/12/2020

Sallow: a heuristic algorithm for treedepth decompositions

We describe a heuristic algorithm for computing treedepth decompositions...
07/10/2018

Orbits of monomials and factorization into products of linear forms

This paper is devoted to the factorization of multivariate polynomials i...
07/31/2019

Binary Component Decomposition Part I: The Positive-Semidefinite Case

This paper studies the problem of decomposing a low-rank positive-semide...
11/29/2021

A theory of meta-factorization

This paper introduces meta-factorization, a theory that describes matrix...
This week in AI

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