Householder's Method

and

are vectors with the same norm, there exists an orthogonal symmetric matrix

such that

,
where

and

.

Since

is both orthogonal and symmetric, it follows that

Corollary ( Householder Matrix)

Let be an matrix, and any vector. If is an integer with , we can construct a vector and matrix so that

(1) [Graphics:Images/HouseholderMod_gr_20.gif] .

Householder Transformations

Suppose that is a symmetric matrix. Then a sequence of transformations of the form will reduce to a symmetric tridiagonal matrix. Let us visualize the process when . The first transformation is defined to be , where is constructed by applying the above Corollary with the vector being the first column of the matrix . The general form of is

[Graphics:Images/HouseholderMod_gr_32.gif]

where the letter stands for some element in . As a result, the transformation does not affect the element of :

(2) .

The element denoted is changed because of premultiplication by , and is changed because of postmultiplication by ; since is symmetric, we have . The changes to the elements denoted have been affected by both premultiplication and postmultiplication. Also, since is the first column of , equation (1) implies that .

The second Householder transformation is applied to the matrix defined in (2) and is denoted , where is constructed by applying the Corollary with the vector being the second column of the matrix . The form of is

[Graphics:Images/HouseholderMod_gr_55.gif]

where stands for some element in . The identity block in the upper-left corner ensures that the partial tridiagonalization achieved in the first step will not be altered by the second transformation . The outcome of this transformation is

(3) [Graphics:Images/HouseholderMod_gr_60.gif] .

The elements and were affected by premultiplication and postmultiplication by . Additional changes have been introduced to the other elements by the transformation. The third Householder transformation, , is applied to the matrix defined in (3) where the Corollary is used with being the third column of . The form of is

[Graphics:Images/HouseholderMod_gr_70.gif]

Again, the identity block ensures that does not affect the elements of , which lie in the upper corner, and we obtain

.

Thus it has taken three transformations to reduce to tridiagonal form.

In general, for efficiency, the transformation is not performed in matrix form. The next result shows that it is more efficiently carried out via some clever vector manipulations.

Theorem (Computation of One Householder Transformation)

If is a Householder matrix, the transformation is accomplished as follows. Let

Let and compute

and
,

then .

Reduction to Tridiagonal Form

Suppose that is a symmetric matrix. Start with

.

Construct the sequence of Householder matrices, so that

for ,

where has zeros below the subdiagonal in columns . Then is a symmetric tridiagonal matrix that is similar to . This process is called Householder's method.

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...

Newton-Raphson Method

This method is generally used to improve the result obtained by one of the previous methods. Let x o be an approximate root of f(x) = 0 and let x 1 = x o + h be the correct root so that f(x 1 ) = 0. Expanding f(x o + h) by Taylor ’s series, we obtain f(x o ) + hf’(x o ) + h 2 f’’(x o )/2! +-----= 0 Neglecting the second and higher order derivatives, we have f(x o ) + hf’(x o ) = 0 Which gives h = - f(x o )/f’(x o ) A better approximation than x o is therefore given be x 1 , where x 1 = x o – f(x o )/f’(x o ) Successive approximations are given by x 2 , x 3 ,----,x n+1 , where x n+1 = x n – f(x n )/f’(x n ) Which is the Newton-Raphson formula. Example: - Find a real root of the equation x 3 -5x + 3 = 0. Sol n : - Let, f(x) = x 3 -5x + 3 = 0 f’(x) = 3x 2 - 5 Choosing x o = 1 Step-1: f(x o ) = -1 f(x o ) = -2 So, x 1 =1 – ½ = 0.5 Step-2: f(x 1 ) = 0.625 f’(x 1 ) = -4.25 x 2 = 0.5 + 0.625/4.25 = 0.647 S...

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 ...

Numerical Analysis

Search This Blog