Analysis of Discretization Methods for Ordinary Differential by Hans J. Stetter

Analysis of Discretization Methods for Ordinary Differential by Hans J. Stetter

By Hans J. Stetter

Due to the elemental function of differential equations in technological know-how and engineering it has lengthy been a simple job of numerical analysts to generate numerical values of suggestions to differential equations. approximately all techniques to this job contain a "finitization" of the unique differential equation challenge, often by means of a projection right into a finite-dimensional house. via a long way the most well-liked of those finitization procedures includes a discount to a distinction equation challenge for services which take values purely on a grid of argument issues. even if a few of these finite­ distinction equipment were recognized for a very long time, their huge applica­ bility and nice potency got here to gentle in basic terms with the unfold of digital desktops. This in tum strongly encouraged study at the homes and useful use of finite-difference equipment. whereas the speculation or partial differential equations and their discrete analogues is a truly difficult topic, and growth is for this reason sluggish, the preliminary worth challenge for a method of first order traditional differential equations lends itself so clearly to discretization that thousands of numerical analysts have felt encouraged to invent an ever-increasing variety of finite-difference tools for its resolution. for approximately 15 years, there has hardly ever been a topic of a numerical magazine with out new result of this type; yet truly the majority of those tools have simply been diversifications of some easy topics. during this state of affairs, the classical textual content­ e-book via P.

Show description

Read Online or Download Analysis of Discretization Methods for Ordinary Differential Equations PDF

Similar differential equations books

Boundary Value Problems: And Partial Differential Equations

Boundary worth difficulties is the major textual content on boundary price difficulties and Fourier sequence for execs and scholars in engineering, technology, and arithmetic who paintings with partial differential equations. during this up-to-date variation, writer David Powers offers an intensive review of fixing boundary price difficulties related to partial differential equations via the equipment of separation of variables.

Invertible Point Transformations and Nonlinear Differential Equations

The invertible aspect transformation is a robust software within the examine of nonlinear differential and distinction questions. This e-book offers a accomplished advent to this system. usual and partial differential equations are studied with this procedure. The ebook additionally covers nonlinear distinction equations.

Dynamical systems and numerical analysis

This booklet unites the research of dynamical structures and numerical answer of differential equations. the 1st 3 chapters comprise the weather of the idea of dynamical structures and the numerical resolution of initial-value difficulties. within the closing chapters, numerical tools are formulted as dynamical platforms and the convergence and balance homes of the tools are tested.

Additional resources for Analysis of Discretization Methods for Ordinary Differential Equations

Example text

1~} strongly influences the form of the local error mapping and of a possible asymptotic expansion. E. 1 by v=o, v=1(1)n, we obtain ( 1) -yl(t)+f(y(t))-f(y(t-~)) y(t)-y t - 1/n n for the second component of the An and the asymptotic expansion becomes more complicated. 1~. Example. The "implicit trapezoidal method" for y' = I(Y) is given by 11=0, v=1(1)n. y by we have a local error mapping. y. If we had defined the ~ differently, e. g. 2 Thus, the important structural property ofthe discretization method of being even in n would have remained disguised.

5 is only symbolic, since the (n p are elements of different spaces. For a formal treatment we have to "reduce" the (n to a common space E;,; in practical applications this means that we h~ve to consider their values on the points of a reduced grid G;;, which is contained in each of the grids G;n p . The interpolation then takes place in E;, (i. , for the values of the (n p on G;;,) and produces an approximation to A;,z. The technique is named after L. C. Richardson ([1], [2]) who seems to have been the first to use it as a tool for improving the results gained from discretization methods.

E. ~ ej=O, j odd. Proof. 1. 0 Remark. It is not in general sufficient to have AjZ = 0, j odd, since this need not imply the vanishing of the A(m)(Z) for oddj. Example. 1, with p=2, may be shown similarly as for the Euler method. =d. L (1In2J)e 2J satisfy j= 1 with b2 etc. 1. 10) for j=p(1)J cannot depend on the L\~. 10) must automatically reduce any unnatural complications which have been introduced through an improper choice of the L\~. j,j odd, themselves do not vanish due to an ill-advised choice of the L\~.

Download PDF sample

Rated 4.10 of 5 – based on 25 votes
Comments are closed.