Page 278 - Compact Numerical Methods For Computers

Bibliography 265
EVANS D J (ed.) 1974 Software for Numerical Mathematics (London: Academic)
EVANS J W and CRAIG R J 1979 Function minimization using a modified Nelder-Mead simplex search
procedure Technical Report No 144 (Lexington, KY: Dept of Statistics, Univ. of Kentucky)
FIACCO A V and MCCORMICK G P 1964 Computational algorithm for the sequential unconstrained
minimization technique for nonlinear programming Mgmt Sci. 10 601-17
---1966 Extensions of SUMT for nonlinear programming: equality constraints and extrapolation Mgmt
Sci. 12 816-28
FINKBEINER D T 1966 Introduction to Matrices and Linear Transformations (San Francisco: Freeman)
FLETCHER R 1969 Optimization Proceedings of a Symposium of the Institute of Mathematics and its
Applications, Univ. of Keele, 1968 (London: Academic)
---1970 A new approach to variable metric algorithms Comput. J. 13 317-22
---1971 A modified Marquardt subroutine for nonlinear least squares Report No AERE-R 6799
(Harwell, UK: Mathematics Branch, Theoretical Physics Division, Atomic Energy Research Establish-
ment)
---1972 A FORTRAN subroutine for minimization by the method of conjugate gradients Report No
AERE-R 7073 (Harwell, UK: Theoretical Physics Division, Atomic Energy Research Establishment)
---1980a Practical Methods of Optimization vol 1: Unconstrained Optimization (New York/Toronto:
Wiley)
---1980b Practical Methods of Optimization vol 2: Constrained Optimization (New York/Toronto:
Wiley)
FLETCHER R and POWELL M J D 1963 A rapidly convergent descent method for minimization Comput. J. 6
163-8
FLETCHER R and REEVES C M 1964 Function minimization by conjugate gradients Comput. J. 7 149-54
FORD B and HALL G 1974 The generalized eigenvalue problem in quantum chemistry Comput. Phys.
Commun. 8 337-48
FORSYTHE G E and HENRICI P 1960 The cyclic Jacobi method for computing the principal values of a
complex matrix Trans. Am. Math. Soc. 94 l-23
FORSYTHE G E, MALCOLM M A and MOLER C E 1977 Computer Methods for Mathematical Computations
(Englewood Cliffs, NJ: Prentice-Hall)
FRIED I 1972 Optimal gradient minimization scheme for finite element eigenproblems J. Sound Vib. 20
333-42
FRÖBERG C 1965 Introduction to Numerical Analysis (Reading, Mass: Addison-Wesley) 2nd edn, 1969
GALLANT A R 1975 Nonlinear regression Am. Stat. 29 74-81
GASS S I 1964 Linear Programming 2nd edn (New York/Toronto: McGraw-Hill)
GAUSS K F 1809 Theoria Motus Corporum Coelestiam Werke Bd. 7 240-54
GAY D M 1983 Remark on algorithm 573 (NL2SOL: an adaptive nonlinear least squares algorithm) ACM
Trans. Math. Softw. 9 139
GENTLEMAN W M 1973 Least squares computations by Givens’ transformations without square roots J.
Inst. Maths Applies 12 329-36
GENTLEMAN W M and MAROVICH S B 1974 More on algorithms that reveal properties of floating point
arithmetic units Commun. ACM 17 276-7
GERADIN M 1971 The computational efficiency of a new minimization algorithm for eigenvalue analysis J.
Sound Vib. 19 319-31
GILL P E and MURRAY W (eds) 1974 Numerical Methods for Constrained Optimization (London:
Academic)
---1978 Algorithms for the solution of the nonlinear least squares problem SIAM J. Numer. Anal. 15
9 7 7 - 9 2
GILL P E, MURRAY W and WRIGHT M H 1981 Practical Optimization (London: Academic)
GOLUB G H and PEREYRA V 1973 The differentiation of pseudo-inverses and nonlinear least squares
problems whose variables separate SIAM J. Numer. Anal. 10 413-32
GOLUB G H and STYAN G P H 1973 Numerical computations for univariate linear models J. Stat. Comput.
Simul. 2 253-74
GOLUB G H and VAN LOAN C F 1983 Matrix Computations (Baltimore, MD: Johns Hopkins University
Press)
GREGORY R T and KARNEY D L 1969 Matrices for Testing Computational Algorithms (New York: Wiley
Interscience)