Jacobis Method-Numerical Analysis-Lecture Handouts, Lecture notes of Mathematical Methods for Numerical Analysis and Optimization

This course contains solution of non linear equations and linear system of equations, approximation of eigen values, interpolation and polynomial approximation, numerical differentiation, integration, numerical solution of ordinary differential equations. This lecture includes: Jacobi, Method, Orthogonal, Eigenvectors, Symmetric, Matrix, Theory, Diagonal, Transformations, Construct, Row

Typology: Lecture notes

2011/2012

Uploaded on 08/05/2012

saruy
saruy 🇮🇳

4.5

(120)

130 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Numerical Analysis –MTH603 VU
© Copyright Virtual University of Pakistan 1
Jacobi’s Method
Definition
An n x n matrix [A] is said to be orthogonal if
1
[][] [],
i.e.[] []
T
T
A
AI
A
A
=
=
In order to compute all the eigen values and the corresponding eigenvectors of a real symmetric matrix,
Jacobi’s method is highly recommended. It is based on an important property from matrix theory, which
states
that, if [A] is an n x n real symmetric matrix, its eigen values are real, and there exists an orthogonal matrix
[S] such that the diagonal matrix D is
1
[][][]SAS
This digitalization can be carried out by applying a series of orthogonal transformations
12
, ,..., ,
n
SS S
Let A be an n x n real symmetric matrix. Suppose ij
abe numerically the largest element amongst the off-
diagonal elements of A. We construct an orthogonal matrix S1 defined as
sin , sin ,
cos , cos
ij ji
ii jj
ss
ss
θ
θ
θ
θ
=−=
==
While each of the remaining off-diagonal elements are zero, the remaining diagonal elements are assumed
to be unity. Thus, we construct S1 as under
1
i-th column -th column
10 0 0 0
01 0 0 0
0 0 cos sin 0 i-th row
0 0 sin cos 0 -th row
00 0 0 1
j
S
j
θθ
θθ
↓↓





−←

=






"" "
"" "
## # # #
"" "
## # # #
"" "
## # # #
"" "
Where cos , sin , sin cosand
θ
θθ ϑ
are inserted in ( , ),( , ),( , ), ( , ) thii i j ji j j
positions respectively,
and elsewhere it is identical with a unit matrix.
Now, we compute
1
11111
T
DSASSAS
==
Since S1 is an orthogonal matrix, such that .After the transformation, the elements at the position (i , j), (j ,
i) get annihilated, that is dij and dji reduce to zero, which is seen as follows:
docsity.com
pf2

Partial preview of the text

Download Jacobis Method-Numerical Analysis-Lecture Handouts and more Lecture notes Mathematical Methods for Numerical Analysis and Optimization in PDF only on Docsity!

Jacobi’s Method

Definition An n x n matrix [ A ] is said to be orthogonal if

1

[ ] [ ] [ ],

i.e.[ ] [ ]

T T

A A I

A A −

In order to compute all the eigen values and the corresponding eigenvectors of a real symmetric matrix, Jacobi’s method is highly recommended. It is based on an important property from matrix theory, which states that, if [ A ] is an n x n real symmetric matrix, its eigen values are real, and there exists an orthogonal matrix [ S ] such that the diagonal matrix D is [ S −^1 ][ A ][ S ]

This digitalization can be carried out by applying a series of orthogonal transformations S 1 (^) , S 2 ,..., Sn ,

Let A be an n x n real symmetric matrix. Suppose aij be numerically the largest element amongst the off-

diagonal elements of A. We construct an orthogonal matrix S 1 defined as

sin , sin , cos , cos

ij ji ii jj

s s s s

= −^ =

While each of the remaining off-diagonal elements are zero, the remaining diagonal elements are assumed to be unity. Thus, we construct S 1 as under

1

i-th column -th column

0 0 cos sin 0 i-th row

0 0 sin cos 0 -th row

0 0 0 0 1

j

S

j

= ^ 

Where cos θ , − sin θ ,sin θ and cosϑ are inserted in ( , ), ( , i i i j ), ( , ), ( , j i j j ) − thpositions respectively,

and elsewhere it is identical with a unit matrix. Now, we compute D 1 (^) = S 1 − 1 AS 1 (^) = S 1 T AS 1 Since S1 is an orthogonal matrix, such that .After the transformation, the elements at the position (i , j), (j , i) get annihilated, that is dij and dji reduce to zero, which is seen as follows:

docsity.com

2 2 2 2

cos sin cos sin sin cos sin cos cos sin cos sin ( ) sin cos cos 2 ( ) sin cos cos 2 sin cos 2 sin cos

ii ij ji jj ii ij ij jj ii jj jj ii ij ji ii ij ii jj ij

d d d d a a a a a a a a a a a a a a a a

θ θ θ θ θ θ θ θ θ θ θ θ θ θ θ θ θ θ θ θ θ θ

= ^ ^ ^ ^ − 

 −  ^  

Therefore, dij = 0 only if,

cos 2 sin 2 0 2

jj ii ij

a θ+ a^ − a θ=

That is if

tan 2 2 ij ii jj

a a a

Thus, we choose θ such that the above equation is satisfied, thereby, the pair of off-diagonal elements dij

and dji reduces to zero.However, though it creates a new pair of zeros, it also introduces non-zero contributions at formerly zero positions. Also, the above equation gives four values of , but to get the least possible rotation, we choose

docsity.com