Page 277 - Compact Numerical Methods For Computers

264 Compact numerical methods for computers

BUNCH J R and NEILSEN C P 1978 Updating the singular value decomposition Numerische Mathematik 31
111-28
BUNCH J R and ROSE D J (eds) 1976 Sparse Matrix Computation (New York: Academic)
BUSINGER P A 1970 Updating a singular value decomposition (ALGOL programming contribution, No 26)
BIT 10 376-85
CACEI M S and CACHERIS W P 1984 Fitting curves to data (the Simplex algorithm is the answer) Byte 9
340-62
CAUCHY A 1848 Méthode générale pour la resolution des systémes d’équations simultanées C. R. Acad.
Sci., Paris 27 536-8
CHAMBERS J M 1969 A computer system for fitting models to data Appl. Stat. 18 249-63
---1971 Regression updating J. Am. Stat. Assoc. 66 744-8
---1973 Fitting nonlinear models: numerical techniques Biometrika 60 1-13
CHARTRES B A 1962 Adaptation of the Jacobi methods for a computer with magnetic tape backing store
Comput. J. 5 51-60
CODY W J and WAITE W 1980 Software Manual for the Elementary Functions (Englewood Cliffs. NJ:
Prentice Hall)
CONN A R 1985 Nonlinear programming. exact penalty functions and projection techniques for non-
smooth functions Boggs, Byrd and Schnabel pp 3-25
COONEN J T 1984 Contributions to a proposed standard for binary floating-point arithmetic PhD
Dissertation University of California, Berkeley
CRAIG R J and EVANS J W c. 1980A comparison of Nelder-Mead type simplex search procedures Technical
Report No 146 (Lexington, KY: Dept of Statistics, Univ. of Kentucky)
CRAIG R J, EVANS J W and ALLEN D M 1980 The simplex-search in non-linear estimation Technical Report
No 155 (Lexington, KY: Dept of Statistics. Univ. of Kentucky)
CURRY H B 1944 The method of steepest descent for non-linear minimization problems Q. Appl. Math. 2
258-61
DAHLQUIST G and BJÖRAK A 1974 Numerical Methods (translated by N Anderson) (Englewood Cliffs. NJ:
Prentice-Hall)
DANTZIG G B 1979 Comments on Khachian’s algorithm for linear programming Technical Report No
SOL 79-22 (Standford, CA: Systems Optimization Laboratory, Stanford Univ.)
DAVIDON W C 1959 Variable metric method for minimization Physics and Mathematics, AEC Research
and Development Report No ANL-5990 (Lemont, IL: Argonne National Laboratory)
---1976 New least-square algorithms J. Optim. Theory Applic. 18 187-97
---1977 Fast least squares algorithms Am. J. Phys. 45 260-2
DEMBO R S, EISENSTAT S C and STEIHAUG T 1982 Inexact Newton methods SIAM J. Numer. Anal. 19
400-8
DEMBO R S and STEIHAUG T 1983 Truncated-Newton algorithms for large-scale unconstrained optimiza-
tion Math. Prog. 26 190-212
DENNIS J E Jr, GAY D M and WELSCH R E 1981 An adaptive nonlinear least-squares algorithm ACM
Trans. Math. Softw. 7 348-68
DENNIS J E Jr and SCHNABEL R 1983 Numerical Methods far Unconstrained Optimization and Nonlinear
Equations (Englewood Cliffs, NJ: Prentice-Hall)
DIXON L C W 1972 Nonlinear Optimisation (London: The English Universities Press)
DIXON L C W and SZEGÖ G P (eds) 1975 Toward Global Optimization (Amsterdam/Oxford: North-
Holland and New York: American Elsevier)
---(eds) 1978 Toward Global Optimization 2 (Amsterdam/Oxford: North-Holland and New York:
American Elsevier)
DONALDSON J R and SCHNABEL R B 1987 Computational experience with confidence regions and
confidence intervals for nonlinear least squares Technometrics 29 67-82
DONGARRA and GROSSE 1987 Distribution of software by electronic mail Commun. ACM 30 403-7
DRAPER N R and SMITH H 1981 Applied Regression Analysis 2nd edn (New York/Toronto: Wiley)
EASON E D and FENTON R G 1972 Testing and evaluation of numerical methods for design
optimization Report No lJTME-TP7204 (Toronto, Ont.: Dept of Mechanical Engineering, Univ. of
Toronto)
---1973 A comparison of numerical optimization methods for engineering design Trans. ASME J. Eng.
Ind. paper 73-DET-17, pp l-5