Page 281 - Compact Numerical Methods For Computers
P. 281

268               Compact numerical methods for computers
                            NASH J C and TEETER N J 1975 Building models: an example from the Canadian dairy industry Can. Farm.
                              Econ. 10 17-24
                            NASH  J C and WALKER-SMITH  M 1986 Using compact and portable function minimization codes in
                              forecasting applications INFOR 24 158-68
                           -- 1987 Nonlinear Parameter Estimation, an Integrated System in Basic (New York: Marcel Dekker)
                            NASH  J C and WANG  R L C 1986 Algorithm 645 Subroutines for testing programs that compute the
                              generalized inverse of a matrix ACM Trans. Math. Softw. 12 274-7
                            NASH  S G 1982 Truncated-Newton methods Report No STAN-CS-82-906 (Stanford, CA: Dept of
                              Computer Science, Stanford Univ.)
                            ---1983 Truncated-Newton methods for large-scale function minimization Applications of Nonlinear
                              Programming to Optimization and Control ed. H E Rauch (Oxford: Pergamon) pp 91-100
                            ---1984 Newton-type minimization via the Lanczos method SIAM J. Numer. Anal. 21 770-88
                            ---1985a Preconditioning of truncated-Newton methods SIAM J. Sci. Stat. Comp. 6 599-616
                           ---1985b Solving nonlinear programming problems using truncated-Newton techniques Boggs, Byrd
                              and Schnabel pp 119-36
                            NASH  S G and RUST  B 1986 Regression problems with bounded residuals Technical Report No 478
                              (Baltimore, MD: Dept of Mathematical Sciences, The Johns Hopkins University)
                            NELDER  J A and MEAD  R 1965 A simplex method for function minimization Comput. J. 7 308-13
                            NEWING  R A and CUNNINGHAM  J 1967 Quantum Mechanics (Edinburgh: Oliver and Boyd)
                            OLIVER  F R 1964 Methods of estimating the logistic growth function Appl. Stat. 13 57-66
                           ---1966 Aspects of maximum likelihood estimation of the logistic growth function JASA 61 697-705
                           OLSSON  D M and NELSON  L S 1975 The Nelder-Mead simplex procedure for function minimization
                              Technometrics 17 45-51; Letters to the Editor 3934
                            O’NEILL R 1971 Algorithm AS 47: function minimization using a simplex procedure Appl. Stat. 20 338-45
                            OSBORNE M R 1972 Some aspects of nonlinear least squares calculations Numerical Methods for Nonlinear
                              Optimization ed. F A Lootsma (London: Academic) pp 171-89
                            PAIGE  C C and SAUNDERS  M A 1975 Solution of sparse indefinite systems of linear equations SIAM J.
                              Numer. Anal. 12 617-29
                            PAULING L and WILSON E B 1935 Introduction to Quantum Mechanics with Applications to Chemistry (New
                              York: McGraw-Hill)
                            PENROSE R 1955 A generalized inverse for matrices Proc. Camb. Phil. Soc. 51 406-13
                            PERRY  A and SOLAND  R M 1975 Optimal operation of a public lottery Mgmt. Sci. 22 461-9
                            PETERS  G and WILKINSON  J H 1971 The calculation of specified eigenvectors by inverse iteration Linear
                              Algebra, Handbook for Automatic Computation vol 2, eds J H Wilkinson and C Reinsch (Berlm:
                              Springer) pp 418-39
                           ---1975 On the stability of Gauss-Jordan elimination with pivoting Commun. ACM 18 20-4
                            PIERCE B O and FOSTER R M 1956 A Short Table of Integrals 4th edn (New York: Blaisdell)
                            POLAK  E and RIBIERE  G 1969 Note sur la convergence de méthodes de directions conjugées Rev. Fr. Inf.
                              Rech. Oper. 3 35-43
                            POWELL M J D 1962 An iterative method for stationary values of a function of several variables Comput. J.
                              5 147 51
                            ---1964 An efficient method for finding the minimum of a function of several variables without
                              calculating derivatives Comput. J. 7 155-62
                           ---1975a Some convergence properties of the conjugate gradient method CSS Report No 23 (Harwell,
                              UK: Computer Science and Systems Division, Atomic Energy Research Establishment)
                            ----1975b Restart procedures for the conjugate gradient method CSS Report No 24 (Harwell, UK:
                              Computer Science and Systems Division, Atomic Energy Research Establishment)
                           ---1981 Nonlinear Optimization (London: Academic)
                            PRESS  W H, FLANNERY  B P, TEUKOLSKY  S A and VETTERLING  W T (1986/88) Numerical Recipes (in
                              Fortran/Pascal/C), the Art of Scientific Computing (Cambridge, UK: Cambridge University Press)
                            RALSTON  A 1965 A First Course in Numerical Analysis (New York: McGraw-Hill)
                            RATKOWSKY  D A 1983 Nonlinear Regression Modelling (New York: Marcel-Dekker)
                            REID  J K 1971 Large Sparse Sets of Linear Equations (London: Academic)
                            RHEINBOLDT  W C 1974 Methods for Solving Systems of Nonlinear Equations (Philadelphia: SIAM)
                            RICE  J 1983 Numerical Methods Software and Analysis (New York: McGraw-Hill)
   276   277   278   279   280   281   282   283   284   285   286