v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

Size: px
Start display at page:

Download "v a 1 b 1 i, a 2 b 2 i,..., a n b n i."

Transcription

1 SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are real numbers. A complex vector space s one n whch the scalars are complex numbers. Thus, f v 1, v 2,..., v m are vectors n a complex vector space, then a lnear combnaton s of the form where the scalars c are complex numbers. The complex verson of R n 1, c 2,..., c s the complex vector space m consstng of ordered n-tuples of complex numbers. Thus, a vector n has the form c 1 v 1 c 2 v 2 It s also convenent to represent vectors n v a 1 b 1 a 2 b 2. a n b n. c m v m v a 1 b 1, a 2 b 2,..., a n b n. by column matrces of the form As wth R n, the operatons of addton and scalar multplcaton n are performed component by component. EXAMPLE 1 Vector Operatons n Let v 1 2, 3 and u 2, 4 be vectors n the complex vector space C 2, and determne the followng vectors. (a) v u (b) 2 v (c) 3v 5 u Soluton (a) In column matrx form, the sum v u s 1 2 v u (b) Snce and 2 3 7, we have 2 v 2 1 2, 3 5, 7. (c) 3v 5 u 3 1 2, 3 5 2, 4 (c) 3 6, , 2 4 (c) 12, 11

2 456 CHAPTER 8 COMPLEX VECTOR SPACES Many of the propertes of R n are shared by. For nstance, the scalar multplcatve dentty s the scalar 1 and the addtve dentty n s,,,...,. The standard bass for s smply e 1 1,,,..., e 2, 1,,...,.. e n,,,..., 1 R n whch s the standard bass for. Snce ths bass contans n vectors, t follows that the dmenson of s n. Other bases exst; n fact, any lnearly ndependent set of n vectors n can be used, as we demonstrate n Example 2. EXAMPLE 2 Verfyng a Bass Show that v 1 v 2 v 3 S,,,,,,,, s a bass for C 3. Soluton Snce C 3 has a dmenson of 3, the set v 1, v 2, v 3 wll be a bass f t s lnearly ndependent. To check for lnear ndependence, we set a lnear combnaton of the vectors n S equal to as follows. c 1,, c 2, c 2,,, c 3,, Ths mples that { { { c 1 c 2 c 2 c 3. c 1 v 1 c 2 v 2 c 3 v 3,, c 1 c 2, c 2, c 3,, Therefore, c 1 c 2 c 3, and we conclude that v 1, v 2, v 3 s lnearly ndependent. EXAMPLE 3 Representng a Vector n by a Bass Use the bass S n Example 2 to represent the vector v 2,, 2.

3 SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 457 Soluton By wrtng v c 1 v 1 c 2 v 2 c 3 v 3 c 1 c 2, c 2, c 3 2,, 2 we obtan c 1 c 2 2 c 2 c 3 2 whch mples that c 2 1 and c and Therefore, c 3 2 v 1 2 v 1 v v Try verfyng that ths lnear combnaton yelds 2,, 2. Other than, there are several addtonal examples of complex vector spaces. For nstance, the set of m n complex matrces wth matrx addton and scalar multplcaton forms a complex vector space. Example 4 descrbes a complex vector space n whch the vectors are functons. EXAMPLE 4 The Space of Complex-Valued Functons Consder the set S of complex-valued functons of the form where and are real-valued functons of a real varable. The set of complex numbers form the scalars for S and vector addton s defned by It can be shown that S, scalar multplcaton, and vector addton form a complex vector space. For nstance, to show that S s closed under scalar multplcaton, we let c a b be a complex number. Then s n S. f x) f 1 x f 2 x f 1 f 2 f x g x f 1 x f 2 x g 1 (x g 2 x f 1 x g 1 x f 2 x g 2 x. cf x a b f 1 x f 2 x af 1 x bf 2 x bf 1 x af 2 x

4 458 CHAPTER 8 COMPLEX VECTOR SPACES The defnton of the Eucldean nner product n s smlar to that of the standard dot product n R n, except that here the second factor n each term s a complex conjugate. Defnton of Eucldean Inner Product n Let u and v be vectors n. The Eucldean nner product of u and v s gven by u v u 1 v 1 u 2 v 2 u n v n. REMARK: Note that f u and v happen to be real, then ths defnton agrees wth the standard nner (or dot) product n R n. EXAMPLE 5 Fndng the Eucldean Inner Product n C 3 Soluton Determne the Eucldean nner product of the vectors u 2,, 4 5 and v 1, 2,. u v u 1 v 1 u 2 v 2 u 3 v Several propertes of the Eucldean nner product are stated n the followng theorem. Theorem 8.7 Propertes of the Eucldean Inner Product Let u, v, and w be vectors n and let k be a complex number. Then the followng propertes are true. 1. u v v u 2. u v w u w v w 3. ku v k u v 4. u kv k u v 5. u u 6. u u f and only f u. Proof We prove the frst property and leave the proofs of the remanng propertes to you. Let u u 1, u 2,..., u n and v v 1, v 2,..., v n. Then v u v 1 u 1 v 2 u 2... v n u n v 1 u 1 v 2 u 2... v n u n v 1 u 1 v 2 u 2... v n u n

5 SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 459 u 1 v 1 u 2 v 2 u v. u n v n We now use the Eucldean nner product n to defne the Eucldean norm (or length) of a vector n and the Eucldean dstance between two vectors n. Defnton of Norm The Eucldean norm (or length) of u n s denoted by u and s and Dstance n u u u 1 2. The Eucldean dstance between u and v s d u, v u v. The Eucldean norm and dstance may be expressed n terms of components as u u 1 2 u 2 2 u n d u, v u 1 v 1 2 u 2 v 2 2 u n v n EXAMPLE 6 Fndng the Eucldean Norm and Dstance n Determne the norms of the vectors u 2,, 4 5 and and fnd the dstance between u and v. v 1, 2, Soluton The norms of u and v are gven as follows. u u 1 2 u 2 2 u v v 1 2 v 2 2 v The dstance between u and v s gven by d u, v u v 1, 2,

6 46 CHAPTER 8 COMPLEX VECTOR SPACES Complex Inner Product Spaces The Eucldean nner product s the most commonly used nner product n. However, on occason t s useful to consder other nner products. To generalze the noton of an nner product, we use the propertes lsted n Theorem 8.7. Defnton of a Complex Inner Product Let u and v be vectors n a complex vector space. A functon that assocates wth u and v the complex number u, v s called a complex nner product f t satsfes the followng propertes. 1. u, v v, u 2. u v, w u, w v, w 3. ku, v k u, v 4. u, u and u, u f and only f u. A complex vector space wth a complex nner product s called a complex nner product space or untary space. EXAMPLE 7 A Complex Inner Product Space Let u u and be vectors n the complex space C 2 1, u 2 v v 1, v 2. Show that the functon defned by u, v u 1 v 1 2u 2 v 2 s a complex nner product. Soluton We verfy the four propertes of a complex nner product as follows. 1. v, u v 1 u 1 2v 2 u 2 u 1 v 1 2u 2 v 2 u, v 2. u v, w u 1 v 1 w 1 2 u 2 v 2 w 2 u 1 w 1 2u 2 w 2 v 1 w 1 2v 2 w 2 u, w v, w 3. ku, v ku 1 v 1 2 ku 2 v 2 k u 1 v 1 2u 2 v 2 k u, v 4. u, u u 1 u 1 2u 2 u 2 u u 2 2 Moreover, u, u f and only f u 1 u 2. Snce all propertes hold, u, v s a complex nner product.

7 SECTION 8.4 EXERCISES 461 SECTION 8.4 EXERCISES In Exercses 1 8, perform the ndcated operaton usng u, 3, v 2, 3, and w 4, u 2. 4w w 4. v 3w 5. u 2 v v 2 2 w 7. u v 2w 8. 2v 3 w u In Exercses 9 12, determne whether S s a bass for. 9. S 1,,, 1 1. S 1,,, S,,,,,,,, S 1,, 1, 2,, 1, 1, 1, 1 In Exercses 13 16, express v as a lnear combnaton of the followng bass vectors. (a),,,,,,,, (b) 1,,, 1, 1,,,, v 1, 2, 14. v 1, 1, v, 2, v,, In Exercses 17 24, determne the Eucldean norm of v. 17. v, 18. v 1, 19. v 3 6, 2 2. v 2 3, v 1, 2, 22. v,, In Exercses 25 3, determne the Eucldean dstance between u and v v 1 2,, 3, 1 v 2, 1, 2, 4 u 1,, v, u 2, 4,, v 2, 4, u, 2, 3, v, 1, u 2, 2,, v,, u 1,, v, 1 u 1, 2, 1, 2, v, 2,, 2 In Exercses 31 34, determne whether the set of vectors s lnearly ndependent or lnearly dependent ,,, , 1, 1,,, 1, 2, 1, 33. 1,, 1,,,,,, , 1,, 1,,,, 1, 1 In Exercses 35 38, determne whether the gven functon s a complex nner product, where u u 1, u 2 and v v 1, v u, v 4u 1 v 1 6u 2 v u, v u 1 v 1 u 2 v Let v 1,, and v 2,,. If v 3 z 1, z 2, z 3 and the set {v 1, v 2, v 3 } s not a bass for C 3, what does ths mply about z 1, z 2, and z 3? 4. Let v 1,, and v 2 1,, 1. Determne a vector v 3 such that v s a bass for C 3 1, v 2, v 3. In Exercses 41 45, prove the gven property where u, v, and w are vectors n and k s a complex number. 41. u v w u w v w u kv k u v u u f and only f u. 46. Let u, v be a complex nner product and k a complex number. How are u, v and u, kv related? In Exercses 47 and 48, determne the lnear transformaton T : C m that has the gven characterstcs In Exercses 49 52, the lnear transformaton T : C m s gven by T v Av. Fnd the mage of v and the premage of w u, v u 1 u 2 v 2 u, v u 1 v 1 2 u 2 v 2 T 1, 2, 1, T, 1, T, ) 2, 1, T,, A 1 A A 1 A, v 1 1, v , v 1, w 1 1 2, v 5 1, w 1 1 1, w 2 2, w 2 3 ku) u v k u v u 53. Fnd the kernel of the lnear transformaton gven n Exercse 49.

8 462 CHAPTER 8 COMPLEX VECTOR SPACES 54. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng matrces. A 1 T 1 and T 2 A T 2 T T 1 T Determne whch of the followng sets are subspaces of the vector space of 2 2 complex matrces. (a) The set of 2 2 symmetrc matrces. (b) The set of 2 2 matrces A satsfyng A T A. (c) The set of 2 2 matrces n whch all entres are real. (d) The set of 2 2 dagonal matrces. 58. Determne whch of the followng sets are subspaces of the vector space of complex-valued functons (see Example 4). (a) The set of all functons f satsfyng f. (b) The set of all functons f satsfyng f 1. (c) The set of all functons f satsfyng f f. 8.5 UNITARY AND HERMITIAN MATRICES Problems nvolvng dagonalzaton of complex matrces, and the assocated egenvalue problems, requre the concept of untary and Hermtan matrces. These matrces roughly correspond to orthogonal and symmetrc real matrces. In order to defne untary and Hermtan matrces, we frst ntroduce the concept of the conjugate transpose of a complex matrx. Defnton of the Conjugate Transpose of a Complex Matrx The conjugate transpose of a complex matrx A, denoted by A*, s gven by A* A T where the entres of A are the complex conjugates of the correspondng entres of A. Note that f A s a matrx wth real entres, then A* A T. To fnd the conjugate transpose of a matrx, we frst calculate the complex conjugate of each entry and then take the transpose of the matrx, as shown n the followng example. EXAMPLE 1 Fndng the Conjugate Transpose of a Complex Matrx Determne A* for the matrx A

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

where the coordinates are related to those in the old frame as follows.

where the coordinates are related to those in the old frame as follows. Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product

More information

PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada [email protected] Abstract Ths s a note to explan support vector machnes.

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem. Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set

More information

L10: Linear discriminants analysis

L10: Linear discriminants analysis L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

How To Assemble The Tangent Spaces Of A Manfold Nto A Coherent Whole

How To Assemble The Tangent Spaces Of A Manfold Nto A Coherent Whole CHAPTER 7 VECTOR BUNDLES We next begn addressng the queston: how do we assemble the tangent spaces at varous ponts of a manfold nto a coherent whole? In order to gude the decson, consder the case of U

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

Ring structure of splines on triangulations

Ring structure of splines on triangulations www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

More information

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2) MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching) Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton

More information

The Distribution of Eigenvalues of Covariance Matrices of Residuals in Analysis of Variance

The Distribution of Eigenvalues of Covariance Matrices of Residuals in Analysis of Variance JOURNAL OF RESEARCH of the Natonal Bureau of Standards - B. Mathem atca l Scence s Vol. 74B, No.3, July-September 1970 The Dstrbuton of Egenvalues of Covarance Matrces of Resduals n Analyss of Varance

More information

AN EFFECTIVE MATRIX GEOMETRIC MEAN SATISFYING THE ANDO LI MATHIAS PROPERTIES

AN EFFECTIVE MATRIX GEOMETRIC MEAN SATISFYING THE ANDO LI MATHIAS PROPERTIES MATHEMATICS OF COMPUTATION Volume, Number, Pages S 5-578(XX)- AN EFFECTIVE MATRIX GEOMETRIC MEAN SATISFYING THE ANDO LI MATHIAS PROPERTIES DARIO A. BINI, BEATRICE MEINI AND FEDERICO POLONI Abstract. We

More information

Matrix Multiplication I

Matrix Multiplication I Matrx Multplcaton I Yuval Flmus February 2, 2012 These notes are based on a lecture gven at the Toronto Student Semnar on February 2, 2012. The materal s taen mostly from the boo Algebrac Complexty Theory

More information

Generalizing the degree sequence problem

Generalizing the degree sequence problem Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts

More information

NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582

NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582 NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582 7. Root Dynamcs 7.2 Intro to Root Dynamcs We now look at the forces requred to cause moton of the root.e. dynamcs!!

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2016. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

PRACTICE 1: MUTUAL FUNDS EVALUATION USING MATLAB.

PRACTICE 1: MUTUAL FUNDS EVALUATION USING MATLAB. PRACTICE 1: MUTUAL FUNDS EVALUATION USING MATLAB. INDEX 1. Load data usng the Edtor wndow and m-fle 2. Learnng to save results from the Edtor wndow. 3. Computng the Sharpe Rato 4. Obtanng the Treynor Rato

More information

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing Complng for Parallelsm & Localty Dependence Testng n General Assgnments Deadlne for proect 4 extended to Dec 1 Last tme Data dependences and loops Today Fnsh data dependence analyss for loops General code

More information

Chapter 7 Symmetry and Spectroscopy Molecular Vibrations p. 1 -

Chapter 7 Symmetry and Spectroscopy Molecular Vibrations p. 1 - Chapter 7 Symmetry and Spectroscopy Molecular Vbratons p - 7 Symmetry and Spectroscopy Molecular Vbratons 7 Bases for molecular vbratons We nvestgate a molecule consstng of N atoms, whch has 3N degrees

More information

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: [email protected] Nanyng Yang School of Mathematcs

More information

Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering

Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering Out-of-Sample Extensons for LLE, Isomap, MDS, Egenmaps, and Spectral Clusterng Yoshua Bengo, Jean-Franços Paement, Pascal Vncent Olver Delalleau, Ncolas Le Roux and Mare Oumet Département d Informatque

More information

Point cloud to point cloud rigid transformations. Minimizing Rigid Registration Errors

Point cloud to point cloud rigid transformations. Minimizing Rigid Registration Errors Pont cloud to pont cloud rgd transformatons Russell Taylor 600.445 1 600.445 Fall 000-014 Copyrght R. H. Taylor Mnmzng Rgd Regstraton Errors Typcally, gven a set of ponts {a } n one coordnate system and

More information

Fisher Markets and Convex Programs

Fisher Markets and Convex Programs Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and

More information

Level Annuities with Payments Less Frequent than Each Interest Period

Level Annuities with Payments Less Frequent than Each Interest Period Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Symoblc approach

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of

More information

HÜCKEL MOLECULAR ORBITAL THEORY

HÜCKEL MOLECULAR ORBITAL THEORY 1 HÜCKEL MOLECULAR ORBITAL THEORY In general, the vast maorty polyatomc molecules can be thought of as consstng of a collecton of two electron bonds between pars of atoms. So the qualtatve pcture of σ

More information

Regression Models for a Binary Response Using EXCEL and JMP

Regression Models for a Binary Response Using EXCEL and JMP SEMATECH 997 Statstcal Methods Symposum Austn Regresson Models for a Bnary Response Usng EXCEL and JMP Davd C. Trndade, Ph.D. STAT-TECH Consultng and Tranng n Appled Statstcs San Jose, CA Topcs Practcal

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

Software Alignment for Tracking Detectors

Software Alignment for Tracking Detectors Software Algnment for Trackng Detectors V. Blobel Insttut für Expermentalphysk, Unverstät Hamburg, Germany Abstract Trackng detectors n hgh energy physcs experments requre an accurate determnaton of a

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

More information

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt. Chapter 9 Revew problems 9.1 Interest rate measurement Example 9.1. Fund A accumulates at a smple nterest rate of 10%. Fund B accumulates at a smple dscount rate of 5%. Fnd the pont n tme at whch the forces

More information

Logistic Regression. Steve Kroon

Logistic Regression. Steve Kroon Logstc Regresson Steve Kroon Course notes sectons: 24.3-24.4 Dsclamer: these notes do not explctly ndcate whether values are vectors or scalars, but expects the reader to dscern ths from the context. Scenaro

More information

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz

More information

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

Conversion between the vector and raster data structures using Fuzzy Geographical Entities Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,

More information

LECTURE 1: MOTIVATION

LECTURE 1: MOTIVATION LECTURE 1: MOTIVATION STEVEN SAM AND PETER TINGLEY 1. Towards quantum groups Let us begn by dscussng what quantum groups are, and why we mght want to study them. We wll start wth the related classcal objects.

More information

The Noether Theorems: from Noether to Ševera

The Noether Theorems: from Noether to Ševera 14th Internatonal Summer School n Global Analyss and Mathematcal Physcs Satellte Meetng of the XVI Internatonal Congress on Mathematcal Physcs *** Lectures of Yvette Kosmann-Schwarzbach Centre de Mathématques

More information

How To Calculate The Accountng Perod Of Nequalty

How To Calculate The Accountng Perod Of Nequalty Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

Comparison of Control Strategies for Shunt Active Power Filter under Different Load Conditions

Comparison of Control Strategies for Shunt Active Power Filter under Different Load Conditions Comparson of Control Strateges for Shunt Actve Power Flter under Dfferent Load Condtons Sanjay C. Patel 1, Tushar A. Patel 2 Lecturer, Electrcal Department, Government Polytechnc, alsad, Gujarat, Inda

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence 1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh

More information

Sngle Snk Buy at Bulk Problem and the Access Network

Sngle Snk Buy at Bulk Problem and the Access Network A Constant Factor Approxmaton for the Sngle Snk Edge Installaton Problem Sudpto Guha Adam Meyerson Kamesh Munagala Abstract We present the frst constant approxmaton to the sngle snk buy-at-bulk network

More information

I. INTRODUCTION. 1 IRCCyN: UMR CNRS 6596, Ecole Centrale de Nantes, Université de Nantes, Ecole des Mines de Nantes

I. INTRODUCTION. 1 IRCCyN: UMR CNRS 6596, Ecole Centrale de Nantes, Université de Nantes, Ecole des Mines de Nantes he Knematc Analyss of a Symmetrcal hree-degree-of-freedom lanar arallel Manpulator Damen Chablat and hlppe Wenger Insttut de Recherche en Communcatons et Cybernétque de Nantes, rue de la Noë, 442 Nantes,

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna [email protected] Abstract.

More information

O(n) mass matrix inversion for serial manipulators and polypeptide chains using Lie derivatives Kiju Lee, Yunfeng Wang and Gregory S.

O(n) mass matrix inversion for serial manipulators and polypeptide chains using Lie derivatives Kiju Lee, Yunfeng Wang and Gregory S. Robotca 7) volume 5, pp 739 75 7 Cambrdge Unversty Press do:7/s6357477385 Prnted n the Unted Kngdom On) mass matrx nverson for seral manpulators and polypeptde chans usng Le dervatves Ku Lee, Yunfeng Wang

More information

On the Solution of Indefinite Systems Arising in Nonlinear Optimization

On the Solution of Indefinite Systems Arising in Nonlinear Optimization On the Soluton of Indefnte Systems Arsng n Nonlnear Optmzaton Slva Bonettn, Valera Ruggero and Federca Tnt Dpartmento d Matematca, Unverstà d Ferrara Abstract We consder the applcaton of the precondtoned

More information

FINITE HILBERT STABILITY OF (BI)CANONICAL CURVES

FINITE HILBERT STABILITY OF (BI)CANONICAL CURVES FINITE HILBERT STABILITY OF (BICANONICAL CURVES JAROD ALPER, MAKSYM FEDORCHUK, AND DAVID ISHII SMYTH* To Joe Harrs on hs sxteth brthday Abstract. We prove that a generc canoncally or bcanoncally embedded

More information

The Mathematical Derivation of Least Squares

The Mathematical Derivation of Least Squares Pscholog 885 Prof. Federco The Mathematcal Dervaton of Least Squares Back when the powers that e forced ou to learn matr algera and calculus, I et ou all asked ourself the age-old queston: When the hell

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

21 Vectors: The Cross Product & Torque

21 Vectors: The Cross Product & Torque 21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

Multiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers

Multiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers Multplcaton Algorthms for Radx- RN-Codngs and Two s Complement Numbers Jean-Luc Beuchat Projet Arénare, LIP, ENS Lyon 46, Allée d Itale F 69364 Lyon Cedex 07 [email protected] Jean-Mchel Muller

More information

SIMPLE LINEAR CORRELATION

SIMPLE LINEAR CORRELATION SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Efficient Project Portfolio as a tool for Enterprise Risk Management

Efficient Project Portfolio as a tool for Enterprise Risk Management Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse

More information

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant

More information

Research Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization

Research Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Politecnico di Torino. Porto Institutional Repository

Politecnico di Torino. Porto Institutional Repository Poltecnco d orno Porto Insttutonal Repostory [Proceedng] rbt dynamcs and knematcs wth full quaternons rgnal Ctaton: Andres D; Canuto E. (5). rbt dynamcs and knematcs wth full quaternons. In: 16th IFAC

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM BARRIOT Jean-Perre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: [email protected] 1/Introducton The

More information

Supply network formation as a biform game

Supply network formation as a biform game Supply network formaton as a bform game Jean-Claude Hennet*. Sona Mahjoub*,** * LSIS, CNRS-UMR 6168, Unversté Paul Cézanne, Faculté Sant Jérôme, Avenue Escadrlle Normande Némen, 13397 Marselle Cedex 20,

More information

copyright 1997 Bruce A. McCarl and Thomas H. Spreen.

copyright 1997 Bruce A. McCarl and Thomas H. Spreen. Appendx I: Usng Summaton Notaton Wth GAMS... AI-1 AI.1 Summaton Mechancs... AI-1 AI.1.1 Sum of an Item.... AI-1 AI.1.2 Multple Sums... AI-2 AI.1.3 Sum of Two Items... AI-2 AI.2 Summaton Notaton Rules...

More information

Consider a 1-D stationary state diffusion-type equation, which we will call the generalized diffusion equation from now on:

Consider a 1-D stationary state diffusion-type equation, which we will call the generalized diffusion equation from now on: Chapter 1 Boundary value problems Numercal lnear algebra technques can be used for many physcal problems. In ths chapter we wll gve some examples of how these technques can be used to solve certan boundary

More information

Lecture 2 Sequence Alignment. Burr Settles IBS Summer Research Program 2008 [email protected] www.cs.wisc.edu/~bsettles/ibs08/

Lecture 2 Sequence Alignment. Burr Settles IBS Summer Research Program 2008 bsettles@cs.wisc.edu www.cs.wisc.edu/~bsettles/ibs08/ Lecture 2 Sequence lgnment Burr Settles IBS Summer Research Program 2008 [email protected] www.cs.wsc.edu/~bsettles/bs08/ Sequence lgnment: Task Defnton gven: a par of sequences DN or proten) a method

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Finite Math Chapter 10: Study Guide and Solution to Problems

Finite Math Chapter 10: Study Guide and Solution to Problems Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

POLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and

POLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n

More information

Section 5.4 Annuities, Present Value, and Amortization

Section 5.4 Annuities, Present Value, and Amortization Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

More information

COLLOQUIUM MATHEMATICUM

COLLOQUIUM MATHEMATICUM COLLOQUIUM MATHEMATICUM VOL. 74 997 NO. TRANSFERENCE THEORY ON HARDY AND SOBOLEV SPACES BY MARIA J. CARRO AND JAVIER SORIA (BARCELONA) We show that the transference method of Cofman and Wess can be extended

More information

Using Series to Analyze Financial Situations: Present Value

Using Series to Analyze Financial Situations: Present Value 2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

Chapter 7: Answers to Questions and Problems

Chapter 7: Answers to Questions and Problems 19. Based on the nformaton contaned n Table 7-3 of the text, the food and apparel ndustres are most compettve and therefore probably represent the best match for the expertse of these managers. Chapter

More information

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004 OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL Thomas S. Ferguson and C. Zachary Glsten UCLA and Bell Communcatons May 985, revsed 2004 Abstract. Optmal nvestment polces for maxmzng the expected

More information

Availability-Based Path Selection and Network Vulnerability Assessment

Availability-Based Path Selection and Network Vulnerability Assessment Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl

More information

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan

More information

Learning from Multiple Outlooks

Learning from Multiple Outlooks Learnng from Multple Outlooks Maayan Harel Department of Electrcal Engneerng, Technon, Hafa, Israel She Mannor Department of Electrcal Engneerng, Technon, Hafa, Israel [email protected] [email protected]

More information

ON THE ACCURACY, REPEATABILITY, AND DEGREE OF INFLUENCE OF KINEMATICS PARAMETERS FOR INDUSTRIAL ROBOTS

ON THE ACCURACY, REPEATABILITY, AND DEGREE OF INFLUENCE OF KINEMATICS PARAMETERS FOR INDUSTRIAL ROBOTS Internatonal Journal of Modellng and Smulaton, Vol. 22, No. 3, 2002 ON THE ACCURACY, REPEATABILITY, AND DEGREE OF INFLUENCE OF KINEMATICS PARAMETERS FOR INDUSTRIAL ROBOTS P.S. Shakolas, K.L. Conrad, and

More information