Anonymous user
Talk:QR decomposition: Difference between revisions
m
→Questionnable intent
(→Questionnable intent: new section) |
|||
Line 74:
The task is misleading at best. Some answers successfully compute Householder projections,
but, like the task description, they fail to understand that a QR decomposition is never
computed this way, as this would be too much time- and space- consumming.
Only the vector ''u'' of array ''I - s uu''' is ever stored, together with ''s'' or something equivalent to ''s''.
And both ''Q'' and ''R'' are stored in ''A'' in the process, with only a supplementary vector.
LINPACK and LAPACK are of course no exception, though they handle the question in a [http://stackoverflow.com/questions/3031215/mystified-by-qr-q-what-is-an-orthonormal-matrix-in-compact-form slightly
different way].
And when solving a system given an already computed QR in packed form, there are also ways to do
| |||