![]() |
A is an m-by-n real 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. | ||||||
![]() |
algorithm has three possible options.
test
|
||||||
![]() |
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 real matrix A into two matrices. One is an orthogonal matrix Q, and 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 with more equations than unknowns.