A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
New Method of Givens Rotations for Triangularization of Square Matrices
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 transformdoi:10.4236/alamt.2014.42004 fatcat:rkzqf6iucjb3jp5gvk5avphfuq