Abstract
A new orthogonal decomposition for square dense matrices is proposed. For matrices of bigger size the computational time for this decomposition and the corresponding solution method is less than the computational time for the usual Givens QR decomposition The backward stability of the proposed decomposition is studied, and it is proved that the backward error depends linearly on the size of the matrix. Finally, some numerical evidence is given.
C.R. CATEGORIES: