In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation.


 Lillian Greene
 1 years ago
 Views:
Transcription
1 1 2 Linear Systems In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation 21 Matrix ODEs Let and is a scalar A linear function satisfies Linear superposition ) Linear scaling: Example: is not a linear function instead it is affine General form of a linear function: In matrix notation: Assume is a real matrix and General form for a linear ODE Example: (Linearization about an equilibrium point) Let Recall Taylor series expansion about Linear approximation at corresponds to throwing away the higher order terms Now suppose The same equation applies if the derivative is interpreted as a matrix Now suppose has an equilibrium point Expand the right hand side of the ODE in Taylor series about and use to obtain: Finally substitute let and make a linear approximation by throwing away the higher order terms to get This process of linearization about an equilibrium point is an important technique in the analysis of ODEs
2 2 Eigenvalues and Eigenvectors Let A be a real matrix and An eigenvector v of A is a nonzero solution of is the corresponding eigenvalue From linear algebra we know that the eigenvalues of a matrix A are given by the roots of the characteristic polynomial Look for solutions of [1] of form Substitution into [1] leads to Since is nonzero this implies with solution for an arbitrary constant The corresponding solution of [1] is Example: Consider the matrix Eigenvalues are solutions of They are and The first eigenvector satisfies or Letting we have This has the solution Eigenvectors are determined up to an arbitrary multiplicative factor Similarly find Two solutions of [1] for this matrix A are and Sketch examples of and in the ( plane Meiss calls these straight line solutions
3 3 Diagonalization Since [1] is linear linear combinations of solutions are themselves solutions Ex: If has linearly independent eigenvectors then these span In this case we also say that has a complete set of eigenvectors The matrix is nonsingular [Vertical bars separate column vectors] Then is the matrix with eigenvalues on the main diagonal and zeros in all of the other slots Multiplying by on the left to obtain In this case we say is diagonalizable or semisimple Example (continued) The inverse of any matrix is where Then use from the example above to obtain and Then we find If has linearly independent eigenvectors then any can be written as a linear combination of these where can be regarded as the coordinates of the point in eigenvector coordinates The matrix transforms from eigenvector coordinates to standard coordinates Correspondingly the matrix transforms back from standard coordinates to eigenvector coordinates With this in mind consider [1] Multiply on the left by to get:
4 4 [2] where are the coordinates of the point in the basis of eigenvectors Since is a diagonal matrix the equations [2] are not coupled The i^th component is just with solution for some constant In matrix notation this solution is written where Summary Our results in this subsection allow us to solve the following initial value problem in the case that the real matrix has a complete set of eigenvectors : The matrix initial condition by is nonsingular Multiply both the differential equation and the on the left to get Solve this uncoupled system to get and then multiply on the left by to get [3] where 22 TwoDimensional Linear Systems Classify the twodimensional linear systems according to the qualitative nature of their solutions These are systems of the form where is a matrix Eigenvalues are the roots of the characteristic polynomial Here is the trace of and is the determinant of The roots are
5 5 [6] where the is the discriminant of Qualitatively different cases of eigenvalues divide plane into 5 regions: Sketch of plane and the parabola Include in each of the 5 regions a sketch of the complex plane This is Meiss Fig 21 Note that the eigenvalues are distinct off of the parabola According to a theorem of linear algebra when the eigenvalues are distinct the corresponding eigenvectors will be too Then is diagonalizable and the general solution of the initial value problem has the form of [3] For the 2D case this may be written [4] The 5 regions of the plane correspond to 5 geometrically distinct phase portraits: [A] Unstable node: There are straight line solutions moving away from the origin that correspond to initial conditions on the eigenspaces and Other solutions are asymptotically parallel to as and asymptotically parallel to as Sketch plane and several trajectories Like Meiss Fig 22 [B] Stable node: This is like [A] with arrows reversed and with and interchanged Straight line solutions move toward the origin on and Other solutions are asymptotically parallel to as and asymptotically parallel to as Sketch plane and several trajectories [C] Saddle: Straight line solutions move away from the origin on and towards the origin on Other solution are asymptotic to as and asymptotic to as Sketch plane and several trajectories Like Meiss Fig 23 [D] Unstable focus: Both the eigenvalues and eigenvectors are complex conjugate (To see this just take the complex conjugate of A ) Let where and are real vectors The solution is still given by [4] where and must also be conjugate in order that the solution be real Let these expressions into the right hand side of [4] one obtains [5] Substituting
6 6 We have written The solution is an exponentially expanding spiral Example The following phase portrait was constructed for the linear system with For this case and so that [E] Stable focus: The analysis is similar to that for an unstable focus The solution is an exponentially contracting spiral There are also several cases corresponding to boundaries between the 5 regions on the plane The first two cases correspond to nonisolated equilibria which occur when there is a zero eigenvalue giving
7 7 [a] Unstable degenerate equilibrium: The eigenspace is a line of unstable equilibria Solutions that originate off this line move away exponentially as along lines parallel to [b] Stable degenerate equilibrium: The eigenspace is a line of stable equilibria Solutions that originate off this line move away exponentially as along lines parallel to [c] Center: are obtained for and The analysis is given by [5] with Trajectories are ellipses This case is particularly important both because it occurs in bifurcations (chapter 8) and because Hamiltonian systems always have To analyze the boundary states corresponding to the parabola we need to recall some concepts from linear algebra beginning with two concepts of the multiplicity of an eigenvalue: An eigenvalue has algebraic multiplicity if the characteristic polynomial can be written where ie is a fold root of the characteristic polynomial An eigenvalue has geometric multiplicity if it has linearly independent eigenvectors ie and A theorem of linear algebra is that the geometric multiplicity is at most the algebraic multiplicity When the geometric multiplicity is less than the algebraic multiplicity the matrix is defective The column space or range of a matrix is defined to be the span of its column vectors If then The rank of B is the dimension of the range: Then the geometric multiplicity of is The null space or kernel of a matrix B is the set of vectors that the matrix send to zero: For example consider an eigenvalue and eigenvector of matrix These satisfy or equivalently Then The dimension of the kernel is called the nullity of a matrix:
8 8 If matrix has columns a theorem of linear algebra implies that Continue the example If the geometric multiplicity of is then has linearly independent eigenvectors associated with and Return to the analysis of the boundary states in the plane on the parabola where is the trace of and is the determinant of Then [6] implies that the matrix has an eigenvalue of algebraic multiplicity 2 When the geometric multiplicity of is 2 That is for every vector This implies Every nonzero vector is an eigenvector and the solution of is uniform expansion away from the origin for or uniform contraction toward the origin for When the geometric multiplicity of is 1 the matrix has only a single eigenvector This means [4] cannot be the general solution of the initial value problem The solution will be obtained in section Exponentials of Operators Let be a vector space We may have or but results in this section also apply to infinite dimensional vector spaces An operator maps a vector to some other vector A linear operator T satisfies linear superposition and scaling If and and are scalars then If and is a basis for then T will be represented by a matrix in that basis In this case may replaced by in the equations below We write the space of linear operators on is itself an dimensional vector space Notice that a matrix representing has components If then represents the Euclidean norm: We will also define an operator norm The operator norm satisfies the usual properties for norms In particular the triangle inequality is satisfied If S and T are operators on then [The matrix norm is a continuous function of its argument See Hirsch and Smale p 78]
9 9 A linear operator also satisfies since for For any integer we have by the same logic Since this is true for all we conclude [6] An operator for which is said to be bounded Example Suppose On a finite dimensional vector space the sphere is compact and the Euclidean norm is continuous Therefore attains a maximum value on the sphere and is bounded A series in a normed vector space is absolutely convergent if the series converges This condition implies that converges (Hirsch and Smale 1974) Recall the Taylor series for about from calculus: We formally define the exponential of an operator in the same way: [7] Lemma 21 If T is a bounded linear operator then is as well Proof By [6] and the series of real numbers converges to Therefore the series [7] converges absolutely by the comparison test It also follows that Properties of the exponential The first 6 of these are from Meiss His Roman numerals are given but in my order I have added a property (vii) [i] This is a direct consequence of the definition of the exponential [v] If then
10 10 Notice and insert in the definition of the exponential [vi] If is an eigenvector of with eigenvalue then Notice and let [iv] If B is nonsingular then Using the definition of the exponential [iii] If A and B commute then (the law of exponents!) See exercise #6 The idea of part (a) is that if and are real numbers then the series for their exponentials can be manipulated to show that Since matrices and commute their series can be manipulated in the same way However the manipulation is complicated Parts (b) and (c) provide a much shorter proof [ii] Follows directly from the property [iii] [vii] The matrices and commute Let be a positive integer then and let The three examples given at the end of this section are important The first anticipates results in section 26 Example (Nilpotent matrices) A matrix N has nilpotency k if but For example consider where has nilpotency 2 Every matrix commutes with the identity matrix; in particular the matrices and N commute Then from property (iii) where only the first two terms in the series for are nonzero Example (Roots of Identity) This result will be used in the next example The matrix
11 11 has powers Insert into the definition of the matrix exponential and recall the MacLaurin series To obtain Example (Rotation Matrix) If is real and has a pair of complex conjugate eigenvalues then the associated eigenvectors will also be complex conjugate Let the eigenvectors be denoted and We will see in section 25 that when A is transformed using the matrix we get the form From the example above The matrix in the last expression rotates a vector in the plane clockwise by an angle 24 Fundamental Solution Theorem Theorem 23 Let be an matrix Then the initial value problem [1] has the unique solution Proof First demonstrate that the solution works The differential equation is satisfied:
12 12 The initial condition is also satisfied: To show that the solution is unique suppose Then use the product rule to obtain is another solution of the initial value problem where we have also used the fact that and commute Therefore is a constant and by property (ii) in section 23 Moreover since the two solutions must satisfy the same initial condition Example Massspring system Consider a spring of natural length L mass m and Hooke s law constant k on a frictionless table: The figure shows the spring extended a distance of motion gives beyond its natural length Newton s law This ODE is affine but we can make it linear by substituting Then get This can be further simplified by introducing the dimensionless time where Denote to get Write as a first order system
13 13 Consider the initial value problem using : Note that and According to the classification of linear systems the solution is a center By the Fundamental Theorem the solution of the initial value problem is Finally express the answer in terms of : where and Consider the result of Theorem 23 for a set of initial condition vectors Put the initial condition vectors together to form a matrix and the solutions together to form We then have Theorem 24 The matrix initial value problem Has the unique solution A matrix initial value problem is used in the beautiful proof of the law of exponents for the matrix exponential given by problem 6 parts (b) and (c)! The fundamental matrix solution is the solution of the initial value problem Its name arises from the fact that solve the initial value problem [1] for any Check by calculating (t) and using this formula When is a constant matrix We will return to fundamental matrix solution in section 28 when we will consider a function of time
Examples include: (a) the Lorenz system for climate and weather modeling (b) the HodgkinHuxley system for neuron modeling
1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples
More information8.1 Bifurcations of Equilibria
1 81 Bifurcations of Equilibria Bifurcation theory studies qualitative changes in solutions as a parameter varies In general one could study the bifurcation theory of ODEs PDEs integrodifferential equations
More informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More information7 Planar systems of linear ODE
7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution
More informationMA 527 first midterm review problems Hopefully final version as of October 2nd
MA 57 first midterm review problems Hopefully final version as of October nd The first midterm will be on Wednesday, October 4th, from 8 to 9 pm, in MTHW 0. It will cover all the material from the classes
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 WeiTa Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationMath 1553, Introduction to Linear Algebra
Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has courselevel learning goals that pertain to the entire course, and sectionlevel
More information4 SecondOrder Systems
4 SecondOrder Systems Secondorder autonomous systems occupy an important place in the study of nonlinear systems because solution trajectories can be represented in the plane. This allows for easy visualization
More informationA = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,
65 Diagonalizable Matrices It is useful to introduce few more concepts, that are common in the literature Definition 65 The characteristic polynomial of an n n matrix A is the function p(λ) det(a λi) Example
More informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
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 informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationProblem set 7 Math 207A, Fall 2011 Solutions
Problem set 7 Math 207A, Fall 2011 s 1. Classify the equilibrium (x, y) = (0, 0) of the system x t = x, y t = y + x 2. Is the equilibrium hyperbolic? Find an equation for the trajectories in (x, y) phase
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 informationMCE693/793: Analysis and Control of Nonlinear Systems
MCE693/793: Analysis and Control of Nonlinear Systems Systems of Differential Equations Phase Plane Analysis Hanz Richter Mechanical Engineering Department Cleveland State University Systems of Nonlinear
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationDef. (a, b) is a critical point of the autonomous system. 1 Proper node (stable or unstable) 2 Improper node (stable or unstable)
Types of critical points Def. (a, b) is a critical point of the autonomous system Math 216 Differential Equations Kenneth Harris kaharri@umich.edu Department of Mathematics University of Michigan November
More informationChapter 5 Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Outline 5.1 Eigenvalues and Eigenvectors 5.2 Diagonalization 5.3 Complex Vector Spaces 2 5.1 Eigenvalues and Eigenvectors Eigenvalue and Eigenvector If A is a n n
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More informationMATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018
Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationAS and A level Further mathematics contents lists
AS and A level Further mathematics contents lists Contents Core Pure Mathematics Book 1/AS... 2 Core Pure Mathematics Book 2... 4 Further Pure Mathematics 1... 6 Further Pure Mathematics 2... 8 Further
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 4 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University April 15, 2018 Linear Algebra (MTH 464)
More informationDIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix
DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that
More informationCalculus and Differential Equations II
MATH 250 B Second order autonomous linear systems We are mostly interested with 2 2 first order autonomous systems of the form { x = a x + b y y = c x + d y where x and y are functions of t and a, b, c,
More informationThe goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T
1 1 Linear Systems The goal of this chapter is to study linear systems of ordinary differential equations: ẋ = Ax, x(0) = x 0, (1) where x R n, A is an n n matrix and ẋ = dx ( dt = dx1 dt,..., dx ) T n.
More informationStability of Dynamical systems
Stability of Dynamical systems Stability Isolated equilibria Classification of Isolated Equilibria Attractor and Repeller Almost linear systems Jacobian Matrix Stability Consider an autonomous system u
More informationFind the general solution of the system y = Ay, where
Math Homework # March, 9..3. Find the general solution of the system y = Ay, where 5 Answer: The matrix A has characteristic polynomial p(λ = λ + 7λ + = λ + 3(λ +. Hence the eigenvalues are λ = 3and λ
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 informationDiagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Diagonalization MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Motivation Today we consider two fundamental questions: Given an n n matrix A, does there exist a basis
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 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 informationCopyright (c) 2006 Warren Weckesser
2.2. PLANAR LINEAR SYSTEMS 3 2.2. Planar Linear Systems We consider the linear system of two first order differential equations or equivalently, = ax + by (2.7) dy = cx + dy [ d x x = A x, where x =, and
More informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationLAKELAND COMMUNITY COLLEGE COURSE OUTLINE FORM
LAKELAND COMMUNITY COLLEGE COURSE OUTLINE FORM ORIGINATION DATE: 8/2/99 APPROVAL DATE: 3/22/12 LAST MODIFICATION DATE: 3/28/12 EFFECTIVE TERM/YEAR: FALL/ 12 COURSE ID: COURSE TITLE: MATH2800 Linear Algebra
More information(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).
.(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
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 informationDefinition: An n x n matrix, "A", is said to be diagonalizable if there exists a nonsingular matrix "X" and a diagonal matrix "D" such that X 1 A X
DIGONLIZTION Definition: n n x n matrix, "", is said to be diagonalizable if there exists a nonsingular matrix "X" and a diagonal matrix "D" such that X X D. Theorem: n n x n matrix, "", is diagonalizable
More informationMAT1302F Mathematical Methods II Lecture 19
MAT302F Mathematical Methods II Lecture 9 Aaron Christie 2 April 205 Eigenvectors, Eigenvalues, and Diagonalization Now that the basic theory of eigenvalues and eigenvectors is in place most importantly
More informationMAT Linear Algebra Collection of sample exams
MAT 342  Linear Algebra Collection of sample exams Ax. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationL(C G (x) 0 ) c g (x). Proof. Recall C G (x) = {g G xgx 1 = g} and c g (x) = {X g Ad xx = X}. In general, it is obvious that
ALGEBRAIC GROUPS 61 5. Root systems and semisimple Lie algebras 5.1. Characteristic 0 theory. Assume in this subsection that chark = 0. Let me recall a couple of definitions made earlier: G is called reductive
More informationspring, math 204 (mitchell) list of theorems 1 Linear Systems Linear Transformations Matrix Algebra
spring, 2016. math 204 (mitchell) list of theorems 1 Linear Systems THEOREM 1.0.1 (Theorem 1.1). Uniqueness of Reduced RowEchelon Form THEOREM 1.0.2 (Theorem 1.2). Existence and Uniqueness Theorem THEOREM
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
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 informationDot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem.
Dot Products K. Behrend April 3, 008 Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem. Contents The dot product 3. Length of a vector........................
More information11.1 Vectors in the plane
11.1 Vectors in the plane What is a vector? It is an object having direction and length. Geometric way to represent vectors It is represented by an arrow. The direction of the arrow is the direction of
More informationSolving Homogeneous Systems with Submatrices
Pure Mathematical Sciences, Vol 7, 218, no 1, 1118 HIKARI Ltd, wwwmhikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Submatrices Massoud Malek Mathematics, California State
More informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
More informationElements of Applied Bifurcation Theory
Yuri A. Kuznetsov Elements of Applied Bifurcation Theory Third Edition With 251 Illustrations Springer Introduction to Dynamical Systems 1 1.1 Definition of a dynamical system 1 1.1.1 State space 1 1.1.2
More information(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.
1 Which of the following statements is always true? I The null space of an m n matrix is a subspace of R m II If the set B = {v 1,, v n } spans a vector space V and dimv = n, then B is a basis for V III
More informationSolving a system by backsubstitution, checking consistency of a system (no rows of the form
MATH 520 LEARNING OBJECTIVES SPRING 2017 BROWN UNIVERSITY SAMUEL S. WATSON Week 1 (23 Jan through 27 Jan) Definition of a system of linear equations, definition of a solution of a linear system, elementary
More informationDiagonalization of Matrix
of Matrix King Saud University August 29, 2018 of Matrix Table of contents 1 2 of Matrix Definition If A M n (R) and λ R. We say that λ is an eigenvalue of the matrix A if there is X R n \ {0} such that
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More information4. Linear transformations as a vector space 17
4 Linear transformations as a vector space 17 d) 1 2 0 0 1 2 0 0 1 0 0 0 1 2 3 4 32 Let a linear transformation in R 2 be the reflection in the line = x 2 Find its matrix 33 For each linear transformation
More informationAppendix: A ComputerGenerated Portrait Gallery
Appendi: A ComputerGenerated Portrait Galler There are a number of publicdomain computer programs which produce phase portraits for 2 2 autonomous sstems. One has the option of displaing the trajectories
More informationPRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.
Prof A Suciu MTH U37 LINEAR ALGEBRA Spring 2005 PRACTICE FINAL EXAM Are the following vectors independent or dependent? If they are independent, say why If they are dependent, exhibit a linear dependence
More informationHomogeneous Constant Matrix Systems, Part II
4 Homogeneous Constant Matrix Systems, Part II Let us now expand our discussions begun in the previous chapter, and consider homogeneous constant matrix systems whose matrices either have complex eigenvalues
More informationUNDERSTANDING THE DIAGONALIZATION PROBLEM. Roy Skjelnes. 1. Linear Maps 1.1. Linear maps. A map T : R n R m is a linear map if
UNDERSTANDING THE DIAGONALIZATION PROBLEM Roy Skjelnes Abstract These notes are additional material to the course B107, given fall 200 The style may appear a bit coarse and consequently the student is
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
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 informationLinear Algebra. Rekha Santhanam. April 3, Johns Hopkins Univ. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, / 7
Linear Algebra Rekha Santhanam Johns Hopkins Univ. April 3, 2009 Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 1 / 7 Dynamical Systems Denote owl and wood rat populations at time k
More informationClassification of Phase Portraits at Equilibria for u (t) = f( u(t))
Classification of Phase Portraits at Equilibria for u t = f ut Transfer of Local Linearized Phase Portrait Transfer of Local Linearized Stability How to Classify Linear Equilibria Justification of the
More informationStability lectures. Stability of Linear Systems. Stability of Linear Systems. Stability of Continuous Systems. EECE 571M/491M, Spring 2008 Lecture 5
EECE 571M/491M, Spring 2008 Lecture 5 Stability of Continuous Systems http://courses.ece.ubc.ca/491m moishi@ece.ubc.ca Dr. Meeko Oishi Electrical and Computer Engineering University of British Columbia,
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 informationHW2  Due 01/30. Each answer must be mathematically justified. Don t forget your name.
HW2  Due 0/30 Each answer must be mathematically justified. Don t forget your name. Problem. Use the row reduction algorithm to find the inverse of the matrix 0 0, 2 3 5 if it exists. Double check your
More informationLINEAR ALGEBRA 1, 2012I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationMath 302 Outcome Statements Winter 2013
Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the ThreeDimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a
More information1. Foundations of Numerics from Advanced Mathematics. Linear Algebra
Foundations of Numerics from Advanced Mathematics Linear Algebra Linear Algebra, October 23, 22 Linear Algebra Mathematical Structures a mathematical structure consists of one or several sets and one or
More informationOne Dimensional Dynamical Systems
16 CHAPTER 2 One Dimensional Dynamical Systems We begin by analyzing some dynamical systems with onedimensional phase spaces, and in particular their bifurcations. All equations in this Chapter are scalar
More informationMath 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith
Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith (c)2015 UM Math Dept licensed under a Creative Commons ByNCSA 4.0 International License. Definition: Let V T V be a linear transformation.
More informationSection 9.3 Phase Plane Portraits (for Planar Systems)
Section 9.3 Phase Plane Portraits (for Planar Systems) Key Terms: Equilibrium point of planer system yꞌ = Ay o Equilibrium solution Exponential solutions o Halfline solutions Unstable solution Stable
More informationMath 205, Summer I, Week 4b: Continued. Chapter 5, Section 8
Math 205, Summer I, 2016 Week 4b: Continued Chapter 5, Section 8 2 5.8 Diagonalization [reprint, week04: Eigenvalues and Eigenvectors] + diagonaliization 1. 5.8 Eigenspaces, Diagonalization A vector v
More informationSolutions Chapter 9. u. (c) u(t) = 1 e t + c 2 e 3 t! c 1 e t 3c 2 e 3 t. (v) (a) u(t) = c 1 e t cos 3t + c 2 e t sin 3t. (b) du
Solutions hapter 9 dode 9 asic Solution Techniques 9 hoose one or more of the following differential equations, and then: (a) Solve the equation directly (b) Write down its phase plane equivalent, and
More informationMATHEMATICS COMPREHENSIVE EXAM: INCLASS COMPONENT
MATHEMATICS COMPREHENSIVE EXAM: INCLASS COMPONENT The following is the list of questions for the oral exam. At the same time, these questions represent all topics for the written exam. The procedure for
More informationDimension. Eigenvalue and eigenvector
Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, ranknullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,
More informationLecture Notes for Math 524
Lecture Notes for Math 524 Dr Michael Y Li October 19, 2009 These notes are based on the lecture notes of Professor James S Muldowney, the books of Hale, Copple, Coddington and Levinson, and Perko They
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More information+ i. cos(t) + 2 sin(t) + c 2.
MATH HOMEWORK #7 PART A SOLUTIONS Problem 7.6.. Consider the system x = 5 x. a Express the general solution of the given system of equations in terms of realvalued functions. b Draw a direction field,
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 informationDSGA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DSGA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationMATH 215/255 Solutions to Additional Practice Problems April dy dt
. For the nonlinear system MATH 5/55 Solutions to Additional Practice Problems April 08 dx dt = x( x y, dy dt = y(.5 y x, x 0, y 0, (a Show that if x(0 > 0 and y(0 = 0, then the solution (x(t, y(t of the
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKERKAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
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 informationEigenvalues and Eigenvectors: An Introduction
Eigenvalues and Eigenvectors: An Introduction The eigenvalue problem is a problem of considerable theoretical interest and wideranging application. For example, this problem is crucial in solving systems
More informationECE504: Lecture 6. D. Richard Brown III. Worcester Polytechnic Institute. 07Oct2008
D. Richard Brown III Worcester Polytechnic Institute 07Oct2008 Worcester Polytechnic Institute D. Richard Brown III 07Oct2008 1 / 35 Lecture 6 Major Topics We are still in Part II of ECE504: Quantitative
More information8. Diagonalization.
8. Diagonalization 8.1. Matrix Representations of Linear Transformations Matrix of A Linear Operator with Respect to A Basis We know that every linear transformation T: R n R m has an associated standard
More informationElements of Applied Bifurcation Theory
Yuri A. Kuznetsov Elements of Applied Bifurcation Theory Second Edition With 251 Illustrations Springer Preface to the Second Edition Preface to the First Edition vii ix 1 Introduction to Dynamical Systems
More informationMath 4A Notes. Written by Victoria Kala Last updated June 11, 2017
Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...
More informationModule 6 : Solving Ordinary Differential Equations  Initial Value Problems (ODEIVPs) Section 3 : Analytical Solutions of Linear ODEIVPs
Module 6 : Solving Ordinary Differential Equations  Initial Value Problems (ODEIVPs) Section 3 : Analytical Solutions of Linear ODEIVPs 3 Analytical Solutions of Linear ODEIVPs Before developing numerical
More information6 Inner Product Spaces
Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space
More informationMath Final December 2006 C. Robinson
Math 2851 Final December 2006 C. Robinson 2 5 8 5 1 2 01 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the
More informationMath 3301 Homework Set Points ( ) ( ) I ll leave it to you to verify that the eigenvalues and eigenvectors for this matrix are, ( ) ( ) ( ) ( )
#7. ( pts) I ll leave it to you to verify that the eigenvalues and eigenvectors for this matrix are, λ 5 λ 7 t t ce The general solution is then : 5 7 c c c x( 0) c c 9 9 c+ c c t 5t 7 e + e A sketch of
More information