Introduction to Numerical Continuation Methods

Table of Pseudo Codes; Preface to the Classics Edition; Foreword; 1. Introduction; 2. The Basic Principles of Continuation Methods; 3. Newton's Method as Corrector; 4. Solving the Linear Systems; 5. Convergence of Euler-Newton-Like Methods; 6. Steplength Adaptations for the Predictor; 7. Predictor-Corrector Methods Using Updating; 8. Detection of Bifurcation Points Along a Curve; 9. Calculating Special Points of the Solution Curve; 10. Large Scale Problems; 11. Numerically Implementable Existence Proofs; 12. PL Continuation Methods; 13. PL Homotopy Algorithms; 14. General PL Algorithms on PL Manifolds; 15. Approximating Implicitly De¯ned Manifolds; 16. Update Methods and their Numerical Stability; Appendix 1. A Simple PC Continuation Method; Appendix 2. A PL Homotopy Method; Appendix 3. A Simple Euler Newton Update Method; Appendix 4. A Continuation Algorithm for Handling Bifurcation; Appendix 5. A PL Surface Generator; Appendix 6. SCOUT | Simplicial Continuation Utilities; Bibliography; Index and Notation.