Page 282 - Compact Numerical Methods For Computers

Bibliography 269
RILEY D D 1988 Structured programming: sixteen years later J. Pascal, Ada and Modula-2 7 42-8
ROSENBKOCK H H 1960 An automatic method for finding the greatest or least value of a function Comput.
J. 3 175-84
ROSS G J S 1971 The efficient use of function minimization in non-linear maximum-likelihood estimation
Appl. Stat. 19 205-21
---1975 Simple non-linear modelling for the general user Warsaw: 40th Session of’ the International
Statistical Institute 1-9 September 1975, ISI/BS Invited Paper 81 pp 1-8
RUHE A and WEDIN P-A 1980 Algorithms for separable nonlinear least squares problems SIAM Rev. 22
318-36
RUHE A and WIBERG T 1972 The method of conjugate gradients used in inverse iteration BIT 12 543-54
RUTISHAUSER H 1966 The Jacobi method for real symmetric matrices Numer. Math. 9 1-10; also in Linear
Algebra, Handbook for Automatic Computation vol 2, eds J H Wilkinson and C Reinsch (Berlin:
Springer) pp 202-11 (1971)
SARGENT R W H and SEBASTIAN D J 1972 Numerical experience with algorithms for unconstrained
minimisation Numerical Methods for Nonlinear Optimization ed. F A Lootsma (London: Academic) pp
445-68
SCHNABEL R B, KOONTZ J E and WEISS B E 1985 A modular system of algorithms for unconstrained
minimization ACM Trans. Math. Softw. 11 419-40
SCHWARZ H R, RUTISHAUSER H and STIEFEL E 1973 Numerical Analysis of Symmetric Matrices
(Englewood Cliffs, NJ: Prentice- Hall)
SEARLE S R 1971 Linear Models (New York: Wiley)
SHANNO D F 1970 Conditioning of quasi-Newton methods for function minimization Math. Comput. 24
647-56
SHEARER J M and WOLFE M A 1985 Alglib, a simple symbol-manipulation package Commun. ACM 28
820-5
SMITH F R Jr and SHANNO D F 1971 An improved Marquardt procedure for nonlinear regressions
Technometrics 13 63-74
SORENSON H W 1969 Comparison of some conjugate direction procedures for function minimization J.
Franklin Inst. 288 421-41
SPANG H A 1962 A review of minimization techniques for nonlinear functions SIAM Rev. 4 343-65
SPENDLEY W 1969 Nonlinear least squares fitting using a modified Simplex minimization method Fletcher
pp 259-70
SPENDLEY W, HEXT G R and HIMSWORTH F R 1962 Sequential application of simplex designs in
optimization and evolutionary operation Technometric. 4 441-61
STEWART G W 1973 Introduction to Matrix Computations (New York: Academic)
---1976 A bibliographical tour of the large, sparse generalized eigenvalue problem Sparse Matrix
Computations eds J R Bunch and D J Rose (New York: Academic) pp 113-30
---1987 Collinearity and least squares regression Stat. Sci. 2 68-100
STRANG G 1976 Linear Algebra and its Applications (New York: Academic)
SWANN W H 1974 Direct search methods Numerical Methods for Unconstrained Optimization ed. W
Murray (London/New York: Academic)
SYNGE J L and GRIFFITH B A 1959 Principles of Mechanics 3rd edn (New York: McGraw-Hill)
TOINT PH L 1987 On large scale nonlinear least squares calculations SIAM J. Sci. Stat. Comput. 8 416-35
VARGA R S 1962 Matrix Iterative Analysis (Englewood Cliffs. NJ: Prenticee-Hall)
WILKINSON J H 1961 Error analysis of direct methods of matrix inversion J. ACM 8 281-330
---1963 Rounding Errors in Algebraic Processes (London: HMSO)
---1965 The Algebraic Eigenvalue Problem (Oxford: Clarendon)
WILKINSUN J H and REINSCH C (eds) 197 1 Linear Algebra, Handbook for Automatic Computation vol 2
(Berlin: Springer)
WOLFE M A 1978 Numerical Methods for Unconstrained Optimization, an Introduction (Wokingham, MA:
Van Nostrand-Reinhold)
YOURDON E 1975 Techniques of’ Program Structure and Design (Englewood Cliffs, NJ: Prentice-Hall)
ZAMBARDINO R A 1974 Solutions of systems of linear equations with partial pivoting and reduced storage
requirements Comput. J. 17 377-8