Boundary-Value Problems

Slides:



Advertisements
Similar presentations
Splines and Piecewise Interpolation
Advertisements

Solve a System Algebraically
Part 2 Chapter 6 Roots: Open Methods
Part 2 Chapter 6 Roots: Open Methods
Roots: Bracketing Methods
Part 6 Chapter 22 Boundary-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill.
General Linear Least-Squares and Nonlinear Regression
Initial-Value Problems
Polynomial Interpolation
Part 3 Chapter 8 Linear Algebraic Equations and Matrices PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The.
Differential Equations and Boundary Value Problems
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Part 81 Partial.
Part 4 Chapter 17 Polynomial Interpolation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill.
Part 2 Chapter 5 Roots: Bracketing Methods PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill.
Boundary-Value Problems Boundary-value problems are those where conditions are not known at a single point but rather are given at different values of.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 8 - Chapter 29.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 6 - Chapter 24 Boundary Value Problems.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 271 Boundary-Value.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 27.
Part 3 Chapter 12 Iterative Methods
Warm Up. Solving Differential Equations General and Particular solutions.
Part 3 Chapter 9 Gauss Elimination
Introduction to Algorithms Second Edition by
Introduction to Algorithms Second Edition by
Part 3 Chapter 12 Iterative Methods
Linear Algebraic Equations and Matrices
DIFFERENTIAL EQUATIONS
Applied Numerical Methods
Differential Equations
Polynomial Interpolation
Matrix Inverse and Condition
Linear Algebraic Equations and Matrices
We will be looking for a solution to the system of linear differential equations with constant coefficients.
Numerical Integration Formulas
Copyright © The McGraw-Hill Companies, Inc
Chapter 15 Introduction to the Laplace Transform
Numerical Differentiation
Solving Systems of Equations
Part 2 Chapter 6 Roots: Open Methods
Boundary-Value Problems for ODE )בעיות הגבול(
Chapter 3 Image Slides Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Introduction to Algorithms Second Edition by
Chapter 27.
Mathematical Modeling, Numerical Methods, and Problem Solving
Chapter 2 Excel Fundamentals
Chapter R A Review of Basic Concepts and Skills
Introduction to Algorithms Second Edition by
General Linear Least-Squares and Nonlinear Regression
Splines and Piecewise Interpolation
Applied Numerical Methods
Introduction to Algorithms Second Edition by
Equations of Straight Lines
Introduction to Algorithms Second Edition by
Introduction to Algorithms Second Edition by
Fundamentals of Electric Circuits Chapter 15
Part 3 Chapter 10 LU Factorization
Introduction to Algorithms Second Edition by
Title Chapter 22 Image Slides
Roots: Bracketing Methods
Numerical Integration of Functions
Adaptive Methods and Stiff Systems
Copyright © The McGraw-Hill Companies, Inc
Introduction to Algorithms Second Edition by
CHAPTER 6 SKELETAL SYSTEM
Introduction to Algorithms Second Edition by
Roots: Bracketing Methods
Part 2 Chapter 7 Optimization
Part 2 Chapter 6 Roots: Open Methods
Chapter 3 Introduction to Physical Design of Transportation Facilities.
Introduction to Algorithms Second Edition by
Presentation transcript:

Boundary-Value Problems Part 6 Chapter 24 Boundary-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Chapter Objectives Understanding the difference between initial-value and boundary-value problems. Knowing how to express an nth order ODE as a system of n first-order ODEs. Knowing how to implement the shooting method for linear ODEs by using linear interpolation to generate accurate “shots.” Understanding how derivative boundary conditions are incorporated into the shooting method.

Objectives (cont) Knowing how to solve nonlinear ODEs with the shooting method by using root location to generate accurate “shots.” Knowing how to implement the finite-difference method. Understanding how derivative boundary conditions are incorporated into the finite-difference method. Knowing how to solve nonlinear ODEs with the finite-difference method by using root location methods for systems of nonlinear algebraic equations.

Boundary-Value Problems Boundary-value problems are those where conditions are not known at a single point but rather are given at different values of the independent variable. Boundary conditions may include values for the variable or values for derivatives of the variable. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Higher Order Systems MATLAB’s ODE solvers are based on solving first-order differential equations only. To solve an nth order system (n>1), the system must be written as n first-order equations: Each first-order equation needs an initial value or boundary value to solve.

The Shooting Method One method for solving boundary-value problems - the shooting method - is based on converting the boundary-value problem into an equivalent initial-value problem. Generally, the equivalent system will not have sufficient initial conditions and so a guess is made for any undefined values. The guesses are changed until the final solution satisfies all the boundary conditions. For linear ODEs, only two “shots” are required - the proper initial condition can be obtained as a linear interpolation of the two guesses. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Boundary Conditions Dirichlet boundary conditions are those where a fixed value of a variable is known at a particular location. Neumann boundary conditions are those where a derivative is known at a particular location. Shooting methods can be used for either kind of boundary condition.

The Shooting Method for Nonlinear ODEs For nonlinear ODEs, interpolation between two guesses will not necessarily result in an accurate estimate of the required boundary condition. Instead, the boundary condition can be used to write a roots problem with the estimate as a variable.

Example Solve with ’=2.7x10-9 K-3 m-2, L=10 m, h’=0.05 m-2, T=200 K, T(0) = 300 K, and T(10) = 400 K. First - break into two equations:

Example Code Code for derivatives: function dy=dydxn(x,y) dy=[y(2);… -0.05*(200-y(1))-2.7e-9*(1.6e9-y(1)^4)]; Code for residual: function r=res(za) [x,y]=ode45(@dydxn, [0 10], [300 za]); r=y(length(x),1)-400; Code for finding root of residual: fzero(@res, -50) Code for solving system: [x,y]=ode45(@dydxn, [0 10], [300 fzero(@res, -50) ]);

Finite-Difference Methods The most common alternatives to the shooting method are finite-difference approaches. In these techniques, finite differences are substituted for the derivatives in the original equation, transforming a linear differential equation into a set of simultaneous algebraic equations.

Finite-Difference Example Convert: into n-1 simultaneous equations at each interior point using centered difference equations:

Finite-Difference Example (cont) Since T0 and Tn are known, they will be on the right-hand-side of the linear algebra system (in this case, in the first and last entries, respectively):

Derivative Boundary Conditions Neumann boundary conditions are resolved by solving the centered difference equation at the point and rewriting the system equation accordingly. For example, if there is a Neumann condition at the T0 point,

Finite-Difference Method for Nonlinear ODEs Root location methods for systems of equations may be used to solve nonlinear ODEs. Another method is to adapt a successive substitution algorithm to calculate the values of the interior points.