Frobenius Series Solution

Consider the second order linear differential equation

(1)

.

Rewrite this equation in the form

, then use the substitutions

and

and rewrite the differential equation (1) in the form

(2)

Definition (Analytic):

The functions and are analytic at if they have Taylor series expansions with radius of convergence and , respectively. That is

which converges for
and
which converges for

Definition (Ordinary Point):

If the functions and are analytic at , then the point is called an ordinary point of the differential equation

.

Otherwise, the point is called a singular point.

Definition (Regular Singular Point):

Assume that is a singular point of (1) and that and are analytic at .

They will have Maclaurin series expansions with radius of convergence and , respectively. That is

which converges for
and
which converges for

Then the point is called a regular singular point of the differential equation (1).

Method of Frobenius:

This method is attributed to the german mathemematican Ferdinand Georg Frobenius (1849-1917 ). Assume that is regular singular point of the differential equation

.

A Frobenius series (generalized Laurent series) of the form

can be used to solve the differential equation. The parameter must be chosen so that when the series is substituted into the D.E. the coefficient of the smallest power of is zero. This is called the indicial equation. Next, a recursive equation for the coefficients is obtained by setting the coefficient of equal to zero. Caveat: There are some instances when only one Frobenius solution can be constructed.

Definition (Indicial Equation):

The parameter in the Frobenius series is a root of the indicial equation

.

Assuming that the singular point is , we can calculate as follows:

and

The Recursive Formulas:

For each root of the indicial equation, recursive formulas are used to calculate the unknown coefficients . This is custom work because a numerical value for is easier use.

Comments

Runge-Kutta-Fehlberg Method

One way to guarantee accuracy in the solution of an I.V.P. is to solve the problem twice using step sizes h and and compare answers at the mesh points corresponding to the larger step size. But this requires a significant amount of computation for the smaller step size and must be repeated if it is determined that the agreement is not good enough. The Runge-Kutta-Fehlberg method (denoted RKF45) is one way to try to resolve this problem. It has a procedure to determine if the proper step size h is being used. At each step, two different approximations for the solution are made and compared. If the two answers are in close agreement, the approximation is accepted. If the two answers do not agree to a specified accuracy, the step size is reduced. If the answers agree to more significant digits than required, the step size is increased. Each Runge-Kutta-Fehlberg step requires the use of the following six values: Then an approximation to the solution of the I.V.P.

Van Der Pol System

The van der Pol equation is an ordinary differential equation that can be derived from the Rayleigh differential equation by differentiating and setting . It is an equation describing self-sustaining oscillations in which energy is fed into small oscillations and removed from large oscillations. This equation arises in the study of circuits containing vacuum tubes and is given by If , the equation reduces to the equation of simple harmonic motion The van der Pol equation is , where is a constant. When the equation reduces to , and has the familiar solution . Usually the term in equation (1) should be regarded as friction or resistance, and this is the case when the coefficient is positive. However, if the coefficient is negative then we have the case of "negative resistance." In the age of "vacuum tube" radios, the " tetrode vacuum tube " (cathode, grid, plate), was used for a power amplifie

Powell's Method

The essence of Powell's method is to add two steps to the process described in the preceding paragraph. The vector represents, in some sense, the average direction moved over the n intermediate steps in an iteration. Thus the point is determined to be the point at which the minimum of the function f occurs along the vector . As before, f is a function of one variable along this vector and the minimization could be accomplished with an application of the golden ratio or Fibonacci searches. Finally, since the vector was such a good direction, it replaces one of the direction vectors for the next iteration. The iteration is then repeated using the new set of direction vectors to generate a sequence of points . In one step of the iteration instead of a zig-zag path the iteration follows a "dog-leg" path. The process is outlined below. Let be an initial guess at the location of the minimum of the function . Let for be the

Fibonacci Method

An approach for finding the minimum of in a given interval is to evaluate the function many times and search for a local minimum. To reduce the number of function evaluations it is important to have a good strategy for determining where is to be evaluated. Two efficient bracketing methods are the golden ratio and Fibonacci searches. To use either bracketing method for finding the minimum of , a special condition must be met to ensure that there is a proper minimum in the given interval. The function is unimodal on , if there exists a unique number such that is decreasing on , and is increasing on . In the golden ratio search two function evaluations are made at the first iteration and then only one function evaluation is made for each subsequent iteration. The value of remains constant on each subinterval and the search is terminated at the subinterval, provided that or where are the predefined tolerances. The Fibo

Numerical Analysis

Search This Blog