Introduction to Numerical Continuation MethodsSIAM, 1 janv. 2003 - 413 pages 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. |
Table des matières
CL45_ch1 | 1 |
CL45_ch2 | 7 |
CL45_ch3 | 17 |
CL45_ch4 | 28 |
CL45_ch5 | 37 |
CL45_ch6 | 44 |
CL45_ch7 | 61 |
CL45_ch8 | 75 |
CL45_ch13 | 173 |
CL45_ch14 | 203 |
CL45_ch15 | 233 |
CL45_ch16 | 252 |
CL45_appendixa | 266 |
CL45_appendixb | 273 |
CL45_appendixc | 288 |
CL45_appendixd | 296 |
CL45_ch9 | 91 |
CL45_ch10 | 96 |
CL45_ch11 | 112 |
CL45_ch12 | 151 |
CL45_appendixe | 312 |
CL45_appendixf | 326 |
CL45_backmatter | 346 |
Autres éditions - Tout afficher
Introduction to Numerical Continuation Methods Eugene L. Allgower,Kurt Georg Aucun aperçu disponible - 2003 |
Expressions et termes fréquents
Allgower Anal Appl arclength asymptotic barycenter bifurcation problems boundary calculate clface complementarity problem completely labeled N-face Comput conjugate gradient method continuation methods convergence corrector step decomposition defined denote differential dimension discussion Eaves editors eigenvalue endif error estimate facet finite fixed point function global goto Hence homotopy method implementation input integer iteration Jacobian Laan lambda lemma linear complementarity problem linear programming Math matrix maximal meshsize Newton steps Newton's method nonlinear complementarity problem nonlinear equations nplusk obtain optimization output parameter Peitgen period perturbation pivoting PL algorithm PL approximation PL manifold predictor step predictor-corrector Programming proof QR decomposition regular value Rheinboldt RN+¹ Saigal Sard's theorem SIAM simple bifurcation point simplices smooth map solution curve solution of nonlinear solving Springer Verlag steplength adaptation subroutine Talman tangent theorem Todd transverse triangulation update value problems variable vector vertex write(1 York zero point