TOTAL REDUCTION OF LINEAR SYSTEMS OF OPERATOR EQUATIONS WITH THE SYSTEM MATRIX IN THE COMPANION FORM. Ivana Jovović
|
|
- Abel Mosley
- 7 years ago
- Views:
Transcription
1 PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 93 (107) (2013), DOI: /PIM J TOTAL REDUCTION OF LINEAR SYSTEMS OF OPERATOR EQUATIONS WITH THE SYSTEM MATRIX IN THE COMPANION FORM Ivana Jovović Communicated by Žarko Mijajlović Abstract We consider a total reduction of a nonhomogeneous linear system of operator equations with the system matrix in the companion form Totally reduced system obtained in this manner is completely decoupled, ie, it is a system with separated variables We introduce a method for the total reduction, not by a change of basis, but by finding the adjugate matrix of the characteristic matrix of the system matrix We also indicate how this technique may be used to connect differential transcendence of the solution with the coefficients of the system 1 Introduction The order of a linear operator equation is the highest power of the operator in the equation The reduction of a nonhomogeneous linear system of the first order operator equations to the partially reduced system, ie, to the system consisting of a higher order linear operator equation having only one variable and the rest of the first order linear operator equations in two variables, was studied in paper [6] In this paper we will be concerned with the reduction of a nonhomogeneous linear system of the first order operator equations with the system matrix in the companion form to the totally reduced system, ie, to the system with completely decoupled equations The common method for transforming a system into the totally reduced system relies upon the changing of basis in which the system matrix is given in Jordan canonical form In papers [1] and [2] we can find a procedure for determining the transformation matrix S such that C = S 1 J S, where C is the matrix in the companion form and J is the matrix in Jordan form In 2010 Mathematics Subject Classification: 15A21 Key words and phrases: Partial and total reduction of linear systems of operator equations, characteristic polynomial, characteristic matrix, adjugate matrix, rational and Jordan canonical forms, invariant factors, differentially algebraic function, differentially transcendental function Partially supported by Serbian Ministry of Science, Grant
2 118 JOVOVIĆ order to establish the form of the totally reduced system we will use the form of the coefficients of the adjugate matrix of the characteristic matrix of the system matrix presented as A polynomial with matrix coefficients As a consequence of this method we will get a connection between the entries of the system matrix and differential transcendence of the solution of a linear system of the first order differential equations with the system matrix in the companion form and with complex coefficients, where exactly one nonhomogeneous part is a differentially transcendental meromorphic function 2 Preliminaries In this section we will review some standard facts of linear algebra A more complete presentation can be found in [4, 5] Let C be an n n matrix with coefficients in a field K An element λ K is called an eigenvalue of C with the corresponding eigenvector v if v is a nonzero n 1 column with coefficients in K such that λv = Cv The set of all eigenvectors with the same eigenvalue λ, together with the zero vector, is a vector space called the eigenspace of the matrix C that corresponds to the eigenvalue λ The geometric multiplicity of an eigenvalue λ is defined as the dimension of the associated eigenspace, ie, it is the number of linearly independent eigenvectors corresponding to that eigenvalue The algebraic multiplicity of an eigenvalue λ is defined as the multiplicity of the corresponding root of the characteristic polynomial A generalized eigenvector u of C associated to λ is a nonzero n 1 column with coefficients in K satisfying (C λi) k u = 0, for some k N The set of all generalized eigenvectors for a given eigenvalue λ, together with the zero vector, form the generalized eigenspace for λ The k k matrix of the form λ λ 0 0 J = 0 0 λ λ is called the Jordan block of size k with eigenvalue λ A matrix is said to be in a Jordan canonical form if it is a block diagonal matrix with Jordan blocks along the diagonal The number of Jordan blocks corresponding to an eigenvalue λ is equal to its geometric multiplicity and the sum of their sizes is equal to the algebraic multiplicity of λ Invariant factors of matrix C are polynomials i 1 (λ) = D 1(λ) D 0 (λ), i 2(λ) = D 2(λ) D 1 (λ), i r(λ) = D r(λ) D r 1 (λ), where D j (λ) is the greatest common divisor of all the minors of order j in λi C and D 0 (λ) = 1, 1 j r The companion matrix of a polynomial (λ) =
3 TOTAL REDUCTION OF LINEAR SYSTEMS WITH MATRIX IN COMPANION FORM 119 λ n + d 1 λ n d n 1 λ + d n is the matrix C = d n d n 1 d n 2 d 2 d 1 It can easily be seen that the characteristic polynomial of the companion matrix C is (λ) The characteristic equation (λ) = 0 can also be written in the following matrix form λ λ (λi C) v(λ) = λ 1 d n d n 1 d n 2 d 2 λ + d 1 1 λ λ n 2 λ n 1 = (λ) = O If λ 1, λ 2,, λ t are different eigenvalues of the matrix C, we can conclude from the previous equation that v(λ i ) is the eigenvector corresponding to the eigenvalue λ i Since the rank of the matrix λ i I C is equal to n 1, it follows that for each eigenvalue there is only one eigenvector Thus, geometric multiplicity of each eigenvalue is equal to 1 and the Jordan canonical form has exactly t blocks The number of generalized eigenvectors associated to λ i is equal to algebraic multiplicity k i of λ i It also holds (λ i ) = (λ i ) = = (ki 1) (λ i ) = 0 and (ki) (λ i ) 0 Differentiating the corresponding matrix equation k i 1 times with respect to λ we obtain that v 1 1 (λ i ), 2 v (λ i ),, (k i 1)! v(ki 1) (λ i ) are generalized eigenvectors Let S be the matrix whose columns are these generalized eigenvectors Then J = S 1 C S is a Jordan canonical form of the matrix C, (see [1, 2] for more details) In the next section we will derive some properties of a companion matrix that we need for the total reduction by finding the adjugate matrix of the characteristic matrix of the system matrix 3 Properties of Companion Matrix of a Monic Polynomial We already mentioned that the characteristic polynomial of the companion matrix C is (λ) The minor of size n 1 of the matrix λi C obtained by deleting the n-th row and the first column is equal to 1 Hence the minimal polynomial of the matrix C is also equal to (λ) and all invariant factors of the matrix λi C except the last one are 1 Furthermore, the determinant of the matrix C is ( 1) n d n, and consequently if d n 0 the matrix C is invertible Then the inverse matrix of
4 120 JOVOVIĆ the matrix C is G = dn 2 d n dn 3 d n d1 d n 1 d n dn 1 d n The adjugate matrix of C is d n 1 d n 2 d n 3 d 1 1 d n adj(c) = ( 1) n 1 0 d n d n 0 Let the adjugate matrix of the characteristic matrix λi C be written in the form adj(λi C) = λ n 1 C 0 + λ n 2 C λc n 2 + C n 1 Let us determine the coefficients C k using the recurrences C k = C C + d k I, for 1 k n 1 and C 0 = I The recurrences are obtained by equating coefficients at the same powers of λ on the both sides of the equality adj(λi C)(λ) (λi C) = C (λ)i, (see [5]) Lemma 31 Coefficients C k, 1 k n 1, of the matrix adj(λi C) are matrices of the form d k d d k 2 d 2 d d k d d 3 d 2 d d k d 4 d 3 d d k d d k 2 d 2 d 1 1 d n d n 1 d n 2 d k d n d n 1 d k+2 d k d n d k+3 d k+2 d k d n d n 1 d n 2 d k d n d n 1 d k+2 d k+1 0 Proof The proof follows by induction on k We have C 0 = I For the coefficient C 1 it holds C 1 = C I + d 1 I, ie, d d C 1 = d 1 1 d n d n 1 d n 2 d 2 0
5 TOTAL REDUCTION OF LINEAR SYSTEMS WITH MATRIX IN COMPANION FORM 121 Suppose that d d k 2 d d d 2 d C = 0 0 d d k 2 d 1 1 d n d n 1 d k d n d k+1 d k d n d n 1 d k 0 Let (C ) j stand for the j-th row of matrix C, and let (C C ) j denote the j-th row of the product of the matrices C and C Then (C C ) j = (C ) j+1, 1 j n 1 We also have (C ) n C = [0 0 }{{} k 2 d n d n 1 d k+1 d k 0] = [0 } {{ 0 } d n d n 1 d k+1 d k 0] d n d n 1 d n 2 d 2 d 1 From C C = C C we conclude that the above row is the last row of the product C C and hence we deduce 0 d d 2 d d d k 2 d 1 1 C C = d n d n 1 d k d n d k+1 d k d n d n 1 d k d n d k+1 d k Adding the matrix d k I to this product we obtain the matrix C k 4 The Main Result In this section we will derive explicit formulas for the transformation of the following system (41) into the totally reduced system Let K be a field, V a vector space over K and A : V V a linear operator on the vector space V We will consider a nonhomogeneous linear system of operator
6 122 JOVOVIĆ equations of the form A(x 1 ) = x 2 + ϕ 1 A(x 2 ) = x 3 + ϕ 2 (41) A(x n 1 ) = x n + ϕ n 1 A(x n ) = d n x 1 d n 1 x 2 d 1 x n + ϕ n, for d i K, ϕ i V, 1 i n The system can be rewritten in the matrix form A( x) = C x + ϕ, where x = [x 1 x 2 x n ] T K n 1 is the column of unknowns, A : V n 1 V n 1 is a vector operator defined componentwise A( x) = [A(x 1 ) A(x 2 ) A(x n )] T, ϕ = [ϕ 1 ϕ 2 ϕ n ] T V n 1 is a nonhomogeneous term and the system matrix C is the companion matrix of the polynomial (λ) = λ n +d 1 λ n 1 + +d n 1 λ+d n Since A is a linear operator, the system A( x) = C x + ϕ can be transformed into the system A( y) = J y + ψ by multiplying on the left by the matrix S 1, where J is the matrix in Jordan canonical form and S is a transformation matrix such that C = S 1 J S Here y = S 1 x is the column of unknowns and ψ = S 1 ϕ is the nonhomogeneous term If the matrix J has only one block, then system (41) can be transformed into the partially reduced system A(y 1 ) = λy 1 + y 2 + ψ 1 A(y 2 ) = λy 2 + y 3 + ψ 2 A(y n 1 ) = λy n 1 + y n + ψ n 1 A(y n ) = λy n + ψ n The totally reduced system is obtained by acting of operators (A λ) n 1,, (A λ) 2, A λ successively on the equations of the partially reduced system and by substituting the expressions (A λ) n+1 i (y i ) appearing on the right-hand sides of the equalities with n j=i (A λ)n j (ψ j ), for 2 i n, assuming (A λ) 0 is the identity operator Thus the system is of the form (A λ) n (y 1 ) = ψ n + (A λ)(ψ n 1 ) + + (A λ) n 1 (ψ 1 ) (A λ) n 1 (y 2 ) = ψ n + (A λ)(ψ n 1 ) + + (A λ) n 2 (ψ 2 ) (A λ) 2 (y n 1 ) = ψ n + (A λ)(ψ n 1 ) (A λ)(y n ) = ψ n
7 TOTAL REDUCTION OF LINEAR SYSTEMS WITH MATRIX IN COMPANION FORM 123 If the matrix J has t blocks J 1,, J t, then system (41) is equivalent to the system t ( A( yi i=1 ) = J i y i + ψ ) i, where yi = [y li+1 y li+k i ] T and ψ i = [ψ li+1 ψ li+k i ] T, for l 1 = 0 and l i = i 1 j=1 k j, 2 i t Each of the subsystems has the same form as the above partially reduced system, and therefore the corresponding totally reduced system is a conjunction of totally reduced systems Theorem 41 For the linear system of operator equations A( x) = C x + ϕ it holds (A)( x) = n k=1 C A n k ( ϕ), where (λ) is the characteristic polynomial of the system matrix C and C 0, C 1,, C n 1 are the coefficients of the matrix polynomial adj(λi C) For the proof we refer the reader to [7] Theorem 42 The linear system of operator equations (41) implies the totally reduced system n (A)(x 1 ) = d j A n k (ϕ k j ) (42) (A)(x i ) = k=1 j=0 n+1 i k=1 d j A n k (ϕ i 1+k j ) j=0 (A)(x n ) = A n 1 (ϕ n ) where d 0 = 1 n k=2 j=k n k=n+2 i j=k n d j A n k (ϕ n 1+k j ), n d j A n k (ϕ i 1+k j ) Proof According to Theorem 41 we have ( A)( x) = n k=1 C A n k ( ϕ) Moreover it holds A n k (ϕ 1 ) A n k (ϕ 2 ) A n k (ϕ ) A n k (ϕ k ) = A n k (ϕ k+1 ) A n k (ϕ n ) Consequently we get (42) j=0 d ja n k (ϕ k j ) j=0 d ja n k (ϕ n j ) n j=k d ja n k (ϕ n+1 j ) n j=k d ja n k (ϕ n+ j ) Let B be an arbitrary n n matrix with coefficients in a field K and let C = C 1 C k be the rational canonical form of the matrix B Each block C i, 1 i k, is the companion matrix of a invariant factor of the matrix B The system A( x) = B x + ϕ
8 124 JOVOVIĆ can be reduced to the system k i=1 ( A( zi ) = C i z i + ν i ), where ν i = [ν li+1 ν li+n i ] T and z i = [z li+1 z li+n i ] T, for l 1 = 0 and l i = i 1 j=1 n j, 2 i k According to Theorem 42 each subsystem A( z i ) = C i z i + ν i corresponding to the companion matrix C i of the polynomial Ci (λ) = λ ni + d i,1 λ ni d i,ni 1λ + d i,ni can be transformed into the totally reduced system n i Ci (A)(z li+1) = d i,j A ni k (ν li+k j) Ci (A)(z li+t) = k=1 j=0 n i+1 t k=1 d i,j A ni k (ν li+t 1+k j) j=0 n i n i k=n i+2 t j=k d i,j A ni k (ν li+t 1+k j) n i n i Ci (A)(z li+n i ) = A ni 1 (ν li+n i ) d i,j A ni k (ν li+n i 1+k j), k=2 j=k where d i,0 = 1 These systems consist of higher order linear operator equations in only one variable The homogeneous parts of the equations are obtained by replacing λ by A in the invariant factors of the matrix B In addition, each of the subsystems A( z i ) = C i z i + ν i can be transformed by a change of basis into a system with the matrix in the Jordan canonical form Let S i be the matrix constructed from the eigenvectors of C i Then J i = S 1 i C i S i is a matrix in the Jordan canonical form and J i = J i,1 J i,2 J i,ti The blocks J i,1, J i,2,, J i,ti correspond to distinct roots of the polynomial Ci (λ), and their dimensions are equal to the multiplicities of these roots Let us denote by S the direct sum of the matrices S i, ie, S = S 1 S 2 S k Then J = S 1 C S is the Jordan canonical form of the matrix B Therefore the system A( x) = B x + ϕ can be reduced to an equivalent system A( y) = J y + ψ, from which, as we have seen, we can obtain the totally reduced system
9 TOTAL REDUCTION OF LINEAR SYSTEMS WITH MATRIX IN COMPANION FORM Differential transcendence In this section we restrict our attention to system (41) on the assumptions that V is the vector space of meromorphic functions over the complex field C and that A(x) = d dz (x) is a differential operator Recall that a function x 0 V is differentially algebraic over C if it satisfies a differential algebraic equation with coefficients in the field C A function x 0 V is differentially transcendental over C if it is not differentially algebraic, (see [8, 3]) We are interested in establishing a connection between the differential transcendence of the solution of system (42) and the differential transcendence of the nonhomogeneous parts of system (41) Let x 0 V be a solution of differential equation x (n) (z) + d 1 x (n 1) (z) + + d n 1 x (z) + d n x(z) = ϕ(z), for d 1, d 2,, d n C and ϕ V The function x 0 is differentially transcendental over C if and only if the function ϕ is differentially transcendental over C, (see [7, 10]) Since all equations of system (42) are of this form, our main task is to determine the conditions on which a differentially transcendental component of the nonhomogeneous term of system (41) does not appear in the nonhomogeneous parts of system (42) Let ϕ 1 (z) be the only differentially transcendental component of the nonhomogeneous term ϕ(z) = [ϕ 1 (z) ϕ n (z)] T of system (41) Then n d j ϕ (n k) k j (z) k=1 j=0 is a differentially transcendental function over the field C, because the function ϕ 1 (z) appears in the sum in the form ϕ (n 1) 1 (z) + d 1 ϕ (n 2) 1 (z) + + d n 1 ϕ 1 (z) Therefore the first coordinate x 01 (z) of the solution of system (42) is differentially transcendental over C The function ϕ 1 (z) appears in the sums n+1 i k=1 j=0 d j ϕ (n k) i 1+k j (z) n n k=n+2 i j=k d j ϕ (n k) i 1+k j (z), for 1 < i n, in the form d n ϕ (i 2) 1 (z), so the sums are differentially algebraic over C if and only if d n = 0 Hence, the coordinates x 02 (z),, x 0n (z) of the solution of system (42) are differentially algebraic over C if and only if d n = 0 From now on let ϕ m (z), 1 < m < n, be the only differentially transcendental component of the nonhomogeneous term ϕ(z) The nonhomogeneous part n+1 i k=1 j=0 d j ϕ (n k) i 1+k j (z) n n k=n+2 i j=k d j ϕ (n k) i 1+k j (z)
10 126 JOVOVIĆ of the i-th equation of system (42), for 1 i m, contains the function ϕ m (z) in the form of a differential polynomial ϕ (n m+i 1) m (z) + d 1 ϕ (n m+i 2) m (z) + + d n m ϕ (i 1) m (z) Therefore these nonhomogeneous parts are differentially transcendental functions overcand consequently the coordinates x 01 (z),, x 0m (z) of the solution of system (42) are differentially transcendental over C The function ϕ m (z) appears in the nonhomogeneous part of the i-th equation of system (42), for m + 1 i n, in the form of a differential polynomial (d n m+1 ϕ (i 2) m (z) + d n m+2 ϕ (i 3) m (z) + + d n ϕ (i 1 m) m (z)) Hence, these nonhomogeneous parts are differentially algebraic over C if and only if d n m+1 = d n m+2 = = d n = 0, m + 1 i n Thus, the coordinates x 0 m+1 (z),, x 0 n (z) of the solution of system (42) are differentially algebraic over C if and only if d n m+1 = d n m+2 = = d n = 0 If ϕ n (z) is the only differentially transcendental component of the nonhomogeneous term ϕ(z), then all coordinates of the solution of system (42) are differentially transcendental over C, because ϕ n (z) appears in each nonhomogeneous part of system (42) An important point to note here is that if more than one component of the nonhomogeneous term of system (41) is differentially transcendental over C we need to examine their differential independence, (see [9]) References 1 L Brand, The Companion Matrix and Its Properties, Am Math Mon 71 (1964), L Brand, Applications of the Companion Matrix, Am Math Mon 75 (1968), J C Cruz-Victoria, R Martínez-Guerra, J J Rincón-Pasaye, On nonlinear systems diagnosis using differential and algebraic methods, J Franklin Inst 345 (2008), D S Dummit, R M Foote, Abstract Algebra, third edition, Wiley, Hoboken, F R Gantmacher, The Theory of Matrices, Volume One, Amer Math Soc, Providence, Rhode Island, B Malešević, D Todorić, I Jovović, S Telebaković, Formulae of Partial Reduction for Linear Systems of First Order Operator Equations, Appl Math Lett 23 (2010), B Malešević, D Todorić, I Jovović, S Telebaković, Differential Transcendency in the Theory of Linear Differential Systems with Constant Coefficients, ISRN Math Anal 2012 (2012), D Marker, M Messmer, A Pillay, Model Theory of Fields, Association for Symbolic Logic, Springer, New York, L Markus, Differential independence of Γ and ζ, J Dyn Differ Equations 19 (2007), 133Ű Ž Mijajlović, B Malešević, Differentially transcendental functions, Bull Belg Math Soc Simon Stevin 15 (2008), Department of Applied Mathematics (Received ) Faculty of Electrical Engineering (Revised ) University of Belgrade Serbia ivana@etfrs
by the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More informationChapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationMATH 551 - APPLIED MATRIX THEORY
MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More informationCONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationInner products on R n, and more
Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationSimilar matrices and Jordan form
Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More information[1] Diagonal factorization
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationA note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
More informationLinear Algebra Notes
Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationChapter 12 Modal Decomposition of State-Space Models 12.1 Introduction The solutions obtained in previous chapters, whether in time domain or transfor
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationa 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.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationEigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
More informationMatrices 2. Solving Square Systems of Linear Equations; Inverse Matrices
Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Solving square systems of linear equations; inverse matrices. Linear algebra is essentially about solving systems of linear equations,
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More informationQuestion 2: How do you solve a matrix equation using the matrix inverse?
Question : How do you solve a matrix equation using the matrix inverse? In the previous question, we wrote systems of equations as a matrix equation AX B. In this format, the matrix A contains the coefficients
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationMATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3
MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationSuk-Geun Hwang and Jin-Woo Park
Bull. Korean Math. Soc. 43 (2006), No. 3, pp. 471 478 A NOTE ON PARTIAL SIGN-SOLVABILITY Suk-Geun Hwang and Jin-Woo Park Abstract. In this paper we prove that if Ax = b is a partial signsolvable linear
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationChapter 20. Vector Spaces and Bases
Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationExamination paper for TMA4115 Matematikk 3
Department of Mathematical Sciences Examination paper for TMA45 Matematikk 3 Academic contact during examination: Antoine Julien a, Alexander Schmeding b, Gereon Quick c Phone: a 73 59 77 82, b 40 53 99
More informationNotes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 6. Eigenvalues and Singular Values In this section, we collect together the basic facts about eigenvalues and eigenvectors. From a geometrical viewpoint,
More information4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:
More informationSystem of First Order Differential Equations
CHAPTER System of First Order Differential Equations In this chapter, we will discuss system of first order differential equations. There are many applications that involving find several unknown functions
More informationMAT 242 Test 2 SOLUTIONS, FORM T
MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationApplied Linear Algebra I Review page 1
Applied Linear Algebra Review 1 I. Determinants A. Definition of a determinant 1. Using sum a. Permutations i. Sign of a permutation ii. Cycle 2. Uniqueness of the determinant function in terms of properties
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone
More information26. Determinants I. 1. Prehistory
26. Determinants I 26.1 Prehistory 26.2 Definitions 26.3 Uniqueness and other properties 26.4 Existence Both as a careful review of a more pedestrian viewpoint, and as a transition to a coordinate-independent
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationLinear Algebra Review. Vectors
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length
More informationLecture 5: Singular Value Decomposition SVD (1)
EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationMatrix Differentiation
1 Introduction Matrix Differentiation ( and some other stuff ) Randal J. Barnes Department of Civil Engineering, University of Minnesota Minneapolis, Minnesota, USA Throughout this presentation I have
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More information1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0
Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns are
More informationRecall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.
ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the n-dimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationIntroduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
More information5 Homogeneous systems
5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationMore than you wanted to know about quadratic forms
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences More than you wanted to know about quadratic forms KC Border Contents 1 Quadratic forms 1 1.1 Quadratic forms on the unit
More informationThe Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression
The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The SVD is the most generally applicable of the orthogonal-diagonal-orthogonal type matrix decompositions Every
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More informationSolving Systems of Linear Equations Using Matrices
Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationMath 550 Notes. Chapter 7. Jesse Crawford. Department of Mathematics Tarleton State University. Fall 2010
Math 550 Notes Chapter 7 Jesse Crawford Department of Mathematics Tarleton State University Fall 2010 (Tarleton State University) Math 550 Chapter 7 Fall 2010 1 / 34 Outline 1 Self-Adjoint and Normal Operators
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationUsing row reduction to calculate the inverse and the determinant of a square matrix
Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible
More information5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 5-1 Orthonormal
More information6. Cholesky factorization
6. Cholesky factorization EE103 (Fall 2011-12) triangular matrices forward and backward substitution the Cholesky factorization solving Ax = b with A positive definite inverse of a positive definite matrix
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
More informationElasticity Theory Basics
G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationMAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =
MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the
More informationEquations, Inequalities & Partial Fractions
Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities
More informationr (t) = 2r(t) + sin t θ (t) = r(t) θ(t) + 1 = 1 1 θ(t) 1 9.4.4 Write the given system in matrix form x = Ax + f ( ) sin(t) x y 1 0 5 z = dy cos(t)
Solutions HW 9.4.2 Write the given system in matrix form x = Ax + f r (t) = 2r(t) + sin t θ (t) = r(t) θ(t) + We write this as ( ) r (t) θ (t) = ( ) ( ) 2 r(t) θ(t) + ( ) sin(t) 9.4.4 Write the given system
More informationGeneral Framework for an Iterative Solution of Ax b. Jacobi s Method
2.6 Iterative Solutions of Linear Systems 143 2.6 Iterative Solutions of Linear Systems Consistent linear systems in real life are solved in one of two ways: by direct calculation (using a matrix factorization,
More informationThe Matrix Elements of a 3 3 Orthogonal Matrix Revisited
Physics 116A Winter 2011 The Matrix Elements of a 3 3 Orthogonal Matrix Revisited 1. Introduction In a class handout entitled, Three-Dimensional Proper and Improper Rotation Matrices, I provided a derivation
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute
More information