Rank revealing QR factorizations
暂无分享，去创建一个
[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[2] G. Golub,et al. Linear least squares solutions by householder transformations , 1965 .
[3] Ilkka Karasalo,et al. A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem , 1974 .
[4] Ilkka Karasalo,et al. On computing bounds for the least singular value of a triangular matrix , 1975 .
[5] C. Lawson,et al. Solving least squares problems , 1976, Classics in applied mathematics.
[6] G. Stewart,et al. Rank degeneracy and least squares problems , 1976 .
[7] G. Stewart. On the Implicit Deflation of Nearly Singular Systems of Linear Equations , 1981 .
[8] Thomas A. Manteuffel,et al. An Interval Analysis Approach to Rank Determination in Linear Least Squares Problems , 1981 .
[9] Gene H. Golub,et al. Matrix computations , 1983 .
[10] T. Chan. Deflated Decomposition of Solutions of Nearly Singular Systems , 1984 .
[11] T. Chan. On the existence and computation of $LU$-factorizations with small pivots , 1984 .
[12] L. Foster. Rank and null space calculations using matrix decomposition without column interchanges , 1986 .