BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-76-559
       ENTRY:: July 04, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Rank degeneracy and least squares problems
        TYPE:: Technical Report
      AUTHOR:: Golub, Gene H.
      AUTHOR:: Klema, Virginia C.
      AUTHOR:: Stewart, Gilbert W.
        DATE:: August 1976
       PAGES:: 42
    ABSTRACT:: This paper is concerned with least squares problems when the
               least squares matrix A is near a matrix that is not of full
               rank. A definition of numerical rank is given. It is shown
               that under certain conditions when A has numerical rank r
               there is a distinguished r dimensional subspace of the column
               space of A that is insensitive to how it is approximated by r
               independent columns of A. The consequences of this fact for
               the least squares problem are examined. Algorithms are
               described for approximating the stable part of the column
               space of A.
       NOTES:: [Adminitrivia V1/Prg/19950704]
         END:: STAN//CS-TR-76-559