FORTRAN subroutines for updating the QR decomposition
暂无分享,去创建一个
[1] D. M. Allen. Mean Square Error of Prediction as a Criterion for Selecting Variables , 1971 .
[2] D. Goldfarb. Factorized variable metric methods for unconstrained optimization , 1976 .
[3] G. Stewart,et al. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , 1976 .
[4] G. Stewart,et al. A Stable Variant of the Secant Method for Solving Nonlinear Equations , 1976 .
[5] J. H. Wilkinson,et al. AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .
[6] G. Stewart. The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization , 1979 .
[7] B. Parlett. The Symmetric Eigenvalue Problem , 1981 .
[8] Albert G. Buckley. Algorithm 580: QRUP: A Set of FORTRAN Routines for Updating QR Factorizations [F5] , 1981, TOMS.
[9] Gene H. Golub,et al. Matrix computations , 1983 .
[10] Fuyun Ling,et al. A recursive modified Gram-Schmidt algorithm for least- squares estimation , 1986, IEEE Trans. Acoust. Speech Signal Process..
[11] Jack Dongarra,et al. Linear algebra on high performance computers , 1986 .
[12] Jack Dongarra,et al. LINPACK Users' Guide , 1987 .
[13] T. Chan. Rank revealing QR factorizations , 1987 .