Given a QR factorization of a real or complex matrix
A = Q*R, Q unitary and
R upper trapezoidal, return the QR factorization of
[A(:,1:j-1), U, A(:,j:n)],
where u is a column vector to be inserted into A
(if orient is "col"
),
or the QR factorization of [A(1:j-1,:);X;A(:,j:n)],
where x is a row orient is "row"
).
The default value of orient is "col"
.
If orient is "col"
, j may be an index vector
resulting in the QR factorization of a matrix B such that
A(:,j) = [] gives B. Notice that the latter case is done as
a sequence of k deletions; thus, for k large enough, it will be both faster
and more accurate to recompute the factorization from scratch.
If orient is "col"
, the QR factorization supplied may
be either full (Q is square) or economized (R is square).
If orient is "row"
, full factorization is needed.
See also: qr, qrupdate, qrinsert, qrshift.
Package: octave