Nash - Compact Numerical Methods for Computers (523163), страница 56
Текст из файла (страница 56)
Math. 8 217-34; also in Linear Algebra, Handbook for Automatic Computationvol 2, eds J H Wilkinson and C Reinsch (Berlin: Springer) contribution l/7 (1971)BOX G E P 1957 Evolutionary operation: a method for increasing industrial productivity Appl. Stat. 681-101BOX M J 1965 A new method of constrained optimization and a comparison with other methods Comput.J.
8 42-52BOX M J, DAVIES D and SWANN W H 1971 Techniques d’optimisation non lintéaire, Monographie No 5 (Paris:Entreprise Moderne D’ Edition) Original English edition (London: Oliver and Boyd)BRADBURY W W and FLETCHER R 1966 New iterative methods for solution of the eigenproblem Numer.Math. 9 259-67BREMMERMANN H 1970 A method of unconstrained global optimization Math. Biosci. 9 1-15BRENT R P 1973 Algorithms for Minimization Without Derivatives (Englewood Cliffs, NJ: Prentice-Hall)BROWN K M and GEARHART W B 1971 Deflation techniques for the calculation of further solutions ofnonlinear systems Numer. Math.
16 334-42BROYDEN C G 1970a The convergence of a class of double-rank minimization algorithms, pt 1 J. Inst.Maths Applies 6 76-90---1970b The convergence of a class of double-rank minimization algorithms, pt 2 J. Inst. Maths Applies6 222-31---1972 Quasi-Newton methods Numerical methods for Unconstrained Optimization ed. W Murray(London: Academic) pp 87-106263264Compact numerical methods for computersBUNCH J R and NEILSEN C P 1978 Updating the singular value decomposition Numerische Mathematik 31111-28BUNCH 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-85CACEI M S and CACHERIS W P 1984 Fitting curves to data (the Simplex algorithm is the answer) Byte 9340-62CAUCHY A 1848 Méthode générale pour la resolution des systémes d’équations simultanées C.
R. Acad.Sci., Paris 27 536-8CHAMBERS 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-13CHARTRES B A 1962 Adaptation of the Jacobi methods for a computer with magnetic tape backing storeComput. J. 5 51-60CODY 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 nonsmooth functions Boggs, Byrd and Schnabel pp 3-25C OONEN J T 1984 Contributions to a proposed standard for binary floating-point arithmetic PhDDissertation University of California, BerkeleyCRAIG R J and EVANS J W c. 1980A comparison of Nelder-Mead type simplex search procedures TechnicalReport 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 ReportNo 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. 2258-61DAHLQUIST 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 NoSOL 79-22 (Standford, CA: Systems Optimization Laboratory, Stanford Univ.)DAVIDON W C 1959 Variable metric method for minimization Physics and Mathematics, AEC Researchand 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-2DEMBO R S, EISENSTAT S C and STEIHAUG T 1982 Inexact Newton methods SIAM J. Numer. Anal. 19400-8DEMBO R S and STEIHAUG T 1983 Truncated-Newton algorithms for large-scale unconstrained optimization Math. Prog. 26 190-212DENNIS J E Jr, GAY D M and WELSCH R E 1981 An adaptive nonlinear least-squares algorithm ACMTrans.
Math. Softw. 7 348-68DENNIS J E Jr and SCHNABEL R 1983 Numerical Methods far Unconstrained Optimization and NonlinearEquations (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: NorthHolland 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 andconfidence intervals for nonlinear least squares Technometrics 29 67-82DONGARRA and GROSSE 1987 Distribution of software by electronic mail Commun.
ACM 30 403-7DRAPER N R and SMITH H 1981 Applied Regression Analysis 2nd edn (New York/Toronto: Wiley)EASON E D and F ENTON R G 1972 Testing and evaluation of numerical methods for designoptimization Report No lJTME-TP7204 (Toronto, Ont.: Dept of Mechanical Engineering, Univ. ofToronto)---1973 A comparison of numerical optimization methods for engineering design Trans. ASME J. Eng.Ind. paper 73-DET-17, pp l-5Bibliography265EVANS 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 searchprocedure 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 unconstrainedminimization technique for nonlinear programming Mgmt Sci. 10 601-17---1966 Extensions of SUMT for nonlinear programming: equality constraints and extrapolation MgmtSci. 12 816-28FINKBEINER 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 itsApplications, 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 Establishment)---1972 A FORTRAN subroutine for minimization by the method of conjugate gradients Report NoAERE-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. 6163-8FLETCHER R and REEVES C M 1964 Function minimization by conjugate gradients Comput.
J. 7 149-54FORD B and HALL G 1974 The generalized eigenvalue problem in quantum chemistry Comput. Phys.Commun. 8 337-48FORSYTHE G E and HENRICI P 1960 The cyclic Jacobi method for computing the principal values of acomplex matrix Trans. Am. Math. Soc. 94 l-23FORSYTHE 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. 20333-42FRÖBERG C 1965 Introduction to Numerical Analysis (Reading, Mass: Addison-Wesley) 2nd edn, 1969GALLANT A R 1975 Nonlinear regression Am. Stat.
29 74-81GASS S I 1964 Linear Programming 2nd edn (New York/Toronto: McGraw-Hill)GAUSS K F 1809 Theoria Motus Corporum Coelestiam Werke Bd. 7 240-54GAY D M 1983 Remark on algorithm 573 (NL2SOL: an adaptive nonlinear least squares algorithm) ACMTrans. Math. Softw. 9 139GENTLEMAN W M 1973 Least squares computations by Givens’ transformations without square roots J.Inst. Maths Applies 12 329-36GENTLEMAN W M and MAROVICH S B 1974 More on algorithms that reveal properties of floating pointarithmetic units Commun. ACM 17 276-7GERADIN M 1971 The computational efficiency of a new minimization algorithm for eigenvalue analysis J.Sound Vib. 19 319-31GILL 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. 15977-92G ILL P E, M URRAY W and W RIGHT M H 1981 Practical Optimization (London: Academic)GOLUB G H and PEREYRA V 1973 The differentiation of pseudo-inverses and nonlinear least squaresproblems whose variables separate SIAM J. Numer. Anal. 10 413-32GOLUB G H and STYAN G P H 1973 Numerical computations for univariate linear models J. Stat. Comput.Simul. 2 253-74GOLUB G H and VAN LOAN C F 1983 Matrix Computations (Baltimore, MD: Johns Hopkins UniversityPress)GREGORY R T and KARNEY D L 1969 Matrices for Testing Computational Algorithms (New York: WileyInterscience)266Compact numerical methods for computersHADLEY G 1962 Linear Programming (Reading, MA: Addison-Wesley)HAMMARLING S 1974 A note on modifications to the Givens’ plane rotation J.
Inst. Maths Applics 13215-18HARTLEY H O 1948 The estimation of nonlinear parameters by ‘internal least squares’ Biometrika 35 32-45----1961 The modified Gauss-Newton method for the fitting of non-linear regression functions by leastsquares Technometrics 3 269-80HARTLEY H O and BOOKER A 1965 Nonlinear least squares estimation Ann. Math. Stat.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
