[PDF] Solving Boundary Value Problems for Ordinary Differential





Previous PDF Next PDF



Numerical Methods: Problems and Solutions

Numerical Methods : Problems and Solutions. (b) This system can also be solved by the relaxation method. Determine w opt and write down the iteration formula ...



Untitled

(2000). 231. A. I. Prilepko et al. Methods for Solving Inverse Problems in Mathematical Physics. (2000). 232. F. Van Oystaeyen



NUMERICAL SOLUTION OF PARTIAL DIFFERENTIAL EQUATIONS

3 апр. 2020 г. Solve the boundary value problem ut = uxx under the conditions u(0 t)= u(1



Numerical Analysis Second Edition

23 сент. 2016 г. ... solved by the backsubstitution algorithm which we write in equational ... PROBLEMS. Exercise 14.21 Suppose that λ ∈ Cij



an introduction - finite element method

2000 Solved Problems in Mechanical Engineering Thermodynamics. 2000 Solved Problems in Numerical Analysis. 700 Solved Problems in Vector Mechanics for 



Numerical Analysis 9th ed.

problems that require numerical techniques for their solution and see examples of the error propagation that can occur when numerical methods are applied ...



A review of contact algorithms

Any algorithm for solving continuum mechanics problems by a grid based method can serve as an example. If. 3. Page 4. A review of contact algorithms different 





The Use of Cubic Splines in the Numerical Solution of a System of

(Received October 2000; accepted November 2000). Abstract--We use uniform cubic numerical method for solving a system of second-order boundary value problems.



INTERPOLATION

3 апр. 2020 г. 276 • NUMERICAL METHODS IN ENGINEERING AND SCIENCE. For any real ... Solve the equation x = 10 log x by iterative method given that x: 1.35.



Numerical Analysis 9th ed.

1 Mathematical Preliminaries and Error Analysis 1 that CAS employ when they are unable to solve a problem exactly. ... 1960 1970 1980 1990 2000.



NUMERICAL ANALYSIS PRACTICE PROBLEMS The problems that

They are typical of the types of problems that will be on the tests. 1. Solving Equations. Problem 1. Suppose that f : R ? R is continuous and suppose that for 



Schaums Outline of Numerical Analysis

Schaum's outline of theory and problems of numerical analysis/by. Francis Scheid.-2nd ed. and supporting detail is provided among the solved problems.



NUMERICAL ANALYSIS AND SYSTEMS THEORY† 1. Introduction

2000 Mathematical Theory of Networks and Systems Conference held in in the straightforward use of existing numerical software to solve standard problems.



Numerical Analysis (Second Edition)

Prologue. P1 Overview. Numerical Analysis is the branch of mathematics that provides tools and methods for solving mathematical problems in numerical form.



NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS

numerical analysis of differential equations are tied closely to theoretical behavior associated with the problem being solved. For example the criteria 



Introduction-to-the-Finite-Element-Method-Reddy.pdf

2000 Solved Problems in Mechanical Engineering Thermodynamics. 2000 Solved Problems in Numerical Analysis. 700 Solved Problems in Vector Mechanics for 



NUMERICAL SOLUTION OF PARTIAL DIFFERENTIAL EQUATIONS

03-Apr-2020 Solve the boundary value problem ut = uxx under the conditions u(0 t)= u(1



E:Computational Fluid Dynamics (CFD) CollectionComputational

2000 Solved Problems in Numerical Analysis. 700 Solved Problems in Vector Mechanics for Engineers: Dynamics. 800 Solved Problems in Vector Mechanics for 



Solving Boundary Value Problems for Ordinary Differential

26-Oct-2000 Section 3 describes briefly the numerical method. Section 4 is a collection of examples that illustrate the solution of BVPs with.

Solving Boundary Value Problems for Ordinary

Dierential Equations in Matlabwithbvp4c

Lawrence F. Shampine

Jacek Kierzenka

y

Mark W. Reichelt

z

October 26, 2000

1 Introduction

Ordinary dierential equations (ODEs) describe phenomena that change contin- uously. They arise in models throughout mathematics, science, and engineering. By itself, a system of ODEs has many solutions. Commonly a solution of inter- est is determined by specifying the values of all its components at a single point x=a. This is an initial value problem (IVP). However, in many applications a solution is determined in a more complicated way. A boundary value problem (BVP) species values or equations for solution components at more than one x. Unlike IVPs, a boundary value problem may not have a solution, or may have a nite number, or may have innitely many. Because of this, programs for solving BVPs require users to provide a guess for the solution desired. Of- ten there are parameters that have to be determined so that the BVP has a solution. Again there might be more than one possibility, so programs require a guess for the parameters desired. Singularities in coecients and problems posed on innite intervals are not unusual. Simple examples are used inx2to illustrate some of these possibilities. This tutorial shows how to formulate, solve, and plot the solution of a BVP with theMatlabprogrambvp4c. It aims to make solving a typical BVP as easy as possible. BVPs are much harder to solve than IVPs and any solver might fail, even with good guesses for the solution and unknown parameters.bvp4cis an eective solver, but the underlying method and the computing environment are not appropriate for high accuracies nor for problems with extremely sharp changes in their solutions. Section 3 describes briefly the numerical method. Section 4 is a collection of examples that illustrate the solution of BVPs with bvp4c. The rst three should be read in order because they introduce suc- cessively features of the solver as it is applied to typical problems. Although Math. Dept., SMU, Dallas, TX 75275 (lshampin@mail.smu.edu) y The MathWorks, Inc., 3 Apple Hill Drive, Natick, MA 01760 (jkierzenka@mathworks.com) z

11 Coolidge Road, Wayland, MA 01778 (reichelt@alum.mit.edu)

1 bvp4caccepts quite general BVPs, problems arise in the most diverse forms and they may require some preparation for their solution. The remaining examples illustrate this preparation for common tasks. Some exercises are included for practice. M-les for the solution of all the examples and exercises accompany this tutorial.

2 Boundary Value Problems

If the functionfis smooth on [a;b], the initial value problemy 0 =f(x;y),y(a) given, has a solution, and only one. Two-point boundary value problems are exemplied by the equation y 00 +y=0 (1) with boundary conditionsy(a)=A,y(b)=B. An important way to analyze such problems is to consider a family of solutions of IVPs. Lety(x;s)bethe solution of equation (1) with initial valuesy(a)=A,y 0 (a)=s. Eachy(x;s) extends tox=band we ask, for what values ofsdoesy(b;s)=B?Ifthere is a solutionsto this algebraic equation, the correspondingy(x;s) provides a solution of the dierential equation that satises the two boundary conditions. Using linearity we can sort out the possibilities easily. Letu(x) be the solution dened byy(a)=A,y 0 (a)=0andv(x) be the solution dened byy(a)=0, y 0 (a) = 1. Linearity implies thaty(x;s)=u(x)+sv(x), and the boundary conditionB=y(b;s)=u(b)+sv(b) amounts to a linear algebraic equation for the unknown initial slopes. The familiar facts of existence and uniqueness of solutions of linear algebraic equations then tell us that there is either exactly one solution to the BVP, or there are boundary valuesBfor which there is no solution and others for which there are innitely many solutions. Eigenvalue problems, more specically Sturm-Liouville problems, are exem- plied by y 00 +y=0 withy(0) = 0,y() = 0. Such a problem obviously has the trivial solution y(x)0, but for some values of, there are non-trivial solutions. Suchare called eigenvalues and the corresponding solutions are called eigenfunctions. If y(x) is a solution of this BVP, it is obvious thaty(x) is, too. Accordingly, we need a normalizing condition to specify a solution of interest, for instance y 0 (0) = 1. For>0, the solution of the IVP withy(0) = 0,y 0 (0) = 1 is y(x)=sin xp =p. The boundary conditiony() = 0 amounts to a non- linear algebraic equation for. Generally existence and uniqueness of solutions of nonlinear algebraic equations are dicult matters. For this example the al- gebraic equation is solved easily to nd that the BVP has a non-trivial solution if, and only if,=k 2 fork=1;2;:::. This example shows that when solving a Sturm-Liouville problem, we have to specify not only a normalizing condition, but also which eigenvalue interests us. 2

00.511.522.533.54

-2 -1.5 -1 -0.5 0 0.5 1 1.5 2 2.5 y x

Figure 1: Two solutions fory

00 +jyj=0. Nonlinearity introduces other complications illustrated by the problem [3] y 00 +jyj=0 withy(0) = 0,y(b)=B. Proceeding as with the linear examples, it is found that for anyb>, there are exactlytwosolutions for anyB<0. One solution has the formy(x;s)=ssinhx; it starts o with a negative slopesand decreases monotonely toB. The other starts o with a positive slope where it has the form y(x;s)=ssinx. This solution crosses the axis atx=, where its form changes and it decreases thereafter monotonely toB. Figure 1 shows an example of this withb=4andB=-2. Much as with eigenvalue problems, when solving nonlinear BVPs we have to specify which solution is the one that interests us. Examples inx4 show that BVPs modelling physical situations do not nec- essarily have unique solutions. Other examples show that problems involving physical parameters might have solutions only for parameter values in certain ranges. The examples make it clear that in practice, solving BVPs may well involve an exploration of the existence and uniqueness of solutions of a model.

This is quite dierent from solving IVPs.

3 Numerical Methods

The theoretical approach to BVPs ofx2 is based on the solution of IVPs for ODEs and the solution of nonlinear algebraic equations. Because there are eective programs for both tasks, it is natural to combine them in a program for the solution of BVPs. The approach is called a shooting method. Because 3 it appears so straightforward to use quality numerical tools for the solution of BVPs by shooting, it is perhaps surprising thatbvp4cisnota shooting code. The basic diculty with shooting is that a perfectly nice BVP can require the integration of IVPs that are unstable. That is, the solution of a BVP can be insensitive to changes in boundary values, yet the solutions of the IVPs of shooting are sensitive to changes in initial values. The simple example y 00 -100y=0 withy(0) = 1,y(1) =Bmakes the point. Shooting involves the solution y(x;s)=cosh10x+0:1ssinh10xof the IVP with initial valuesy(0) = 1,y 0 (0) = s. Obviously@y=@s=0:1sinh10x, which can be as large as 0:1sinh10

1101. A little calculation shows that the slope that results in satisfaction of

the boundary condition atx=1iss= 10(B-cosh10)=sinh10 and then that for the solution of the BVP,j@y=@Bj=jsinh10x=sinh10j1. Evidently the solutions of the IVPs are considerably more sensitive to changes in the initial slopesthan the solution of the BVP is to changes in the boundary valueB.If the IVPs are not too unstable, shooting can be quite eective. Unstable IVPs can cause a shooting code to fail because the integration \blows up" before reaching the end of the interval. More often, though, the IVP solver reaches the end, but is unable to compute an accurate result there and because of this, the nonlinear equation solver is unable to nd accurate initial values. A variety of techniques are employed to improve shooting, but when the IVPs are very unstable, shooting is just not a natural approach to solving BVPs. bvp4cimplements a collocation method for the solution of BVPs of the form y 0 =f(x;y;p);axb subject to general nonlinear, two-point boundary conditions g(y(a);y(b);p)=0 Herepis a vector of unknown parameters. For simplicity it is suppressed in the expressions that follow. The approximate solutionS(x) is a continuous function that is a cubic polynomial on each subinterval [x n ;x n+1 ]ofamesh a=x 0