See other catalogues for
The MathWorks
You may also be interested in
Text version of the page
| | | | | | | | | | | |
| | | |
| | | qr | | |
| | | |
| | | 0.5000 0 0.1667 The quantity toi is a tolerance used to demie if a diagonal clement of R is negligible. If [Q,H,E] =qr(A),then toi - max(size<A))*eps*abs(R(1,1)) The solution >! was computed using the ratiocination and the two steps y = Q'*b; x = FUy The computed solution can lie cheeked by forming Ax- '''his equals b to within roundoff error, which indicates that even though the simultaneous equations Ax = b are overdetermined and rank deficient, they happen to be consistent. There are infinitely many solution vectors x; the Q.K lacuiri/at urn has found just one of them. Algorithm Inputs of Type Double For inputs of type double, qr uses the LAPACK routines listed in the following tabic to compute (lie QR decomposition. | | |
| | | |
| | | | | | | | | | | | Syntax | Real | Complex | | | | X = qr X = qr | (A) (A,0) | DGEORF | ZGEORF | | | | [Q,R] [Q,R] | = qr(A) = qr(A,0) | DGEQRF, DORGQR | ZGEORF, ZUNGGR | | | | [Q,R,e [Q,R,e | I = qr(A) I = qr(A,0) | DGE0P3, DORGQR | ZGE0P3,ZUNGOR | | | | | | | | | | | |
| | | |
| | | 2-2685 | | |
| | | |
| | | | | | | | | | | |