from
Rank-Revealing QR factorization
by Ivo Houtzager
Rank-Revealing QR factorization of an array
|
| rrqrx.m |
%RRQRX Rank-revaeling orthogonal-triangular decomposition.
% [Q,R,Z] = RRQRX(A), where A is m-by-n, produces an m-by-n upper
% triangular matrix R and an m-by-m unitary matrix Q so that A(:,Z) =
% Q*R. Based on methods related to Chandrasekaran&Ipsen's algorithms.
%
% [Q,R,Z] = RRQRX(A,0) produces the "economy size" decomposition. If m>n,
% only the first n columns of Q and the first n rows of R are computed.
% If m<=n, this is the same as A(:,Z) = Q*R.
%
% See also RRQRY.
|
|
Contact us