# Boundary Value Problems/Numerical Methods

Return to Main Page *Boundary Value Problems

These lessons are to introduce you to Numerical Methods used to calculate numerical solutions to the 2-D BVPs discussed earlier. Two resources that would be useful for the exercises are

However any computational system that can solve a system of equations will meet the needs of many of the elementary exercises. Three Linux based packages (free) are:

'

## Contents

## Finite Difference Method[edit]

The Finite Difference method is a numerical method used for approximating the solution to a differential equation. The fundamentals of FD methods with application to an ODE and the 1-D heat equation can be found at [Finite Difference: http://en.wikipedia.org/wiki/Finite_difference_method]

A particular application is the Finite Difference Time Domain method to wave propagation problems

### Assignment: FD-1[edit]

- Read the material at [Finite Difference: http://en.wikipedia.org/wiki/Finite_difference_method].
- Also read Chapter 7 in Power's
^{[1]} - Attempt the following problems FD-1 problems
- Check your results against the FD-1 posted solutions posted solutions.
- If your solution provides additional insight (you think) to the solving of the problem, please create a solution using the solution template solution template

## Finite Elements Method[edit]

The Finite Elements Method constitutes a numerical approach to approximating the solution of an ordinary differential equation over a two-dimensional grid that is not rectangular, or one in which the data points, or nodes, are not evenly spaced. This gives it an advantage over the Finite Differences Method.

The first step of the method consists of *triangulating* the region to be integrated by dividing it into triangles, with the nodes as vertices. The next step is to determine the values of the unknown function at the nodes. Here is where the "finite elements" come in. A finite element is a function whose graph is a pyramid with its peak over a node . A finite element solution to an ODE is a linear combination of finite elements: where . The constants are then the values of the function at the nodes. Once these values are found, each triangle is integrated using the "Three Corners" method (the triangular version of the Trapezoid method) and summed.
^{[2]}

## Plot of Finite Difference Example[edit]

Example of on a half annulus geometry with:

- for
- for