Volume 33, pp. 189-206, 2008-2009.

Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations

A. Salam and E. Al-Aidarous


Symplectic QR like methods for solving some structured eigenvalue problems involves SR factorization as a key step. The optimal symplectic Householder SR factorization (SROSH algorithm) is a suitable choice for performing such a factorization. In this paper, we carry out a detailed error analysis of the SROSH algorithm. In particular, backward and forward error results are derived. Also, the computational aspects of the algorithm (such as storage, complexity, implementation, factored form, block representation) are described. Some numerical experiments are presented.

Full Text (PDF) [171 KB], BibTeX

Key words

Skew-symmetric inner product, optimal symplectic Householder transformations, SR factorization, error analysis, backward and forward errors, implementation, factored form, WY factorization, complexity.

AMS subject classifications

65F15, 65F50

Links to the cited ETNA articles

[11]Vol. 33 (2008-2009), pp. 45-52 Miloud Sadkane and Ahmed Salam: A note on symplectic block reflectors

< Back