6, Eigenvalues and Eigenvectors. = λx,
|
|
- Janel Todd
- 5 years ago
- Views:
Transcription
1 6, Eigenvalues and Eigenvectors The eigenvalue/eigenvector of an N N matrix A are defined as a scalar λ and a nonzero vector v satisfying A x = λx, (A λi)v =, (v ). the matrix [A λi] should be sigular, its determinant should be zero det(a λi) =, the determinant of the matrix [A λi] is a polynomial of degree N in terms of λ. IPT-526, Spring 26 p./25
2 Eigenvalues and Eigenvectors. find the eigenvalue λ s by solving the characteristic equation, A λi = λ N + a N λ N + + a λ + a =, 2. then substitute the λ i s, one by one, into (A λi)v =, to solve it for the eigenvector v i s. IPT-526, Spring 26 p.2/25
3 Scaled power method: Largest magnitude Suppose all of the eigenvalues of an N N matrix A are distinct with the magnitudes, λ > λ 2 λ 3 λ N. For any initial vector x, such as x = [ ], consequently, any initial vector x can be expressed as a linear combination of the eigenvecotrs, For Av n = λ n v n,we have x = α v + α 2 v α N v N. Ax = α λ v + α 2 λ 2 v α N λ N v N = λ (α v + α 2 λ 2 λ v α N λ N λ v N ), IPT-526, Spring 26 p.3/25
4 Scaled power method: Largest magnitude repeat this multiplication over and over again to obtain, x k = A k x = λ k (α v + α 2 ( λ 2 λ ) k v α N ( λ N λ ) k v N ) λ k α v, we must keep scaling before multiplying at every iteration to prevent the overflow or underflow, where x = Max{ x n }. x k+ = A x k x k λ v v, IPT-526, Spring 26 p.4/25
5 Inverse power method: smallest magnitude If the matrix is nonsigular A, then A x = λx, A x = λ x, this implies that the inverse matrix A has the eigenvalues that are the reciprocals of the eigenvalues of the original matrix A, but with the same eigenvectors. we can apply the scaled power method for the eigenvalues with largest magnitude, λ N = the largest eigenvalue of A, to find the smallest (magnitude) eigenvalue λ N. IPT-526, Spring 26 p.5/25
6 Shifted inverse power method To find the eigenvalue that is not necessarily of the largest or smallest magnitude, we substract the eigenvalue equation by sv (s is a number that does not happen to equal any eigenvalue,) A x = λx, [A si]x = (λ s)x, this implies that (λ s) is the eigenvalue of [A si], we apply the inverse power method to get its smallest magnitude eigenvalue, then we add s to obtain the eigenvalue of the original matrix A which is closest to the number s, λ N = the largest eigenvalue of [A si] + s, to find the smallest (magnitude) eigenvalue λ N. IPT-526, Spring 26 p.6/25
7 Eigenpackages of Canned eigenroutines LAPACK: Linear Algebra Package EISPACK: Matrix Eigensystem Routines IMSL: Visual Numerics NAG: Numerical Algorithms Group IPT-526, Spring 26 p.7/25
8 Eigenpackages of Canned eigenroutines all eigenvalues and no eigenvectors, all eigenvalues and some corresponding eigenvectors, all eigenvalues and all corresponding eigenvectors, real, symmetric, tridiagonal, real, symmetric, banded, real, symmetric, full, real nonsymmetric, complex, Hermitian, complex, non-hermitian. IPT-526, Spring 26 p.8/25
9 Gap solitons in optical lattices -D Gross-Pitaevskii equation with periodic potentials, V (x) = V sin 2 (k x), i t Φ (t, x) = 2 2 x 2 Φ (t, x) + V (x)φ (t, x) + g D Φ (t, x) 2 Φ (t, x) which has gap soliton solutions. 2 2 (a) 8 c - (b) P 6 4 b - (c) 2 a µ X by FS + NK methods, N x = 52, no. of iterations < ; gpeol.m. R.-K. Lee, E. A. Ostrovskaya, Yu. S. Kivshar, and Y. Lai, Phys. Rev. A 72, 3367 (25). IPT-526, Spring 26 p.9/25
10 Band-Gap spectrum -D Gross-Pitaevskii equation with periodic potentials, V (x) = V sin 2 (k x), i t Φ (t, x) = 2 2 x 2 Φ (t, x) + V (x)φ (t, x) + g D Φ (t, x) 2 Φ (t, x). For the stationary solution, Φ (t, x) = φ(x)exp( iµt), one have time-independent GP equation, 2 d 2 φ dx 2 [V sin 2 (Kx)φ µφ] g D φ 2 φ =. For the linear case (non-interacting condensate), g D =, 2 d 2 φ [2q cos(2y) p]φ =, dy2 where y = Kx, q = V /(2K 2 ), and p = 2(q + µ/k 2 ), which is the Mathieu s equation. IPT-526, Spring 26 p./25
11 Mathieu equation Mathieu equation: u xx + 2q cos(2x)u = λu, λ q IPT-526, Spring 26 p./25
12 Nonlinear band structure for BEC in OL 2 d 2 φ dx 2 [V sin 2 (Kx)φ µφ] σ φ 2 φ =. M. Machholm et al., Phys. Rev. A 67, 5363 (23). IPT-526, Spring 26 p.2/25
13 Bragg reflectors A B A B A B A B Transmission δ (/cm) Nobel laureates William Henry Bragg and William Lawrence Bragg in 95, for their contribution to the X-ray diffraction analysis (Bragg diffraction). IPT-526, Spring 26 p.3/25
14 Photonic Bandgap Crystals: two(high)-dimension a =.45 2r =.5 d =.45 l =. n c = Transmittance [db] # of layers = Normalized Frequency ωa/2πc IPT-526, Spring 26 p.4/25
15 Band diagram and Density of States Frequency (ωd/2πc) M Γ X M DOS (A.U.) x 4 IPT-526, Spring 26 p.5/25
16 Photonic Bandgap Crystals:point-defect (localized field) Transmittance [db] Normalized Frequency ω a/2πc IPT-526, Spring 26 p.6/25
17 Photonic Bandgap Crystals:line-defects Courtesy: Bin-Shei Lin IPT-526, Spring 26 p.7/25
18 Maxwell equations For a linear, isotropic nondispersive material, B = µh, D = ǫe. magnetic conduction current: J m = ρ H. electric conduction current: Then the Maxwell s curl equations becom J e = σe. t H = µ E ρ µ H t E = ǫ H σ ǫ E. IPT-526, Spring 26 p.8/25
19 For a periodic structure, Periodic structrures D(r,t) = ǫ ǫ(r)e(r,t) the periodicity of ǫ(r) implies ǫ(r + a i ) = ǫ(r), (i =, 2, 3). then the Maxwell equations become, {ǫ(r)e(r,t)} =, H(r,t) =, E(r,t) = µ t H(r,t), H(r,t) = ǫ ǫ(r) t E(r,t). IPT-526, Spring 26 p.9/25
20 Wave equations and plane wave expansion then one can obtain the wave equations, ǫ(r) { E(r, t)} = 2 c 2 E(r, t), t2 { ǫ(r) H(r, t)} = 2 c 2 H(r, t), t2 use plane wave solution as basis, E(r, t) = E(r)e iωt, H(r, t) = H(r)e iωt, then the wave equations become the eigenvalue equations, L E E(r) = ǫ(r) L H H(r) = { ǫ(r) ω2 { E(r, t)} = E(r, t), c2 ω2 H(r, t)} = H(r, t), c2 IPT-526, Spring 26 p.2/25
21 Brillouin zone For a wave vector k in the first Brillouin zone and a band index n, we can express the field as, E(r) = E kn (r) = u kn (r)e ik r, where u kn (r) is a periodic function satisfying, u kn (r + a i ) = u kn (r). only consider the E-field in two-dimensional space, ǫ(r) { E(r)} = ω2 c 2 E(r), which can be reduced to L (2) E E z(r) = ǫ(r) { 2 x y 2 }E z(r) = ω2 c 2 E(r), IPT-526, Spring 26 p.2/25
22 Brillouin zone apply Bloch s theorem, E z (r) = E z,kn (r) = G E z,kn (G)exp{i(k + G) r}, wher k and G are the reciprocal lattice vector in two dimensions, G = l b + l 2 b 2, where a i b j = 2πδ ij and {l i } are arbitrary integers. the final eigenvalue equation to solve is, ǫ(g G ) k + G 2 E z,kn (G ) = ω2 kn c E z,kn(g ). 2 G IPT-526, Spring 26 p.22/25
23 Band diagram and Density of States ω2 { E(r)} = ǫ(r) c E(r), Frequency (ωd/2πc) M Γ X M DOS (A.U.) x 4 IPT-526, Spring 26 p.23/25
24 Laplacian equation in a disk Eigenmodes of Laplacian equations, [ 2 x x 2 ]u(x, y) = λf(x, y). Mode λ =. Mode 3 λ = Mode 6 λ = Mode λ = L. N. Trefethen, Spectral methods in Matlab, SIAM (2). IPT-526, Spring 26 p.24/25
25 Nonlinear eigenvalue problems For example, (Aλ 2 + Bλ + C) x =, introduce an additional unkown eigenvector y and solve the 2N 2N eigensystem, x = λ x A C A B y y This technique generalizes to higher-order polynomials in λ. Apolynomial of degree M produces a linear MN MN eigensystem. IPT-526, Spring 26 p.25/25
Computational Methods for Optoelectronics
IPT 526 Computational Methods for Optoelectronics Ray-Kuang Lee Department of Electrical Engineering and Institute of Photonics Technologies National Tsing-Hua University, Hsinchu, Taiwan e-mail: rklee@ee.nthu.edu.tw
More information11.0 Introduction. An N N matrix A is said to have an eigenvector x and corresponding eigenvalue λ if. A x = λx (11.0.1)
Chapter 11. 11.0 Introduction Eigensystems An N N matrix A is said to have an eigenvector x and corresponding eigenvalue λ if A x = λx (11.0.1) Obviously any multiple of an eigenvector x will also be an
More informationLecture 10: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11)
Lecture 1: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11) The eigenvalue problem, Ax= λ x, occurs in many, many contexts: classical mechanics, quantum mechanics, optics 22 Eigenvectors and
More informationSymmetric and anti symmetric matrices
Symmetric and anti symmetric matrices In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, matrix A is symmetric if. A = A Because equal matrices have equal
More informationPH.D. PRELIMINARY EXAMINATION MATHEMATICS
UNIVERSITY OF CALIFORNIA, BERKELEY SPRING SEMESTER 207 Dept. of Civil and Environmental Engineering Structural Engineering, Mechanics and Materials NAME PH.D. PRELIMINARY EXAMINATION MATHEMATICS Problem
More informationMath 240 Calculus III
Generalized Calculus III Summer 2015, Session II Thursday, July 23, 2015 Agenda 1. 2. 3. 4. Motivation Defective matrices cannot be diagonalized because they do not possess enough eigenvectors to make
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors week -2 Fall 26 Eigenvalues and eigenvectors The most simple linear transformation from R n to R n may be the transformation of the form: T (x,,, x n ) (λ x, λ 2,, λ n x n
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationIntroduction to Condensed Matter Physics
Introduction to Condensed Matter Physics The Reciprocal Lattice M.P. Vaughan Overview Overview of the reciprocal lattice Periodic functions Reciprocal lattice vectors Bloch functions k-space Dispersion
More informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - 4 (Alberto Bressan, Spring 27) Review of complex numbers In this chapter we shall need to work with complex numbers z C These can be written in the form z = a+ib,
More informationEIGENVALUE PROBLEMS. Background on eigenvalues/ eigenvectors / decompositions. Perturbation analysis, condition numbers..
EIGENVALUE PROBLEMS Background on eigenvalues/ eigenvectors / decompositions Perturbation analysis, condition numbers.. Power method The QR algorithm Practical QR algorithms: use of Hessenberg form and
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationSection 8.2 : Homogeneous Linear Systems
Section 8.2 : Homogeneous Linear Systems Review: Eigenvalues and Eigenvectors Let A be an n n matrix with constant real components a ij. An eigenvector of A is a nonzero n 1 column vector v such that Av
More informationLast Time. Social Network Graphs Betweenness. Graph Laplacian. Girvan-Newman Algorithm. Spectral Bisection
Eigenvalue Problems Last Time Social Network Graphs Betweenness Girvan-Newman Algorithm Graph Laplacian Spectral Bisection λ 2, w 2 Today Small deviation into eigenvalue problems Formulation Standard eigenvalue
More informationElectromagnetic optics!
1 EM theory Electromagnetic optics! EM waves Monochromatic light 2 Electromagnetic optics! Electromagnetic theory of light Electromagnetic waves in dielectric media Monochromatic light References: Fundamentals
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
More informationDirect methods for symmetric eigenvalue problems
Direct methods for symmetric eigenvalue problems, PhD McMaster University School of Computational Engineering and Science February 4, 2008 1 Theoretical background Posing the question Perturbation theory
More informationChapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015
Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 205. If A is a 3 3 triangular matrix, explain why det(a) is equal to the product of entries on the diagonal. If A is a lower triangular or diagonal
More informationA computer-assisted Band-Gap Proof for 3D Photonic Crystals
A computer-assisted Band-Gap Proof for 3D Photonic Crystals Henning Behnke Vu Hoang 2 Michael Plum 2 ) TU Clausthal, Institute for Mathematics, 38678 Clausthal, Germany 2) Univ. of Karlsruhe (TH), Faculty
More informationGeneralized Eigenvectors and Jordan Form
Generalized Eigenvectors and Jordan Form We have seen that an n n matrix A is diagonalizable precisely when the dimensions of its eigenspaces sum to n. So if A is not diagonalizable, there is at least
More informationIntroduction to Optoelectronic Engineering,
EE 3130 Introduction to Optoelectronic Engineering, Ray-Kuang Lee Institute of Photonics Technologies, Department of Electrical Engineering, and Department of Physics, National Tsing-Hua University e-mail:
More informationNumerical Methods - Numerical Linear Algebra
Numerical Methods - Numerical Linear Algebra Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Numerical Linear Algebra I 2013 1 / 62 Outline 1 Motivation 2 Solving Linear
More informationMath 2331 Linear Algebra
5. Eigenvectors & Eigenvalues Math 233 Linear Algebra 5. Eigenvectors & Eigenvalues Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ Shang-Huan Chiu,
More informationMATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial.
MATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial. Geometric properties of determinants 2 2 determinants and plane geometry
More informationLinear Algebra - Part II
Linear Algebra - Part II Projection, Eigendecomposition, SVD (Adapted from Sargur Srihari s slides) Brief Review from Part 1 Symmetric Matrix: A = A T Orthogonal Matrix: A T A = AA T = I and A 1 = A T
More informationChapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1
More informationWhat s Eigenanalysis? Matrix eigenanalysis is a computational theory for the matrix equation
Eigenanalysis What s Eigenanalysis? Fourier s Eigenanalysis Model is a Replacement Process Powers and Fourier s Model Differential Equations and Fourier s Model Fourier s Model Illustrated What is Eigenanalysis?
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationSystems of Algebraic Equations and Systems of Differential Equations
Systems of Algebraic Equations and Systems of Differential Equations Topics: 2 by 2 systems of linear equations Matrix expression; Ax = b Solving 2 by 2 homogeneous systems Functions defined on matrices
More informationOverview in Images. S. Lin et al, Nature, vol. 394, p , (1998) T.Thio et al., Optics Letters 26, (2001).
Overview in Images 5 nm K.S. Min et al. PhD Thesis K.V. Vahala et al, Phys. Rev. Lett, 85, p.74 (000) J. D. Joannopoulos, et al, Nature, vol.386, p.143-9 (1997) T.Thio et al., Optics Letters 6, 197-1974
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More informationLecture Notes 6: Dynamic Equations Part C: Linear Difference Equation Systems
University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 45 Lecture Notes 6: Dynamic Equations Part C: Linear Difference Equation Systems Peter J. Hammond latest revision 2017 September
More informationHomework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9
Bachelor in Statistics and Business Universidad Carlos III de Madrid Mathematical Methods II María Barbero Liñán Homework sheet 4: EIGENVALUES AND EIGENVECTORS DIAGONALIZATION (with solutions) Year - Is
More information1. Reminder: E-Dynamics in homogenous media and at interfaces
0. Introduction 1. Reminder: E-Dynamics in homogenous media and at interfaces 2. Photonic Crystals 2.1 Introduction 2.2 1D Photonic Crystals 2.3 2D and 3D Photonic Crystals 2.4 Numerical Methods 2.4.1
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationLecture Notes: Eigenvalues and Eigenvectors. 1 Definitions. 2 Finding All Eigenvalues
Lecture Notes: Eigenvalues and Eigenvectors Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Definitions Let A be an n n matrix. If there
More informationSolutions Problem Set 8 Math 240, Fall
Solutions Problem Set 8 Math 240, Fall 2012 5.6 T/F.2. True. If A is upper or lower diagonal, to make det(a λi) 0, we need product of the main diagonal elements of A λi to be 0, which means λ is one of
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More information33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM
33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM (UPDATED MARCH 17, 2018) The final exam will be cumulative, with a bit more weight on more recent material. This outline covers the what we ve done since the
More informationEigenvalues and Eigenvectors
Chapter 1 Eigenvalues and Eigenvectors Among problems in numerical linear algebra, the determination of the eigenvalues and eigenvectors of matrices is second in importance only to the solution of linear
More informationLinear Algebra Review (Course Notes for Math 308H - Spring 2016)
Linear Algebra Review (Course Notes for Math 308H - Spring 2016) Dr. Michael S. Pilant February 12, 2016 1 Background: We begin with one of the most fundamental notions in R 2, distance. Letting (x 1,
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationCS 143 Linear Algebra Review
CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see
More informationComputational Methods CMSC/AMSC/MAPL 460. Eigenvalues and Eigenvectors. Ramani Duraiswami, Dept. of Computer Science
Computational Methods CMSC/AMSC/MAPL 460 Eigenvalues and Eigenvectors Ramani Duraiswami, Dept. of Computer Science Eigen Values of a Matrix Recap: A N N matrix A has an eigenvector x (non-zero) with corresponding
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationJordan Normal Form. Chapter Minimal Polynomials
Chapter 8 Jordan Normal Form 81 Minimal Polynomials Recall p A (x) =det(xi A) is called the characteristic polynomial of the matrix A Theorem 811 Let A M n Then there exists a unique monic polynomial q
More informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
More informationIntroduction to Condensed Matter Physics
Introduction to Condensed Matter Physics Diffraction I Basic Physics M.P. Vaughan Diffraction Electromagnetic waves Geometric wavefront The Principle of Linear Superposition Diffraction regimes Single
More informationEigenvalue Problems and Singular Value Decomposition
Eigenvalue Problems and Singular Value Decomposition Sanzheng Qiao Department of Computing and Software McMaster University August, 2012 Outline 1 Eigenvalue Problems 2 Singular Value Decomposition 3 Software
More informationEigenvalue and Eigenvector Problems
Eigenvalue and Eigenvector Problems An attempt to introduce eigenproblems Radu Trîmbiţaş Babeş-Bolyai University April 8, 2009 Radu Trîmbiţaş ( Babeş-Bolyai University) Eigenvalue and Eigenvector Problems
More informationMATH 583A REVIEW SESSION #1
MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),
More informationRecall : Eigenvalues and Eigenvectors
Recall : Eigenvalues and Eigenvectors Let A be an n n matrix. If a nonzero vector x in R n satisfies Ax λx for a scalar λ, then : The scalar λ is called an eigenvalue of A. The vector x is called an eigenvector
More informationPhotonic band structure in periodic dielectric structures
Photonic band structure in periodic dielectric structures Mustafa Muhammad Department of Physics University of Cincinnati Cincinnati, Ohio 45221 December 4, 2001 Abstract Recent experiments have found
More informationSummary of Fourier Optics
Summary of Fourier Optics Diffraction of the paraxial wave is described by Fresnel diffraction integral, u(x, y, z) = j λz dx 0 dy 0 u 0 (x 0, y 0 )e j(k/2z)[(x x 0) 2 +(y y 0 ) 2 )], Fraunhofer diffraction
More informationLinear Algebra for Machine Learning. Sargur N. Srihari
Linear Algebra for Machine Learning Sargur N. srihari@cedar.buffalo.edu 1 Overview Linear Algebra is based on continuous math rather than discrete math Computer scientists have little experience with it
More informationEigenvalue Problems. Eigenvalue problems occur in many areas of science and engineering, such as structural analysis
Eigenvalue Problems Eigenvalue problems occur in many areas of science and engineering, such as structural analysis Eigenvalues also important in analyzing numerical methods Theory and algorithms apply
More informationMATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization.
MATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization. Eigenvalues and eigenvectors of an operator Definition. Let V be a vector space and L : V V be a linear operator. A number λ
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 4 Eigenvalue Problems Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
More informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.2: Fundamentals 2 / 31 Eigenvalues and Eigenvectors Eigenvalues and eigenvectors of
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationFinite Element Methods for Optical Device Design
DFG Research Center Matheon mathematics for key technologies and Zuse Institute Berlin Finite Element Methods for Optical Device Design Frank Schmidt Sven Burger, Roland Klose, Achim Schädle, Lin Zschiedrich
More informationMatrices and Linear Algebra
Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2
More informationNumerical Methods 2: Hill s Method
Numerical Methods 2: Hill s Method Bernard Deconinck Department of Applied Mathematics University of Washington bernard@amath.washington.edu http://www.amath.washington.edu/ bernard Stability and Instability
More informationEigenvalues, Eigenvectors, and Diagonalization
Math 240 TA: Shuyi Weng Winter 207 February 23, 207 Eigenvalues, Eigenvectors, and Diagonalization The concepts of eigenvalues, eigenvectors, and diagonalization are best studied with examples. We will
More informationCHAPTER 3. Matrix Eigenvalue Problems
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationIntroduction to Matrices
214 Analysis and Design of Feedback Control Systems Introduction to Matrices Derek Rowell October 2002 Modern system dynamics is based upon a matrix representation of the dynamic equations governing the
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationDifferential equations
Differential equations Math 7 Spring Practice problems for April Exam Problem Use the method of elimination to find the x-component of the general solution of x y = 6x 9x + y = x 6y 9y Soln: The system
More informationLinear Algebra Methods for Data Mining
Linear Algebra Methods for Data Mining Saara Hyvönen, Saara.Hyvonen@cs.helsinki.fi Spring 2007 1. Basic Linear Algebra Linear Algebra Methods for Data Mining, Spring 2007, University of Helsinki Example
More informationPartial Differential Equations and Complex Variables
EE-22, Spring 29 p. /25 EE 22 Partial Differential Equations and Complex Variables Ray-Kuang Lee Institute of Photonics Technologies, Department of Electrical Engineering and Department of Physics, National
More informationHW #1 Solutions: M552 Spring 2006
HW #1 Solutions: M55 Spring 006 1. (1.4-Trefethen & Bau) Let f 1,...,f 8 be a set of functions defined on the interval [1,8] with the property that for any numbers d 1,...,d 8, there exists a set of coefficients
More informationSystems of Second Order Differential Equations Cayley-Hamilton-Ziebur
Systems of Second Order Differential Equations Cayley-Hamilton-Ziebur Characteristic Equation Cayley-Hamilton Cayley-Hamilton Theorem An Example Euler s Substitution for u = A u The Cayley-Hamilton-Ziebur
More informationFrom Lay, 5.4. If we always treat a matrix as defining a linear transformation, what role does diagonalisation play?
Overview Last week introduced the important Diagonalisation Theorem: An n n matrix A is diagonalisable if and only if there is a basis for R n consisting of eigenvectors of A. This week we ll continue
More informationMatrices and Deformation
ES 111 Mathematical Methods in the Earth Sciences Matrices and Deformation Lecture Outline 13 - Thurs 9th Nov 2017 Strain Ellipse and Eigenvectors One way of thinking about a matrix is that it operates
More informationNotes on Eigenvalues, Singular Values and QR
Notes on Eigenvalues, Singular Values and QR Michael Overton, Numerical Computing, Spring 2017 March 30, 2017 1 Eigenvalues Everyone who has studied linear algebra knows the definition: given a square
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationJim Lambers MAT 610 Summer Session Lecture 2 Notes
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the
More informationHOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)
HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION) PROFESSOR STEVEN MILLER: BROWN UNIVERSITY: SPRING 2007 1. CHAPTER 1: MATRICES AND GAUSSIAN ELIMINATION Page 9, # 3: Describe
More information1. In this problem, if the statement is always true, circle T; otherwise, circle F.
Math 1553, Extra Practice for Midterm 3 (sections 45-65) Solutions 1 In this problem, if the statement is always true, circle T; otherwise, circle F a) T F If A is a square matrix and the homogeneous equation
More informationPeriodic oscillations in the Gross-Pitaevskii equation with a parabolic potential
Periodic oscillations in the Gross-Pitaevskii equation with a parabolic potential Dmitry Pelinovsky 1 and Panos Kevrekidis 2 1 Department of Mathematics, McMaster University, Hamilton, Ontario, Canada
More informationLinear algebra II Homework #1 solutions A = This means that every eigenvector with eigenvalue λ = 1 must have the form
Linear algebra II Homework # solutions. Find the eigenvalues and the eigenvectors of the matrix 4 6 A =. 5 Since tra = 9 and deta = = 8, the characteristic polynomial is f(λ) = λ (tra)λ+deta = λ 9λ+8 =
More informationE. YABLONOVITCH photonic crystals by using level set methods
Appl. Phys. B 81, 235 244 (2005) DOI: 10.1007/s00340-005-1877-3 Applied Physics B Lasers and Optics C.Y. KAO 1, Maximizing band gaps in two-dimensional S. OSHER 2 E. YABLONOVITCH photonic crystals by using
More informationELE/MCE 503 Linear Algebra Facts Fall 2018
ELE/MCE 503 Linear Algebra Facts Fall 2018 Fact N.1 A set of vectors is linearly independent if and only if none of the vectors in the set can be written as a linear combination of the others. Fact N.2
More informationCHAPTER 5 REVIEW. c 1. c 2 can be considered as the coordinates of v
CHAPTER 5 REVIEW Throughout this note, we assume that V and W are two vector spaces with dimv = n and dimw = m. T : V W is a linear transformation.. A map T : V W is a linear transformation if and only
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 8, 2009 Today
More information1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)
1 A linear system of equations of the form Sections 75, 78 & 81 a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2 a m1 x 1 + a m2 x 2 + + a mn x n = b m can be written in matrix
More informationQuadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.
Quadratic forms 1. Symmetric matrices An n n matrix (a ij ) n ij=1 with entries on R is called symmetric if A T, that is, if a ij = a ji for all 1 i, j n. We denote by S n (R) the set of all n n symmetric
More information235 Final exam review questions
5 Final exam review questions Paul Hacking December 4, 0 () Let A be an n n matrix and T : R n R n, T (x) = Ax the linear transformation with matrix A. What does it mean to say that a vector v R n is an
More informationLecture Notes for Math 251: ODE and PDE. Lecture 27: 7.8 Repeated Eigenvalues
Lecture Notes for Math 25: ODE and PDE. Lecture 27: 7.8 Repeated Eigenvalues Shawn D. Ryan Spring 22 Repeated Eigenvalues Last Time: We studied phase portraits and systems of differential equations with
More informationDM554 Linear and Integer Programming. Lecture 9. Diagonalization. Marco Chiarandini
DM554 Linear and Integer Programming Lecture 9 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. More on 2. 3. 2 Resume Linear transformations and
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
More informationNumerical Linear Algebra
Numerical Linear Algebra By: David McQuilling; Jesus Caban Deng Li Jan.,31,006 CS51 Solving Linear Equations u + v = 8 4u + 9v = 1 A x b 4 9 u v = 8 1 Gaussian Elimination Start with the matrix representation
More informationNonlinear Eigenvalue Problems: An Introduction
Nonlinear Eigenvalue Problems: An Introduction Cedric Effenberger Seminar for Applied Mathematics ETH Zurich Pro*Doc Workshop Disentis, August 18 21, 2010 Cedric Effenberger (SAM, ETHZ) NLEVPs: An Introduction
More informationlinearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice
3. Eigenvalues and Eigenvectors, Spectral Representation 3.. Eigenvalues and Eigenvectors A vector ' is eigenvector of a matrix K, if K' is parallel to ' and ' 6, i.e., K' k' k is the eigenvalue. If is
More information