Numerical Methods for Ordinary Differential EquationsJohn Wiley & Sons, 20 de ago. de 2004 - 440 páginas This new book updates the exceptionally popular Numerical Analysis of Ordinary Differential Equations. "This book is...an indispensible reference for any researcher."-American Mathematical Society on the First Edition. Features: * New exercises included in each chapter. * Author is widely regarded as the world expert on Runge-Kutta methods * Didactic aspects of the book have been enhanced by interspersing the text with exercises. * Updated Bibliography. |
Conteúdo
2 Numerical Differential Equation Methods | 45 |
3 RungeKutta Methods | 123 |
4 Linear Multistep Methods | 301 |
5 General Linear Methods | 357 |
References | 415 |
| 421 | |
Outras edições - Ver todos
Termos e frases comuns
A-stable Adams—Bashforth algebraic Algorithm arrows assume behaviour bounded Butcher calculation coefficient coefficients coeflicients components computed solution consider convergence corresponding defined Definition denote difference equation eigenvalues elementary weight equal equivalent error constant error estimate Euler method evaluated exact solution example exists exp(z explicit factor Figure final find first follows fourth order Hence implicit methods implicit Runge—Kutta methods initial value problem input integration iteration Lemma linear method linear multistep method Lipschitz condition Lobatto matrix method given method of order modified order conditions order method order star output Padé approximation Padé table possible preconsistency Proof quadrature formula quantities Radau result computed rooted trees Runge—Kutta method satisfies sequence significant simplifies solve specific stability function stability matrix stability region stage derivatives stage order stage values starting method step number stepsize h stiff problems Table tableau Taylor expansion Taylor series Theorem transformation truncation error vector write zero