in black and white
Main menu
Share a book About us Home
Biology Business Chemistry Computers Culture Economics Fiction Games Guide History Management Mathematical Medicine Mental Fitnes Physics Psychology Scince Sport Technics

Elementary Differential Equations and Boundary Value Problems - Boyce W.E.

Boyce W.E. Elementary Differential Equations and Boundary Value Problems - John Wiley & Sons, 2001. - 1310 p.
Download (direct link): elementarydifferentialequations2001.pdf
Previous << 1 .. 223 224 225 226 227 228 < 229 > 230 231 232 233 234 235 .. 609 >> Next

0.5 10.996956 9.7050002 9.0801473 8.7472667 8.7120041
1.0 103.06171 80.402761 70.452395 65.419964 64.897803
1.5 959.44236 661.00731 542.12432 485.05825 479.25919
2.0 8934.0696 5435.7294 4172.7228 3597.4478 3540.2001
Errors in Numerical Approximations. The use of a numerical procedure, such as the Euler formula, to solve an initial value problem raises a number of questions that must be answered before the approximate numerical solution can be accepted as satisfactory. One of these is the question of convergence. That is, as the step size h tends to zero, do the values of the numerical solution yx, y2,, yn,... approach the corresponding values of the actual solution? If we assume that the answer is affirmative, there remains the important practical question of how rapidly the numerical approximation converges to the solution. In other words, how small a step size is needed in order to guarantee a given level of accuracy? We want to use a step size that is small enough to assure the required accuracy, but not too small. An unnecessarily small step size slows down the calculations, makes them more expensive, and in some cases may even cause a loss of accuracy.
There are two fundamental sources of error in solving an initial value problem numerically. Let us first assume that our computer is such that we can carry out all computations with complete accuracy; that is, we can retain an infinite number of decimal places. The difference En between the solution y = () of the initial value problem (1), (2) and its numerical approximation is given by
En = (1) , (14)
and is known as the global truncation error. It arises from two causes: First, at each
step we use an approximate formula to determine +1; second, the input data at each
step are only approximately correct since in general () is not equal to . If we assume that = (), then the only error in going one step is due to the use of an approximate formula. This error is known as the local truncation error en.
The second fundamental source of error is that we carry out the computations in arithmetic with only a finite number of digits. This leads to a round-off error Rn defined by
Rn = Yn, (15)
where Yn is the value actualfy computed from the given numerical method.
The absolute value of the total error in computing () is given by
() Yn1 = \(() + Yn|.
8.1 The Euler or Tangent Line Method
Making use of the triangle inequality, \a + b\<\a\ + \b\, we obtain from Eq. (16)
\(^) Yn \ < \() \ + \ Yn \
<\En \ + \Rn\. (17)
Thus the total error is bounded by the sum of the absolute values of the truncation and round-off errors. For the numerical procedures discussed in this book it is possible to obtain useful estimates of the truncation error. However, we limit our discussion primarily to the local truncation error, which is somewhat simpler. The round-off error is clearly more random in nature. It depends on the type of computer used, the sequence in which the computations are carried out, the method of rounding off, and so forth. While an analysis of round-off error is beyond the scope of this book, it is possible to say more about it than one might at first expect (see, for example, Henrici). Some of the dangers from round-off error are discussed in Problems 25 through 27 and in Section 8.5.
Local Truncation Error for the Euler Method. Let us assume that the solution y =
() of the initial value problem (1), (2) has a continuous second derivative in the
interval of interest. To assure this, we can assume that f, ft, and f' are continuous. Observe that if f has these properties and if is a solution of the initial value problem (1), (2), then
'(0 = f[t ,(0],
and by the chain rule
"(t) = ft [t ,(t)] + fy [t ,(0]'(0
= ft [t ,(t)] + fy [t ,({)] f[t , (18)
Since the right side of this equation is continuous, " is also continuous.
Then, making use of a Taylor polynomial with a remainder to expand about tn, we obtain
( + h) = () + '( )h + 2 " (in )h2, (19)
where ~tn is some point in the interval tn < \ < tn + h. Subtracting Eq. (4) from Eq. (19), and noting that ( + h) = (tn+l) and '() = f [tn, ()], we find that
(+!) n+1 = [() ] + h{ f [tn, ()] f(tn, yn)} + 2"( In)h2. (20)
To compute the local truncation error we apply Eq. (20) to the true solution (), that is, we take yn to be (). Then we immediately see from Eq. (20) that the local truncation error en+ x is
Previous << 1 .. 223 224 225 226 227 228 < 229 > 230 231 232 233 234 235 .. 609 >> Next