Numerical Methods for Unconstrained Optimization and Nonlinear Equations: Classics in Applied Mathematics, cartea 16
Autor J. E. Dennis, Robert B. Schnabelen Limba Engleză Paperback – 31 dec 1986
Din seria Classics in Applied Mathematics
- 70% Preț: 36.12 lei
- 9% Preț: 615.39 lei
- Preț: 119.96 lei
- 13% Preț: 485.25 lei
- 15% Preț: 520.13 lei
- 18% Preț: 629.75 lei
- 12% Preț: 437.56 lei
- 21% Preț: 341.19 lei
- 11% Preț: 432.24 lei
- Preț: 362.64 lei
- 12% Preț: 384.99 lei
- 12% Preț: 394.57 lei
- 15% Preț: 359.04 lei
- 12% Preț: 339.85 lei
- 45% Preț: 452.47 lei
Preț: 336.08 lei
Preț vechi: 380.44 lei
-12% Nou
Puncte Express: 504
Preț estimativ în valută:
64.31€ • 67.45$ • 53.63£
64.31€ • 67.45$ • 53.63£
Carte indisponibilă temporar
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780898713640
ISBN-10: 0898713641
Pagini: 394
Ilustrații: references, indices
Dimensiuni: 150 x 233 x 23 mm
Greutate: 0.57 kg
Editura: Society for Industrial and Applied Mathematics
Colecția Society for Industrial and Applied Mathematics
Seria Classics in Applied Mathematics
Locul publicării:Philadelphia, United States
ISBN-10: 0898713641
Pagini: 394
Ilustrații: references, indices
Dimensiuni: 150 x 233 x 23 mm
Greutate: 0.57 kg
Editura: Society for Industrial and Applied Mathematics
Colecția Society for Industrial and Applied Mathematics
Seria Classics in Applied Mathematics
Locul publicării:Philadelphia, United States
Cuprins
Preface; 1. Introduction. Problems to be considered; Characteristics of 'real-world' problems; Finite-precision arithmetic and measurement of error; Exercises; 2. Nonlinear Problems in One Variable. What is not possible; Newton's method for solving one equation in one unknown; Convergence of sequences of real numbers; Convergence of Newton's method; Globally convergent methods for solving one equation in one uknown; Methods when derivatives are unavailable; Minimization of a function of one variable; Exercises; 3. Numerical Linear Algebra Background. Vector and matrix norms and orthogonality; Solving systems of linear equations—matrix factorizations; Errors in solving linear systems; Updating matrix factorizations; Eigenvalues and positive definiteness; Linear least squares; Exercises; 4. Multivariable Calculus Background; Derivatives and multivariable models; Multivariable finite-difference derivatives; Necessary and sufficient conditions for unconstrained minimization; Exercises; 5. Newton's Method for Nonlinear Equations and Unconstrained Minimization. Newton's method for systems of nonlinear equations; Local convergence of Newton's method; The Kantorovich and contractive mapping theorems; Finite-difference derivative methods for systems of nonlinear equations; Newton's method for unconstrained minimization; Finite difference derivative methods for unconstrained minimization; Exercises; 6. Globally Convergent Modifications of Newton's Method. The quasi-Newton framework; Descent directions; Line searches; The model-trust region approach; Global methods for systems of nonlinear equations; Exercises; 7. Stopping, Scaling, and Testing. Scaling; Stopping criteria; Testing; Exercises; 8. Secant Methods for Systems of Nonlinear Equations. Broyden's method; Local convergence analysis of Broyden's method; Implementation of quasi-Newton algorithms using Broyden's update; Other secant updates for nonlinear equations; Exercises; 9. Secant Methods for Unconstrained Minimization. The symmetric secant update of Powell; Symmetric positive definite secant updates; Local convergence of positive definite secant methods; Implementation of quasi-Newton algorithms using the positive definite secant update; Another convergence result for the positive definite secant method; Other secant updates for unconstrained minimization; Exercises; 10. Nonlinear Least Squares. The nonlinear least-squares problem; Gauss-Newton-type methods; Full Newton-type methods; Other considerations in solving nonlinear least-squares problems; Exercises; 11. Methods for Problems with Special Structure. The sparse finite-difference Newton method; Sparse secant methods; Deriving least-change secant updates; Analyzing least-change secant methods; Exercises; Appendix A. A Modular System of Algorithms for Unconstrained Minimization and Nonlinear Equations (by Robert Schnabel); Appendix B. Test Problems (by Robert Schnabel); References; Author Index; Subject Index.
Descriere
A complete, state-of-the-art description of the methods for unconstrained optimization and systems of nonlinear equations.