Introduction to Numerical Continuation Methods
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. The book 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. Audience: this book continues to be useful for researchers and graduate students in mathematics, sciences, engineering, economics, and business. A background in elementary analysis and linear algebra are adequate prerequisites for reading this book; some knowledge from a first course in numerical analysis may also be helpful.
Autres éditions - Tout afficher
1ambda adaptation algorithm applied approximation assume assumptions begin bifurcation point boundary bounded calculate chapter command completely labeled computational condition consider contains continuation methods convergence corresponding curve deﬁned deﬁnition denote described determinant differential dimension discussion equation error estimate example exists face facet fact factorization ﬁrst ﬁxed point formula function Georg given global Hence holds homotopy implementation implies initial input integer iteration Jacobian lemma linear manifold Math matrix maximal method Newton nonlinear numerical obtain orientation output parameter path performed period perturbation pivoting polynomial possible predictor problem proof regular value repeat respect result RN+1 simple simplex smooth solution solving standard starting step steplength stopped tangent tangent vector theorem Todd tracing transverse traversing triangulation update variable vector vertex write yields York zero point