Численное решение задач метода наименьших квадратов - Лоуcон Ч.
Скачать (прямая ссылка):
9. Фадде ев Д.К., К у б л а н о в с к ая В.Н.,Фаддеева В.Н. О решении линейных алгебраических систем с примоуголыгыми матрицами. - Тр. Мат. ии-та АН СССР, 1968,96, с. 76-92.
10. Ф и а к к о А., М а к-К о р м и к Дж. Нелинейное программирование: методы последовательной безусловной минимизации. - М.: Мир, 1972.
П.Форсайт Дж., М о л е р К. Численное решение систем линейных алгебраических уравнений. - М.: Мир, 1969.
12. Халмош П.Р. Конечномерные векторные пространства. - М.: Фиэматгиз, 1963.
13. ANSI Subcommittee X3J3. Clarification of Fortran standard-second report.- Com-mun. ACM, 1971, 14, N»10, p. 628-642.
14. ASA Committee X3. Fottran vs. Basic Fortran. - Commun. ACM., 1964, 7, №10, p. 591-625.
15. Autonne L. Sur les matrices hypohermitienes et sut les matrices unitaires. -Ann. Univ. Lyon, 1915, 38, p 1-77
16. Bard Y. Comparison of gradient methods for the solution of nonlinear parameter estimation problems. - SIAM J. Numer. Anal., 1970, 7, №1, p. 157-186.
17. В art els R.H. A stabilization of the simplex method. - Numer. Math., 1971, 16, p. 414-434.
18. В a r t e 1 s R.H., G о 1 u b G.H., Saunders M.A. Numerical techniques in mathematical programming. - Nonlinear programming. - New York: Academic Press, 1970, p. 123-176.
19. В a u e r F.L. Optimal scaling of matrices and the importance of the minimal condition. - Proc. IFIP Congr. 1962. - Amsterdam: North Holland, 1963, p. 198-201.
20. В e n-I s r a e 1 A. A modified Newton-Raphson method for the solution of systems of equations. - Israel J. Math., 1965, 3, p. 94-98.
21. В e n-I s r a e 1 A. On error bounds for generalized inverses. - SIAM J. Numer. Anal., 1966, 3,N»4, p. 585-592.
22. Bennett J.M. Triangular factors of modified matrices. - Numer. Math., 1965, 7, p. 217-221.
15*
219
23. Bjbrck Л. Solving linear least squares problems by Gram-Schmidt orthogona-lization. - BIT, 1967, 7, p. 1-21.
24. Bjbrck A. Iterative refinement of linear least squares solutions I. - BIT, 1967, 7, p. 257-278.
25. Bjbrck A.,Golub G.H. Iterative refinement of linear least squares solutions by Householder transformation. - BIT, 1967, 7, p. 322-337.
26. В j Ь г с к A., G о 1 u b G.H. Numerical methods for computing angles between linear subspaces. - Math. Сотр., 1973, 27, p. 579-594.
27. Boggs D.H. A partial-step algorithm for the non-linear estimation problem. -AIAAJ., 1972, 10, №5, p. 675-679.
28. В оu 11 i оn Т., Odell P. Generalized inverse matrices. - New York: Wiley. 1971.
29. В г о w n K.M. Computer solution of nonlinear algebraic equations and nonlinear optimization problems. - Proc. Share, XXXVH. - New York, 12 p.
30. Buchanan J.E., Thomas D.H. On least-squares fitting of twodimensional data with a special structure - SIAM J. Numer. Anal., 1968, 5, N»2, p. 252-257.
31.Businger PA. Matrix scaling with respect to the maximumnorm, the sum-norm, and the euclidean norm. - Texas Univ., Austin. Thesis TNN71, 1967, 119 p.
32. В u s i n g e r P.A. MIDAS-solution of linear algebraic equations. - Bell Teleph. Lab., Numer. Math. Сотр. Programs 3, issue I. - Murray Hill, N.J., 1970.
33. В u singe г P.A. Updating a singular value decomposition. - BIT, 1970, 10, p. 376-385.
34. В u singer P.A., Golub G.H. An Algol procedure for computing the singular value decomposition. - Stanford Univ. Rept. N»CS-73. - Calif., Stanford, 1967.
35.Businger P.A., Golub G.H. Singular value decomposition of a complex matrix. - Commun. ACM, 1969, 12,N» 10, p. 564- 565.
36. С a r a s s о С, L a u r e n t P.J. On the numerical construction and the practical use of interpolating spline-functions.- Proc. 1HP Congr., 1968. - Amsterdam: North Holland, 1969.
37. С h a m b e r s J.M. Regression updating. - J. Amer. Stat. Ass., 1971, 66, p. 744-748.
38. С h e n e у E.M., Goldstein A.A. Mean-square approximation by generalized rational functions. - Boeing Sci. Res. Lab. Math. Note, №465. - Seattle, 1966, p. 17.
39. Cody W.J. Software for the elementary, functions. - Mathematical Software. -New York Academic Press, 1971, p. 171-186.
40. С о w d e n D.J. A procedure for computing regression coefficients. — J. Amer. Stat. Ass., 1958, 53, p. 144-150.
41. С о x M.G. The numerical evaluation of fl-splines. - Nath. Phys. Lab. Rept. N»NPL-DNAC-4. - England, Middlesex, Teddington, 1971, 34 p.
42. С r u i s e D.R. Optimal regression models for multivariate analysis (factor analysis).-Naval Weapons Center Rept. NWCTP 5103. - Calif., China Lake, 1971, 60 p.
43. D a v i d о n W.C. Variance algorithm for minimization. - Optimization. - London: Academic Press, 1968, p. 13-20.
44 Davis Ch.D., К a h a n W.M. The rotation of eigenvectors by a perturbation III. -SIAM J. Numer. Anal., 1970, 7, N» 1, p. 1 -46.
45. De Boor C. Subroutine package for calculating with Д-splines. - Los Alamos Sci.
Lab. Rept. N»LA-4728-MS, 1971, 12 p.
46. D e Boor C. On calculating with fi-splines. - J. Approximation Theory, 1972, 6,N»l,p. 50-62.
47. D e Boor G, Rice J.R. Least squares cubic spline approximation I - fixed knots. - Purdue Univ. Rept. CSD TR 20. lnd., Lafayette, 1968, 30 p.
