1994 | OriginalPaper | Chapter
QR-Decomposition
Author : Eric F. Van de Velde
Published in: Concurrent Scientific Computing
Publisher: Springer New York
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The QR-decomposition of a matrix is used to solve nearly singular, overde-termined, and underdetermined systems of linear equations. In specialized form, it is an important component of the QR-algorithm, which computes all eigenvalues and eigenvectors of a matrix. The multicomputer program for QR-decomposition is an application of recursive doubling, but several interesting complications arise.