Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches

Authors:
A. Salam;A. El Farouk;E. Al-Aidarous
Affiliations:
Laboratoire de Mathématiques Pures et Appliquées, Université du Littoral-Côte d'Opale. C.U. de la Mi-Voix, 50 rue F. Buisson, B.P. 699, 62228 Calais, Cedex, France;Laboratoire de Mathématiques Pures et Appliquées, Université du Littoral-Côte d'Opale. C.U. de la Mi-Voix, 50 rue F. Buisson, B.P. 699, 62228 Calais, Cedex, France;Department of Mathematics, King Abdul Aziz University (KAU), Girls Section, P.O. Box 80203, Jeddah 21589, Saudi Arabia
Venue:
Journal of Computational and Applied Mathematics
Year:
2008

Citing 5
Cited 0

The algebraic eigenvalue problem

The algebraic eigenvalue problem
Linear Optimal Control Systems

Linear Optimal Control Systems
Accuracy and Stability of Numerical Algorithms

Accuracy and Stability of Numerical Algorithms
Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils

SIAM Journal on Scientific Computing
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems

Quantified Score

Hi-index	7.29

Visualization

Abstract

The aim of this paper is to show how geometric and algebraic approaches lead us to a new symplectic elementary transformations: the 2-D symplectic Householder transformations. Their features are studied in details. Their interesting properties allow us to construct a new algorithm for computing a SR factorization. This algorithm is based only on these 2-D symplectic Householder transformations. Its new features are highlighted. The study shows that, in the symplectic case, the new algorithm is the corresponding one to the classical QR factorization algorithm, via the Householder transformations. Some numerical experiments are given.