Muutke küpsiste eelistusi

Introduction to Numerical Continuation Methods illustrated edition [Pehme köide]

  • Formaat: Paperback, 413 pages, kõrgus x laius x paksus: 229x152x19 mm, kaal: 726 g, bibliography
  • Sari: Classics in Applied Mathematics No. 45
  • Ilmumisaeg: 01-Jan-1987
  • Kirjastus: Society for Industrial & Applied Mathematics,U.S.
  • ISBN-10: 089871544X
  • ISBN-13: 9780898715446
Teised raamatud teemal:
  • Formaat: Paperback, 413 pages, kõrgus x laius x paksus: 229x152x19 mm, kaal: 726 g, bibliography
  • Sari: Classics in Applied Mathematics No. 45
  • Ilmumisaeg: 01-Jan-1987
  • Kirjastus: Society for Industrial & Applied Mathematics,U.S.
  • ISBN-10: 089871544X
  • ISBN-13: 9780898715446
Teised raamatud teemal:
Numerical continuation methods have provided important contributions toward the numerical solution of nonlinear systems of equations for many years. The methods may be used not only to compute solutions, which might otherwise be hard to obtain, but also to gain insight into qualitative properties of the solutions. Introduction to Numerical Continuation Methods, originally published in 1979, was the first book to provide easy access to the numerical aspects of predictor corrector continuation and piecewise linear continuation methods. Not only do these seemingly distinct methods share many common features and general principles, they can be numerically implemented in similar ways. Introduction to Numerical Continuation Methods also features the piecewise linear approximation of implicitly defined surfaces, the algorithms of which are frequently used in computer graphics, mesh generation, and the evaluation of surface integrals. To help potential users of numerical continuation methods create programs adapted to their particular needs, this book presents pseudo-codes and Fortran codes as illustrations. Since it first appeared, many specialized packages for treating such varied problems as bifurcation, polynomial systems, eigenvalues, economic equilibria, optimization, and the approximation of manifolds have been written. The original extensive bibliography has been updated in the SIAM Classics edition to include more recent references and several URLs so users can look for codes to suit their needs or write their own based on the models included in the book.
Table of Pseudo Codes xiii
Preface to the Classics Edition xv
Foreword xxiii
1 Introduction 1(6)
2 The Basic Principles of Continuation Methods 7(10)
2.1 Implicitly Defined Curves
7(6)
2.2 The Basic Concepts of PC Methods
13(2)
2.3 The Basic Concepts of PL Methods
15(2)
3 Newton's Method as Corrector 17(11)
3.1 Motivation
17(1)
3.2 The Moore-Penrose Inverse in a Special Case
18(2)
3.3 A Newton's Step For Underdetermined Nonlinear Systems
20(2)
3.4 Convergence Properties of Newton's Method
22(6)
4 Solving the Linear Systems 28(9)
4.1 Using a QR Decomposition
29(1)
4.2 Givens Rotations for Obtaining a QR Decomposition
30(1)
4.3 Error Analysis
31(3)
4.4 Scaling of the Dependent Variables
34(1)
4.5 Using LU Decompositions
35(2)
5 Convergence of Euler-Newton-Like Methods 37(7)
5.1 An Approximate Euler-Newton Method
37(1)
5.2 A Convergence Theorem for PC Methods
38(6)
6 Steplength Adaptations for the Predictor 44(17)
6.1 Steplength Adaptation by Asymptotic Expansion
45(5)
6.2 The Steplength Adaptation of Den Heijer & Rheinboldt
50(5)
6.3 Steplength Strategies Involving Variable Order Predictors
55(6)
7 Predictor-Corrector Methods Using Updating 61(14)
7.1 Broyden's "Good " Update Formula
61(7)
7.2 Broyden Updates Along a Curve
68(7)
8 Detection of Bifurcation Points Along a Curve 75(16)
8.1 Simple Bifurcation Points
75(9)
8.2 Switching Branches Via Perturbation
84(3)
8.3 Branching Off Via the Bifurcation Equation
87(4)
9 Calculating Special Points of the Solution Curve 91(5)
9.1 Introduction
91(1)
9.2 Calculating Zero Points f(c(s))=0
92(2)
9.3 Calculating Extremal Points mins f((c(s))
94(2)
10 Large Scale Problems 96(16)
10.1 Introduction
96(1)
10.2 General Large Scale Solvers
97(4)
10.3 Nonlinear Conjugate Gradient Methods as Correctors
101(11)
11 Numerically Implementable Existence Proofs 112(39)
11.1 Preliminary Remarks
112(2)
11.2 An Example of an Implementable Existence Theorem
114(4)
11.3 Several Implementations for Obtaining Brouwer Fixed Points
118(5)
11.4 Global Newton and Global Homotopy Methods
123(5)
11.5 Multiple Solutions
128(4)
11.6 Polynomial Systems
132(9)
11.7 Nonlinear Complementarity
141(4)
11.8 Critical Points and Continuation Methods
145(6)
12 PL Continuation Methods 151(22)
12.1 Introduction
151(5)
12.2 PL Approximations
156(3)
12.3 A PL Algorithm for Tracing H(u)=0
159(4)
12.4 Numerical Implementation of a PL Continuation Algorithm
163(5)
12.5 Integer Labeling
168(3)
12.6 Truncation Errors
171(2)
13 PL Homotopy Algorithms 173(30)
13.1 Set-Valued Maps
173(8)
13.2 Merrill's Restart Algorithm
181(5)
13.3 Some Triangulations and their Implementations
186(8)
13.4 The Homotopy Algorithm of Eaves & Saigal
194(2)
13.5 Mixing PL and Newton Steps
196(5)
13.6 Automatic Pivots for the Eaves-Saigal Algorithm
201(2)
14 General PL Algorithms on PL Manifolds 203(30)
14.1 PL Manifolds
203(8)
14.2 Orientation and Index
211(3)
14.3 Lemke's Algorithm for the Linear Complementarity Problem
214(4)
14.4 Variable Dimension Algorithms
218(11)
14.5 Exploiting Special Structure
229(4)
15 Approximating Implicitly Defined Manifolds 233(19)
15.1 Introduction
233(2)
15.2 Newton's Method and Orthogonal Decompositions Revisited
235(1)
15.3 The Moving Frame Algorithm
236(2)
15.4 Approximating Manifolds by PL Methods
238(7)
15.5 Approximation Estimates
245(7)
16 Update Methods and their Numerical Stability 252(14)
16.1 Introduction
252(1)
16.2 Updates Using the Sherman-Morrison Formula
253(3)
16.3 QR Factorization
256(6)
16.4 LU Factorization
262(4)
P1 A Simple PC Continuation Method 266(7)
P2 A PL Homotopy Method 273(15)
P3 A Simple Euler-Newton Update Method 288(8)
P4 A Continuation Algorithm for Handling Bifurcation 296(16)
P5 A PL Surface Generator 312(14)
P6 SCOUT-Simplicial Continuation Utilities 326(20)
P6.1 Introduction
326(2)
P6.2 Computational Algorithms
328(5)
P6.3 Interactive Techniques
333(2)
P6.4 Commands
335(2)
P6.5 Example: Periodic Solutions to a Differential Delay Equation
337(9)
Bibliography 346(37)
Index and Notation 383