Performs QR factorization for a complex matrix A. Details
![]() |
A is an m-by-n complex matrix, where m is the number of rows in A and n is the number of columns in A. It can be either a square or rectangular matrix. |
![]() |
The default algorithm is Householder. |
![]() |
Q is an m-by-m, orthogonal matrix. |
![]() |
R is an m-by-n, upper triangular matrix. |
![]() |
error returns any error or warning condition from the VI. |
QR factorization is also called orthogonal-triangular factorization. It factors a complex matrix A into two matrices; one is an orthogonal matrix Q, the other is an upper triangular matrix R, so that A = QR. This VI provides three methods for the factorization: Householder, Givens, and Fast Givens.
You can use QR factorization to solve linear systems that contain less or more equations than unknowns.