New Method of Givens Rotations for Triangularization of Square Matrices

Artyom M. Grigoryan
2014 Advances in Linear Algebra and Matrix Theory  
This paper describes a new method of QR-decomposition of square nonsingular matrices (real or complex) by the Givens rotations through the unitary discrete heap transforms. This transforms can be defined by a different path, or the order of processing components of input data, which leads to different realizations of the QR-decomposition. The heap transforms are fast, because of a simple form of decomposition of their matrices. The direct calculation of the N-point discrete heap transform
more » ... es no more than 5(N − 1) multiplications, 2(N − 1) additions, plus 3(N − 1) trigonometric operations. The QR-decomposition of the square matrix N × N uses about 4/3N 3
doi:10.4236/alamt.2014.42004 fatcat:rkzqf6iucjb3jp5gvk5avphfuq