11 March 2015 Fast heap transform-based QR-decomposition of real and complex matrices: algorithms and codes
Author Affiliations +
Abstract
In this paper, we describe a new look on the application of Givens rotations to the QR-decomposition problem, which is similar to the method of Householder transformations. We apply the concept of the discrete heap transform, or signal-induced unitary transforms which had been introduced by Grigoryan (2006) and used in signal and image processing. Both cases of real and complex nonsingular matrices are considered and examples of performing QR-decomposition of square matrices are given. The proposed method of QR-decomposition for the complex matrix is novel and differs from the known method of complex Givens rotation and is based on analytical equations for the heap transforms. Many examples illustrated the proposed heap transform method of QR-decomposition are given, algorithms are described in detail, and MATLAB-based codes are included.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Artyom M. Grigoryan, "Fast heap transform-based QR-decomposition of real and complex matrices: algorithms and codes", Proc. SPIE 9411, Mobile Devices and Multimedia: Enabling Technologies, Algorithms, and Applications 2015, 94110N (11 March 2015); doi: 10.1117/12.2083404; https://doi.org/10.1117/12.2083404
PROCEEDINGS
12 PAGES


SHARE
Back to Top