Computer Methods for Ordinary Differential Equations and by Uri M. Ascher, Linda R. Petzold

By Uri M. Ascher, Linda R. Petzold

This ebook is superb. The thoughts approximately stiff, preliminary price difficulties, boundary price difficulties and differential-Algebraic equations (DAE) is taken care of with relative deep.

The numerical tools for lots of circumstances is covered.

The undesirable is that do not exhibit the code. The code is in an online (NETLIB) and is writed in Fortran Language.

Is very pricey!

Show description

Read or Download Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations PDF

Similar differential equations books

The Asymptotic Solution of Linear Differential Systems: Applications of the Levinson Theorem

The fashionable concept of linear differential platforms dates from the Levinson Theorem of 1948. it is just in additional fresh years, despite the fact that, following the paintings of Harris and Lutz in 1974-7, that the importance and diversity of functions of the concept became liked. This publication supplies the 1st coherent account of the broad advancements of the final 15 years.

Additional info for Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations

Example text

See also [77, 47, 8, 55, 4]. For Hamiltonian systems, see [82, 93, 50]. 1. For each of the following constant-coefficient systems y' = Ay, determine if the system is stable, asymptotically stable, or unstable. 2. (a) Compute the eigenvalues of the matrix (b) Determine whether the variable coefficient system y' = A(t)y is stable, asymptotically stable, or unstable. 3. The Lyapunov function is an important tool for analyzing stability of nonlinear problems. The scalar, C1-function V(y) is a Lyapunov function at if for all y in a neighborhood of .

To estimate the Lipschitz constant L, note that near the exact solution, Similarly, use the exact solution to estimate M = 2 > 2/t3. 11) yields the bound so not a very useful bound at all. We will be looking in later chapters into the question of realistic error estimation. We close this section by mentioning another, important measure of the error made at each step, the local error. It is defined as the amount by which the numerical solution yn at each step differs from the solution to the IVP Thus the local error is given by Under normal circumstances, it can be shown that the numerical solution exists and Moreover, it is easy to show, for all of the numerical ODE methods considered in this book, that5 The two local error indicators, hndn and ln, are thus often closely related.

For a general matrix, however, an orthogonal similarity transformation can only bring A to a matrix B in upper triangular form (which, however, still features the eigenvalues on the main diagonal of B}. For a general A there is always a similarity transformation into a Jordan canonical form, Chapter 2: On Problem Stability 25 We may consider y(t) as the "exact" solution sought, and (t) as the solution where the initial data has been perturbed. Clearly, then, if 7Re( ) 0 this perturbation difference remains bounded at all later times, if Re( ) < 0 it decays in time, and if Re( ) > 0 the difference between the two solutions grows unboundedly with t.

Download PDF sample

Rated 4.32 of 5 – based on 43 votes