Top Banner
1) Prepared By : Pratik Sharma, Smit Shah, Shivani Sharma, Rehan Shaikh Smarth Shah ENROLLMENT NO. : 140410109098 Branch :Electrical Engineering Guided by: H PATEL
17

ORTHOGONAL, ORTHONORMAL VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

Jan 15, 2017

Download

Engineering

qwerty7696
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

1) Prepared By : Pratik Sharma, Smit Shah, Shivani Sharma, Rehan Shaikh Smarth ShahENROLLMENT NO. : 140410109098 140410109096 140410109099 140410109097 140410109095

Branch :Electrical Engineering

Guided by:H PATEL

Page 2: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

ORTHOGONAL VECTOR.ORTHONORMAL VECTOR.GRAM SCHMIDT PROCESS.ORTHOGONALLY DIAGONALIZATION.

CONTENTS

Page 3: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

Definition. We say that 2 vectors are orthogonal if they are perpendicular to each other. i.e. the dot product of the two vectors is zero.

Definition. We say that a set of vectors {v1, v2, ..., vn} are mutually orthogonal if every pair of vectors is orthogonal. i.e. vi.vj = 0, for all i not equal j.

ORTHOGONAL VECTORS

Page 4: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

E.g.:- Check whether v1=(1,-1,0) v2=(1,1,0) v3=(0,0,1) is orthogonal vector or not ?

~ v1.v2 =1+(-1)+0 =0 v2.v3 = 0+0+0 = 0 v3.v1 = 0+0+0 =0 so,We can say that given vector is

orthogonal.

EXAMPLE:

Page 5: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

Definition. If v1,v2,……Vn whose ||v1||=||v2||=……||Vn||=1 then v1,v2,……Vn is a orthonormal vector.

• Definition. An orthogonal set in which each vector is a unit vector is called orthonormal.

ORTHONORMAL VECTOR

jijiVS

ji

n

01

,

,,, 21

vv

vvv

Page 6: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

E.g.1:- Check whether this is orthonormal or not ?

~

so,We can say that given vector is orthogonal.

EXAMPLE:

31,

32,

32,

322,

62,

62,0,

21,

21

321

S

vvv

1||||

1||||

10||||

91

94

94

333

98

362

362

222

21

21

111

vvv

vvv

vvv

Page 7: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

If u1,u2,u3 is not orthogonal. Then v1.v2 also not equal to 0. then we use Gram Schmidt Produces.

Given a set of linearly independent vectors, it is often useful to convert them into an orthonormal set of vectors. We first define the projection operator.

Definition. Let u and v be two vectors. The projection of the vector v on u is defined as follows:

GRAM SCHMIDT PROCESS

Page 8: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

Gram-Schmidt process:- is a basis for an inner product

space V },,,{ 21 nB uuu

11Let uv

},,,{' 21 nB vvv

},,,{''2

2

n

nBvv

vv

vv

1

1

1

1 〉〈〉〈proj

1

n

ii

ii

innnnn n

vv,vv,vuuuv W

2

22

231

11

133333 〉〈

〉〈〉〈〉〈proj

2v

v,vv,uv

v,vv,uuuuv W

111

122222 〉〈

〉〈proj1

vv,vv,uuuuv W

is an orthogonal basis.

is an orthonormal basis.

Page 9: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

)0,1,1(11 uv

)2,0,0()0,21,

21(

2/12/1)0,1,1(

21)2,1,0(

222

231

11

1333

vvvvuv

vvvuuv

)}2,1,0(,)0,2,1(,)0,1,1{(321

Buuu

)0,21,

21()0,1,1(

23)0,2,1(1

11

1222

vvvvuuv

Sol:

EXAMPLE

Ex1 : (Applying the Gram-Schmidt orthonormalization process)

Apply the Gram-Schmidt process to the following basis.

Page 10: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

}2) 0, (0, 0), , 21 ,

21( 0), 1, (1,{},,{' 321

vvvB

}1) 0, (0, 0), , 2

1 ,21( 0), ,

21 ,

21({},,{''

3

3

2

2

vv

vv

vv

1

1B

Orthogonal basis

Orthonormal basis

Page 11: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

Definition. A square matrix A is orthogonally diagonalizable if there exists an orthogonal matrix Q such that Q^T A Q = D is a diagonal matrix.

ORTHOGONAL DIAGONALIZATION

Page 12: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

STEP 1. find out eigen values. STEP 2. Find out eigen vectors. STEP 3. say eigen vectors as a

u1,u2,u3….. STEP 4. convert in a ortho normal vector

q1,q2,q3….using gram schmidt process. STEP 5. find matrix p=[ q1,q2,q3]

STEP 6.find p^-1 A P= P^T A P=[ λ1 0 0 ]

[ 0 λ2 0 ]

[ 0 0 λ3]

How to orthogonally diagonalize a matrix?

Page 13: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

13/80

Page 14: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

14/80

Page 15: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

15/80

Page 16: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.

16/80

Page 17: ORTHOGONAL, ORTHONORMAL  VECTOR, GRAM SCHMIDT PROCESS, ORTHOGONALLY DIAGONALIZATION.