%0 Journal Article
%T Effective Methods of QR-Decompositions of Square Complex Matrices by Fast Discrete Signal-Induced Heap Transforms
%A Artyom M. Grigoryan
%J Advances in Linear Algebra & Matrix Theory
%P 87-110
%@ 2165-3348
%D 2022
%I Scientific Research Publishing
%R 10.4236/alamt.2022.124005
%X The purpose of this work is to present an effective tool for computing different QR-decompositions of a complex nonsingular square matrix. The concept of the discrete signal-induced heap transform (DsiHT, Grigoryan 2006) is used. This transform is fast, has a unique algorithm for any length of the input vector/signal and can be used with different complex basic 2 กม 2 transforms. The DsiHT is zeroing all components of the input signal while moving or heaping the energy of the signal to one component, for instance the first one. We describe three different types of QR-decompositions that use the basic transforms with the <i><b>T</b></i>, <i><b>G</b></i>, and <i><b>M</b></i>-type complex matrices we introduce, as well as without matrices but using analytical formulas. We also present the mixed QR-decomposition, when different type DsiHTs are used in different stages of the algorithm. The number of such decompositions is greater than 3<sup>(<i>N</i>-1)</sup>, for an <i>N</i> กม <i>N</i> complex matrix. Examples of the QR-decomposition are described in detail for the 4 กม 4 and 6 กม 6 complex matrices and compared with the known method of Householder transforms. The precision of the QR-decompositions of <i>N</i> กม <i>N</i> matrices, when <i>N</i> are 6, 13, 17, 19, 21, 40, 64, 100, 128, 201, 256, and 400 is also compared. The MATLAB-based scripts of the codes for QR-decompositions by the described DsiHTs are given.
%K QR Decomposition
%K Signal-Induced Heap Transform
%K Householder Transform
%K Givens Rotations
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=128553