Rounding error and perturbation bounds for the symplectic QR factorization

To compute the eigenvalues of a skew-symmetric matrix A, we can use a one-sided Jacobi-like algorithm to enhance accuracy. This algorithm begins by a suitable Cholesky-like factorization of A, A=G T JG . In some applications, A is given implicitly in that form and its natural Cholesky-like factor G...

Full description

Bibliographic Details

Published in:	Linear algebra and its applications Vol. 358; no. 1; pp. 255 - 279
Main Authors:	Singer, Sanja, Singer, Saša
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 2003
Subjects:	Perturbation bounds Rounding error bounds Skew-symmetric eigenproblem Symplectic QR factorization Skew-symmetric eigenproblem Symplectic QR factorization Rounding error bounds Perturbation bounds
ISSN:	0024-3795, 1873-1856
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!