12 views

Uploaded by sundarmeenakshi

c2p5

- Computational Modeling Methods for Neuroscientists (2009)
- Quantum 7 8 9
- Linear Control Theory
- Bank Mgt Paper 2
- DIC12!09!1D ContinuousWavelets
- New High-speed Machine Tool Structure by Holistic Mechatronic Systems Design
- Dynamic Structural Modification
- Julia Cheatsheet
- 22_3_rptd_eigen_vals_symm_mtrx.pdf
- Schrieffer Wolf
- ch05.doc
- Lhospital Impar
- ps21
- 01709128
- 1.Eigen Values & Vectors
- FinalMath121BFall10 Solutions
- dela_6-1
- HO-06
- K-88
- 01532118

You are on page 1of 9

5-1

2.5 Generation of Orthonormal Bases We have seen that orthonormal bases simplify the calculation of

n and the calculation of distances and energies from the coefficients x

coefficients. This section outlines two classical ways to generate an orthonormal basis from an arbitrary set of basis vectors. (Note that the arbitrary basis and the orthonormal basis span the same space.) Well denote the projection of some x(t ) onto the space spanned by, say,

v1 (t ) and v2 (t ) by

n =1

where

= G 1p , x

* (t ) vn (t ) dt [G ]k ,n = vk

pn =

* x (t ) vn (t ) dt

2.5-1

2.5-2

2.5.1 Gram-Schmidt Orthogonalization [P 4.2.3] Consider a set of waveforms {si (t ), i = 1,, M } , not necessarily orthonormal. The GS algorithm creates from them an orthonormal set

GS rests on the fact that the error in a projection is orthogonal to the space onto which a vector is projected. Then just normalize.

e1 (t ) = s1 (t )

u1 (t ) = e1 (t ) u2 (t ) = e2 (t ) u3 (t ) = e3 (t )

e2 (t ) = s2 (t ) Ps1 s2 (t )

e3 (t ) = s3 (t ) Ps1 , s2 s3 (t )

Es1

*

2. c21 =

s2 (t ) u1 (t ) dt , e2 (t ) = s2 (t ) c21u1 (t )

n 1 i =1

u2 (t ) = e2 (t )

Ee2

n. cni =

sn (t ) ui* (t ) dt ,

en (t ) = sn (t ) cni ui (t ) un (t ) = en (t )

Een

etc.

2.5-2

2.5-3

In the process, if any ek (t ) 0 , then sk (t ) is linearly dependent on its predecessors, so discard it.

Also use GS to decorrelate sets of random variables [ENSC 810, Sect 1.3].

2.5-3

2.5-4

When GS is applied to tuples s1 , s 2 , , s M , instead of waveforms, the equations on p. 2.5-2 can be written

s1 = c11 u1

s 2 = c22 u 2 + c21 u1 s3 = c33 u3 + c32 u 2 + c31 u1

or

c11 c21 0 c 22 0 | uN ] 0 0 0 c31 c32 c33 0 cM 1 cM 2 c3M cNM

[s1 | s2 | s3 |

| s M ] = [u1 | u 2 | u3 |

or

S = UC,

where U is unitary and C is upper triangular. Its shown for M = N , but more generally, M > N .

It is not necessarily square, and U has fewer columns than S if the S columns are linearly dependent.

2.5-4

2.5-5

s1 (t ) = c11 u1 (t ) s2 (t ) = c22 u2 (t ) + c21 u1 (t )

c11 c21 0 c 22 0 , u N (t ) ] 0 0 0 cM 1 cM 2 c3M cNM

[ s1 (t ), s2 (t ),

, sM (t ) ] = [u1 (t ), u2 (t ),

s(t ) = u(t ) C

(t ) u(t ) dt = I .

2.5-5

2.5-6

2.5.2 Orthogonalization by Eigendecomposition The waveforms si (t ), i = 1,, N can also be orthogonalized by eigendecomposition. This methods does the orthogonalization in a batch, rather than sequentially, as in GS. Assume the original basis functions si (t ), i = 1,, N are linearly independent. We form the orthonormal basis functions ui (t ), i = 1, , N as linear combinations of the si (t ) by

un (t ) = wi n si (t ), for n = 1,

i =1 N

,N

un (t ) = [ s1 (t ) w1n = s(t ) w sN (t )] n wNn

u(t ) = [u1 (t ) u N (t ) ] = s(t ) W w N ] has columns of coefficient vectors.

where W = [ w1 w 2

2.5-6

2.5-7

* um (t ) un (t ) dt

* wkm

i =1 k =1

win

sk (t ) si (t ) dt = mn

* G ki

s (t ) s(t ) dt W = W G W = I u (t ) u(t ) dt = W

If we can find W that satisfies this equation, then we have the desired orthonormal basis as u(t ) = s(t ) W . As a first step, diagonalize G by a similarity transform. The Gram matrix is Hermitian (i.e., G = G ), so it has special properties: o Its eigenvectors qi (t ), i = 1, , N are orthogonal. Assume they are normalized to unit norm, and use them as columns of matrix Q . Then

Q Q = I ; that is, Q is unitary. Eigenvectors can be complex. Now

Q G Q = and

Q Q = G, where = diag [ 1 ,, N ]

because Q acts as Q 1 . This is the unitary similarity transform. o And the eigenvalues i (t ), i = 1, , N are real.

2.5-7

2.5-8

A Gram matrix G is also positive semidefinite, so i (t ) 0, i = 1, , N . We assumed the original basis set was linearly independent, so this makes

G positive definite, i (t ) > 0, i = 1, , N .

1 2 1 2 , , Choose W = Q1 2Q (where 1 2 = diag N ) , so that 1

W G W = Q1 2Q G Q1 2Q = Q1 2 1 2Q = I

u(t ) = s(t )Q1 2Q

(Q

1 2

Q Q1 2Q = Q1Q = G 1

)(

u(t ) = s(t ) G 1 2

And thats orthogonalization by eigendecomposition. This eigenmethod of creating an orthonormal basis is useful, since we have a diagonal form, rather than the triangular form of the G-S method. However, it is not as easily extended with additional signal waveforms.

2.5-8

2.5-9

For completeness, deal with the possibility that there are at most M < N linearly independent functions in the original basis set, so G is rankdeficient (rank M ). Since some eigenvalues are zero, how can we form

1 2 ? Heres how:

= M 0 0 and Q = [Q M Z ] 0

Q M G QM = M and G = Q M M Q M

12 o Choose W = Q M M Q M . Then 12 1 2 1 2 1 2 W G W = Q M M QM G QM M QM = M M M = I

2.5-9

- Computational Modeling Methods for Neuroscientists (2009)Uploaded byPtolomeo212
- Quantum 7 8 9Uploaded bydmmcmah
- Linear Control TheoryUploaded byBalasubramanian Raja
- Bank Mgt Paper 2Uploaded byMargaret Asukwo James
- DIC12!09!1D ContinuousWaveletsUploaded bybiophysicist87
- New High-speed Machine Tool Structure by Holistic Mechatronic Systems DesignUploaded bynz578427
- Dynamic Structural ModificationUploaded bysumatrablackcoffee453
- Julia CheatsheetUploaded bymbrijbhushan4863
- 22_3_rptd_eigen_vals_symm_mtrx.pdfUploaded byVaibhav Gupta
- Schrieffer WolfUploaded byAdonai Cruz
- ch05.docUploaded byJorge Ausejo M
- Lhospital ImparUploaded byBernardo A. Turcios
- ps21Uploaded byRonaldo Rêgo
- 01709128Uploaded byprotecciones
- 1.Eigen Values & VectorsUploaded bynaufal
- FinalMath121BFall10 SolutionsUploaded bymstan11
- dela_6-1Uploaded bypetergotgotao
- HO-06Uploaded byspiderman0000
- K-88Uploaded bySélima Sahraoui
- 01532118Uploaded byRobert Stanley
- ps2solsUploaded byShweta Sridhar
- Chapter 02Uploaded byaungps_sone82
- Object TrackingUploaded byneomat23
- MathUploaded bymsoofloo
- A Lagrangian Model for Spray DryerUploaded byDemian Sharcob
- howell_etal97.pdfUploaded bycmpmarinho
- One-Shot Balancing of Rigid Rotors, A Closed Form Solution - DeTC 2009Uploaded byLasse Hansen
- 00026922Uploaded byashwini
- WolframAlpha--f_x___x_2_1___2x_2___Derivative____2017_05_03_10_11Uploaded byqugonjinn
- Circular Restricted Three Body ModelUploaded bylostkin

- ECE Interview Questions With AnswersUploaded byRohit Xavier
- 7440565Uploaded bysundarmeenakshi
- Nmea Ibex Presentation EmiUploaded bysundarmeenakshi
- emc_introduction.pdfUploaded byjaneprice
- 1_slidesUploaded bysundarmeenakshi
- 2 Band Pass SignalsUploaded byamitranjan_77
- 3_slides.pdfUploaded bysundarmeenakshi
- Quiz 4 Fading Muqaibel EE573 112Uploaded bysundarmeenakshi
- 1 AnUploaded byMirishkar S Ganesh
- 4 AnUploaded byMirishkar S Ganesh
- c2p4Uploaded bysundarmeenakshi
- c3p1Uploaded bysundarmeenakshi
- INTEGRAL FORMULAE-COMPLETEUploaded byChandrasekar Attayampatty Tamilarasan
- DC 0 SyllabusUploaded bysundarmeenakshi
- Chapter 2 DIgital communicationUploaded bysundarmeenakshi
- A02Uploaded bysundarmeenakshi
- Minkowski Island ProjectUploaded bysundarmeenakshi
- Lecture 6 - Induction MotorsUploaded byswamy_satya20004521
- Hfss TutorialUploaded byRizwan Ahmed
- 1Uploaded bysundarmeenakshi
- CadenceTutorial_EE245_v3[1]Uploaded bysundarmeenakshi
- 222A Midterm ExamUploaded bysundarmeenakshi

- Parameterizing Curves SurfacesUploaded byAdnaan Mukadam
- Estimation and Calculation of the Mean Radiant TemperatureUploaded byJavier Barona
- Arkadiusz Jadczyk - Conformally Compactified Minkowski Space Myths and FactsUploaded byarkajad
- Case Study (FULL)Uploaded byYan Teng
- Approximate Methods For Multi-Dof And Continuous SystemsUploaded byPranay Waghmare
- Jurnal Elsevier Mineral BiokimiaUploaded byledikimetzerona
- On the Mystery of Time by Dr. Raju Chidambaram and Dr. Shobha ChidambaramUploaded bynarayananh
- LagnaUploaded byparand2003
- Methods in Environmental Analysis III_ElectrogravimetryUploaded byseysea
- 0-2 Particle Theory of MatterUploaded byapi-3734333
- Solution combustion synthesis, energy and environment: Best parameters for better materialUploaded byBFC
- Two Physical PhenomenaUploaded byjosenaranjo
- Summer 2014Uploaded byMichael Lo
- astm A 977Uploaded bydjfredito
- Expt. No.5 Petrol EngineUploaded bySamiksha Giri
- 13. COASTLAB12 (2012)Uploaded byAnonymous 6bKfDkJmKe
- Circuito integrado 5552334Uploaded bycicerodeluca
- Chapter 1 - IntroUploaded byAnonymous dh6DIT
- Mathcad - Example 2_2 Finite Heat ReleaseUploaded byQuinn Straub
- Usp BalancesUploaded byApoloTrevino
- thermochemistry unit planUploaded byapi-305861489
- Preparation of Urea Formaldehyde ResinUploaded byMUHAMMAD AKRAM
- Martinon-Torres - Bibliografia Archeometallurgia (1)Uploaded byMarco Tartari
- A3901-Datasheet (2)Uploaded byLêĐìnhDanh
- A single hidden layer feedforward network with only one neuron in the hidden layer can approximate any univariate functionUploaded byNamig J. Guliyev
- problems_session_3.pdfUploaded bysovval
- 08-min-normUploaded byRedion Xhepa
- Kinetic and Potential Energy WSUploaded byNheilzen Aelee Velasco Mercader
- ATCx_Irvine_2014_OS_wjd.pdfUploaded byAngela
- El Magnetic Force in Induction HeatingUploaded byHassan Ali Al Ssadi