Linear Algebra

Total Page:16

File Type:pdf, Size:1020Kb

Linear Algebra Math 221: LINEAR ALGEBRA Chapter 8. Orthogonality §8-3. Positive Definite Matrices Le Chen1 Emory University, 2020 Fall (last updated on 11/10/2020) Creative Commons License (CC BY-NC-SA) 1 Slides are adapted from those by Karen Seyffarth from University of Calgary. Positive Definite Matrices Cholesky factorization – Square Root of a Matrix Definition An n × n matrix A is positive definite if it is symmetric and has positive eigenvalues, i.e., if λ is a eigenvalue of A, then λ > 0. Theorem If A is a positive definite matrix, then det(A) > 0 and A is invertible. Proof. Let λ1; λ2; : : : ; λn denote the (not necessarily distinct) eigenvalues of A. Since A is symmetric, A is orthogonally diagonalizable. In particular, A ∼ D, where D = diag(λ1; λ2; : : : ; λn). Similar matrices have the same determinant, so det(A) = det(D) = λ1λ2 ··· λn: Since A is positive definite, λi > 0 for all i, 1 ≤ i ≤ n; it follows that det(A) > 0, and therefore A is invertible. Positive Definite Matrices Theorem If A is a positive definite matrix, then det(A) > 0 and A is invertible. Proof. Let λ1; λ2; : : : ; λn denote the (not necessarily distinct) eigenvalues of A. Since A is symmetric, A is orthogonally diagonalizable. In particular, A ∼ D, where D = diag(λ1; λ2; : : : ; λn). Similar matrices have the same determinant, so det(A) = det(D) = λ1λ2 ··· λn: Since A is positive definite, λi > 0 for all i, 1 ≤ i ≤ n; it follows that det(A) > 0, and therefore A is invertible. Positive Definite Matrices Definition An n × n matrix A is positive definite if it is symmetric and has positive eigenvalues, i.e., if λ is a eigenvalue of A, then λ > 0. Proof. Let λ1; λ2; : : : ; λn denote the (not necessarily distinct) eigenvalues of A. Since A is symmetric, A is orthogonally diagonalizable. In particular, A ∼ D, where D = diag(λ1; λ2; : : : ; λn). Similar matrices have the same determinant, so det(A) = det(D) = λ1λ2 ··· λn: Since A is positive definite, λi > 0 for all i, 1 ≤ i ≤ n; it follows that det(A) > 0, and therefore A is invertible. Positive Definite Matrices Definition An n × n matrix A is positive definite if it is symmetric and has positive eigenvalues, i.e., if λ is a eigenvalue of A, then λ > 0. Theorem If A is a positive definite matrix, then det(A) > 0 and A is invertible. Positive Definite Matrices Definition An n × n matrix A is positive definite if it is symmetric and has positive eigenvalues, i.e., if λ is a eigenvalue of A, then λ > 0. Theorem If A is a positive definite matrix, then det(A) > 0 and A is invertible. Proof. Let λ1; λ2; : : : ; λn denote the (not necessarily distinct) eigenvalues of A. Since A is symmetric, A is orthogonally diagonalizable. In particular, A ∼ D, where D = diag(λ1; λ2; : : : ; λn). Similar matrices have the same determinant, so det(A) = det(D) = λ1λ2 ··· λn: Since A is positive definite, λi > 0 for all i, 1 ≤ i ≤ n; it follows that det(A) > 0, and therefore A is invertible. Proof. Since A is symmetric, there exists an orthogonal matrix P so that T P AP = diag(λ1; λ2; : : : ; λn) = D; where λ1; λ2; : : : ; λn are the (not necessarily distinct) eigenvalues of A. Let n T ~x 2 R , ~x 6= ~0, and define ~y = P ~x. Then ~xTA~x = ~xT(PDPT)~x = (~xTP)D(PT~x) = (PT~x)TD(PT~x) = ~yTD~y: T Writing ~y = y1 y2 ··· yn , 2 y1 3 6 y2 7 ~xTA~x = y y ··· y diag(λ ; λ ; : : : ; λ ) 6 7 1 2 n 1 2 n 6 . 7 4 . 5 yn 2 2 2 = λ1y1 + λ2y2 + ··· λnyn: Theorem A symmetric matrix A is positive definite if and only if ~xTA~x > 0 for all n ~x 2 R , ~x 6= ~0. Theorem A symmetric matrix A is positive definite if and only if ~xTA~x > 0 for all n ~x 2 R , ~x 6= ~0. Proof. Since A is symmetric, there exists an orthogonal matrix P so that T P AP = diag(λ1; λ2; : : : ; λn) = D; where λ1; λ2; : : : ; λn are the (not necessarily distinct) eigenvalues of A. Let n T ~x 2 R , ~x 6= ~0, and define ~y = P ~x. Then ~xTA~x = ~xT(PDPT)~x = (~xTP)D(PT~x) = (PT~x)TD(PT~x) = ~yTD~y: T Writing ~y = y1 y2 ··· yn , 2 y1 3 6 y2 7 ~xTA~x = y y ··· y diag(λ ; λ ; : : : ; λ ) 6 7 1 2 n 1 2 n 6 . 7 4 . 5 yn 2 2 2 = λ1y1 + λ2y2 + ··· λnyn: T (() Conversely, if ~x A~x > 0 whenever ~x 6= ~0, choose ~x = P~ej, where ~ej is th the j column of In. Since P is invertible, ~x 6= ~0, and thus T T ~y = P ~x = P (P~ej) = ~ej: Thus yj = 1 and yi = 0 when i 6= j, so 2 2 2 λ1y1 + λ2y2 + ··· λnyn = λj; T i.e., λj = ~x A~x > 0. Therefore, A is positive definite. Proof. (continued) n T ()) Suppose A is positive definite, and ~x 2 R , ~x 6= ~0. Since P is T ~ 2 invertible, ~y = P ~x 6= 0, and thus yj 6= 0 for some j, implying yj > 0 for 2 some j. Furthermore, since all eigenvalues of A are positive, λiyi ≥ 0 for all 2 T i; in particular λjyj > 0. Therefore, ~x A~x > 0. Proof. (continued) n T ()) Suppose A is positive definite, and ~x 2 R , ~x 6= ~0. Since P is T ~ 2 invertible, ~y = P ~x 6= 0, and thus yj 6= 0 for some j, implying yj > 0 for 2 some j. Furthermore, since all eigenvalues of A are positive, λiyi ≥ 0 for all 2 T i; in particular λjyj > 0. Therefore, ~x A~x > 0. T (() Conversely, if ~x A~x > 0 whenever ~x 6= ~0, choose ~x = P~ej, where ~ej is th the j column of In. Since P is invertible, ~x 6= ~0, and thus T T ~y = P ~x = P (P~ej) = ~ej: Thus yj = 1 and yi = 0 when i 6= j, so 2 2 2 λ1y1 + λ2y2 + ··· λnyn = λj; T i.e., λj = ~x A~x > 0. Therefore, A is positive definite. Proof. n Let ~x 2 R , ~x 6= ~0. Then ~xTA~x = ~xT(UTU)~x = (~xTUT)(U~x) = (U~x)T(U~x) = jjU~xjj2: Since U is invertible and ~x 6= ~0,U~x 6= ~0, and hence jjU~xjj2 > 0, i.e., T 2 ~x A~x = jjU~xjj > 0. Therefore, A is positive definite. Theorem (Constructing Positive Definite Matrices) Let U be an n × n invertible matrix, and let A = UTU. Then A is positive definite. Theorem (Constructing Positive Definite Matrices) Let U be an n × n invertible matrix, and let A = UTU. Then A is positive definite. Proof. n Let ~x 2 R , ~x 6= ~0. Then ~xTA~x = ~xT(UTU)~x = (~xTUT)(U~x) = (U~x)T(U~x) = jjU~xjj2: Since U is invertible and ~x 6= ~0,U~x 6= ~0, and hence jjU~xjj2 > 0, i.e., T 2 ~x A~x = jjU~xjj > 0. Therefore, A is positive definite. Lemma If A is an n × n positive definite matrix, then each principal submatrix of A is positive definite. Definition (r) Let A = aij be an n × n matrix. For 1 ≤ r ≤ n, A denotes the r × r submatrix in the upper left corner of A, i.e., (r) A = aij ; 1 ≤ i; j ≤ r: (1)A; (2)A;:::; (n)A are called the principal submatrices of A. Definition (r) Let A = aij be an n × n matrix. For 1 ≤ r ≤ n, A denotes the r × r submatrix in the upper left corner of A, i.e., (r) A = aij ; 1 ≤ i; j ≤ r: (1)A; (2)A;:::; (n)A are called the principal submatrices of A. Lemma If A is an n × n positive definite matrix, then each principal submatrix of A is positive definite. Proof. Suppose A is an n × n positive definite matrix. For any integer r, 1 ≤ r ≤ n, write A in block form as (r)AB A = ; CD where B is an r × (n − r) matrix, C is an (n − r) × r matrix, and D is an 2 y1 3 6 y2 7 2 y 3 6 7 1 6 . 7 y 6 . 7 6 2 7 6 7 (n − r) × (n − r) matrix. Let ~y = 6 . 7 6= ~0 and let ~x = 6 yr 7. Then 6 . 7 6 7 4 . 5 6 0 7 6 7 yr 6 . 7 4 . 5 0 ~x 6= ~0, and by the previous theorem, ~xTA~x > 0. Proof. (continued) But 2 y1 3 6 . 7 6 . 7 (r) 6 7 T AB 6 yr 7 T (r) ~x A~x = y1 ··· yr 0 ··· 0 6 7 = ~y A ~y; CD 6 0 7 6 7 6 . 7 4 . 5 0 and therefore ~yT (r)A ~y > 0. Then (r)A is positive definite again by the previous theorem. 4 = 2 × 2T 2 4 12 −163 2 2 0 03 22 6 −83 4 12 37 −435 = 4 6 1 05 40 1 5 5 −16 −43 98 −8 5 3 0 0 3 Theorem Let A be an n × n symmetric matrix. Then the following conditions are equivalent. 1. A is positive definite. 2. det((r)A) > 0 for r = 1; 2;:::; n. 3. A = UTU where U is upper triangular and has positive entries on its main diagonal.
Recommended publications
  • QUADRATIC FORMS and DEFINITE MATRICES 1.1. Definition of A
    QUADRATIC FORMS AND DEFINITE MATRICES 1. DEFINITION AND CLASSIFICATION OF QUADRATIC FORMS 1.1. Definition of a quadratic form. Let A denote an n x n symmetric matrix with real entries and let x denote an n x 1 column vector. Then Q = x’Ax is said to be a quadratic form. Note that a11 ··· a1n . x1 Q = x´Ax =(x1...xn) . xn an1 ··· ann P a1ixi . =(x1,x2, ··· ,xn) . P anixi 2 (1) = a11x1 + a12x1x2 + ... + a1nx1xn 2 + a21x2x1 + a22x2 + ... + a2nx2xn + ... + ... + ... 2 + an1xnx1 + an2xnx2 + ... + annxn = Pi ≤ j aij xi xj For example, consider the matrix 12 A = 21 and the vector x. Q is given by 0 12x1 Q = x Ax =[x1 x2] 21 x2 x1 =[x1 +2x2 2 x1 + x2 ] x2 2 2 = x1 +2x1 x2 +2x1 x2 + x2 2 2 = x1 +4x1 x2 + x2 1.2. Classification of the quadratic form Q = x0Ax: A quadratic form is said to be: a: negative definite: Q<0 when x =06 b: negative semidefinite: Q ≤ 0 for all x and Q =0for some x =06 c: positive definite: Q>0 when x =06 d: positive semidefinite: Q ≥ 0 for all x and Q = 0 for some x =06 e: indefinite: Q>0 for some x and Q<0 for some other x Date: September 14, 2004. 1 2 QUADRATIC FORMS AND DEFINITE MATRICES Consider as an example the 3x3 diagonal matrix D below and a general 3 element vector x. 100 D = 020 004 The general quadratic form is given by 100 x1 0 Q = x Ax =[x1 x2 x3] 020 x2 004 x3 x1 =[x 2 x 4 x ] x2 1 2 3 x3 2 2 2 = x1 +2x2 +4x3 Note that for any real vector x =06 , that Q will be positive, because the square of any number is positive, the coefficients of the squared terms are positive and the sum of positive numbers is always positive.
    [Show full text]
  • 8.3 Positive Definite Matrices
    8.3. Positive Definite Matrices 433 Exercise 8.2.25 Show that every 2 2 orthog- [Hint: If a2 + b2 = 1, then a = cos θ and b = sinθ for × cos θ sinθ some angle θ.] onal matrix has the form − or sinθ cosθ cos θ sin θ Exercise 8.2.26 Use Theorem 8.2.5 to show that every for some angle θ. sinθ cosθ symmetric matrix is orthogonally diagonalizable. − 8.3 Positive Definite Matrices All the eigenvalues of any symmetric matrix are real; this section is about the case in which the eigenvalues are positive. These matrices, which arise whenever optimization (maximum and minimum) problems are encountered, have countless applications throughout science and engineering. They also arise in statistics (for example, in factor analysis used in the social sciences) and in geometry (see Section 8.9). We will encounter them again in Chapter 10 when describing all inner products in Rn. Definition 8.5 Positive Definite Matrices A square matrix is called positive definite if it is symmetric and all its eigenvalues λ are positive, that is λ > 0. Because these matrices are symmetric, the principal axes theorem plays a central role in the theory. Theorem 8.3.1 If A is positive definite, then it is invertible and det A > 0. Proof. If A is n n and the eigenvalues are λ1, λ2, ..., λn, then det A = λ1λ2 λn > 0 by the principal axes theorem (or× the corollary to Theorem 8.2.5). ··· If x is a column in Rn and A is any real n n matrix, we view the 1 1 matrix xT Ax as a real number.
    [Show full text]
  • Inner Products and Norms (Part III)
    Inner Products and Norms (part III) Prof. Dan A. Simovici UMB 1 / 74 Outline 1 Approximating Subspaces 2 Gram Matrices 3 The Gram-Schmidt Orthogonalization Algorithm 4 QR Decomposition of Matrices 5 Gram-Schmidt Algorithm in R 2 / 74 Approximating Subspaces Definition A subspace T of a inner product linear space is an approximating subspace if for every x 2 L there is a unique element in T that is closest to x. Theorem Let T be a subspace in the inner product space L. If x 2 L and t 2 T , then x − t 2 T ? if and only if t is the unique element of T closest to x. 3 / 74 Approximating Subspaces Proof Suppose that x − t 2 T ?. Then, for any u 2 T we have k x − u k2=k (x − t) + (t − u) k2=k x − t k2 + k t − u k2; by observing that x − t 2 T ? and t − u 2 T and applying Pythagora's 2 2 Theorem to x − t and t − u. Therefore, we have k x − u k >k x − t k , so t is the unique element of T closest to x. 4 / 74 Approximating Subspaces Proof (cont'd) Conversely, suppose that t is the unique element of T closest to x and x − t 62 T ?, that is, there exists u 2 T such that (x − t; u) 6= 0. This implies, of course, that u 6= 0L. We have k x − (t + au) k2=k x − t − au k2=k x − t k2 −2(x − t; au) + jaj2 k u k2 : 2 2 Since k x − (t + au) k >k x − t k (by the definition of t), we have 2 2 1 −2(x − t; au) + jaj k u k > 0 for every a 2 F.
    [Show full text]
  • Newton's Method for the Matrix Square Root*
    MATHEMATICS OF COMPUTATION VOLUME 46, NUMBER 174 APRIL 1986, PAGES 537-549 Newton's Method for the Matrix Square Root* By Nicholas J. Higham Abstract. One approach to computing a square root of a matrix A is to apply Newton's method to the quadratic matrix equation F( X) = X2 - A =0. Two widely-quoted matrix square root iterations obtained by rewriting this Newton iteration are shown to have excellent mathematical convergence properties. However, by means of a perturbation analysis and supportive numerical examples, it is shown that these simplified iterations are numerically unstable. A further variant of Newton's method for the matrix square root, recently proposed in the literature, is shown to be, for practical purposes, numerically stable. 1. Introduction. A square root of an n X n matrix A with complex elements, A e C"x", is a solution X e C"*" of the quadratic matrix equation (1.1) F(X) = X2-A=0. A natural approach to computing a square root of A is to apply Newton's method to (1.1). For a general function G: CXn -* Cx", Newton's method for the solution of G(X) = 0 is specified by an initial approximation X0 and the recurrence (see [14, p. 140], for example) (1.2) Xk+l = Xk-G'{XkylG{Xk), fc = 0,1,2,..., where G' denotes the Fréchet derivative of G. Identifying F(X+ H) = X2 - A +(XH + HX) + H2 with the Taylor series for F we see that F'(X) is a linear operator, F'(X): Cx" ^ C"x", defined by F'(X)H= XH+ HX.
    [Show full text]
  • Sensitivity and Stability Analysis of Nonlinear Kalman Filters with Application to Aircraft Attitude Estimation
    Graduate Theses, Dissertations, and Problem Reports 2013 Sensitivity and stability analysis of nonlinear Kalman filters with application to aircraft attitude estimation Matthew Brandon Rhudy West Virginia University Follow this and additional works at: https://researchrepository.wvu.edu/etd Recommended Citation Rhudy, Matthew Brandon, "Sensitivity and stability analysis of nonlinear Kalman filters with application ot aircraft attitude estimation" (2013). Graduate Theses, Dissertations, and Problem Reports. 3659. https://researchrepository.wvu.edu/etd/3659 This Dissertation is protected by copyright and/or related rights. It has been brought to you by the The Research Repository @ WVU with permission from the rights-holder(s). You are free to use this Dissertation in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you must obtain permission from the rights-holder(s) directly, unless additional rights are indicated by a Creative Commons license in the record and/ or on the work itself. This Dissertation has been accepted for inclusion in WVU Graduate Theses, Dissertations, and Problem Reports collection by an authorized administrator of The Research Repository @ WVU. For more information, please contact [email protected]. SENSITIVITY AND STABILITY ANALYSIS OF NONLINEAR KALMAN FILTERS WITH APPLICATION TO AIRCRAFT ATTITUDE ESTIMATION by Matthew Brandon Rhudy Dissertation submitted to the Benjamin M. Statler College of Engineering and Mineral Resources at West Virginia University in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Aerospace Engineering Approved by Dr. Yu Gu, Committee Chairperson Dr. John Christian Dr. Gary Morris Dr. Marcello Napolitano Dr. Powsiri Klinkhachorn Department of Mechanical and Aerospace Engineering Morgantown, West Virginia 2013 Keywords: Attitude Estimation, Extended Kalman Filter, GPS/INS Sensor Fusion, Stochastic Stability Copyright 2013, Matthew B.
    [Show full text]
  • Amath/Math 516 First Homework Set Solutions
    AMATH/MATH 516 FIRST HOMEWORK SET SOLUTIONS The purpose of this problem set is to have you brush up and further develop your multi-variable calculus and linear algebra skills. The problem set will be very difficult for some and straightforward for others. If you are having any difficulty, please feel free to discuss the problems with me at any time. Don't delay in starting work on these problems! 1. Let Q be an n × n symmetric positive definite matrix. The following fact for symmetric matrices can be used to answer the questions in this problem. Fact: If M is a real symmetric n×n matrix, then there is a real orthogonal n×n matrix U (U T U = I) T and a real diagonal matrix Λ = diag(λ1; λ2; : : : ; λn) such that M = UΛU . (a) Show that the eigenvalues of Q2 are the square of the eigenvalues of Q. Note that λ is an eigenvalue of Q if and only if there is some vector v such that Qv = λv. Then Q2v = Qλv = λ2v, so λ2 is an eigenvalue of Q2. (b) If λ1 ≥ λ2 ≥ · · · ≥ λn are the eigen values of Q, show that 2 T 2 n λnkuk2 ≤ u Qu ≤ λ1kuk2 8 u 2 IR : T T Pn 2 We have u Qu = u UΛUu = i=1 λikuk2. The result follows immediately from bounds on the λi. (c) If 0 < λ < λ¯ are such that 2 T ¯ 2 n λkuk2 ≤ u Qu ≤ λkuk2 8 u 2 IR ; then all of the eigenvalues of Q must lie in the interval [λ; λ¯].
    [Show full text]
  • Matlib: Matrix Functions for Teaching and Learning Linear Algebra and Multivariate Statistics
    Package ‘matlib’ August 21, 2021 Type Package Title Matrix Functions for Teaching and Learning Linear Algebra and Multivariate Statistics Version 0.9.5 Date 2021-08-10 Maintainer Michael Friendly <[email protected]> Description A collection of matrix functions for teaching and learning matrix linear algebra as used in multivariate statistical methods. These functions are mainly for tutorial purposes in learning matrix algebra ideas using R. In some cases, functions are provided for concepts available elsewhere in R, but where the function call or name is not obvious. In other cases, functions are provided to show or demonstrate an algorithm. In addition, a collection of functions are provided for drawing vector diagrams in 2D and 3D. License GPL (>= 2) Language en-US URL https://github.com/friendly/matlib BugReports https://github.com/friendly/matlib/issues LazyData TRUE Suggests knitr, rglwidget, rmarkdown, carData, webshot2, markdown Additional_repositories https://dmurdoch.github.io/drat Imports xtable, MASS, rgl, car, methods VignetteBuilder knitr RoxygenNote 7.1.1 Encoding UTF-8 NeedsCompilation no Author Michael Friendly [aut, cre] (<https://orcid.org/0000-0002-3237-0941>), John Fox [aut], Phil Chalmers [aut], Georges Monette [ctb], Gaston Sanchez [ctb] 1 2 R topics documented: Repository CRAN Date/Publication 2021-08-21 15:40:02 UTC R topics documented: adjoint . .3 angle . .4 arc..............................................5 arrows3d . .6 buildTmat . .8 cholesky . .9 circle3d . 10 class . 11 cofactor . 11 cone3d . 12 corner . 13 Det.............................................. 14 echelon . 15 Eigen . 16 gaussianElimination . 17 Ginv............................................. 18 GramSchmidt . 20 gsorth . 21 Inverse............................................ 22 J............................................... 23 len.............................................. 23 LU.............................................. 24 matlib . 25 matrix2latex . 27 minor . 27 MoorePenrose .
    [Show full text]
  • Facts from Linear Algebra
    Appendix A Facts from Linear Algebra Abstract We introduce the notation of vector and matrices (cf. Section A.1), and recall the solvability of linear systems (cf. Section A.2). Section A.3 introduces the spectrum σ(A), matrix polynomials P (A) and their spectra, the spectral radius ρ(A), and its properties. Block structures are introduced in Section A.4. Subjects of Section A.5 are orthogonal and orthonormal vectors, orthogonalisation, the QR method, and orthogonal projections. Section A.6 is devoted to the Schur normal form (§A.6.1) and the Jordan normal form (§A.6.2). Diagonalisability is discussed in §A.6.3. Finally, in §A.6.4, the singular value decomposition is explained. A.1 Notation for Vectors and Matrices We recall that the field K denotes either R or C. Given a finite index set I, the linear I space of all vectors x =(xi)i∈I with xi ∈ K is denoted by K . The corresponding square matrices form the space KI×I . KI×J with another index set J describes rectangular matrices mapping KJ into KI . The linear subspace of a vector space V spanned by the vectors {xα ∈V : α ∈ I} is denoted and defined by α α span{x : α ∈ I} := aαx : aα ∈ K . α∈I I×I T Let A =(aαβ)α,β∈I ∈ K . Then A =(aβα)α,β∈I denotes the transposed H matrix, while A =(aβα)α,β∈I is the adjoint (or Hermitian transposed) matrix. T H Note that A = A holds if K = R . Since (x1,x2,...) indicates a row vector, T (x1,x2,...) is used for a column vector.
    [Show full text]
  • Similar 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. AT A is positive definite A matrix is positive definite if xT Ax > 0 for all x 6= 0. This is a very important class of matrices; positive definite matrices appear in the form of AT A when computing least squares solutions. In many situations, a rectangular matrix is multiplied by its transpose to get a square matrix. Given a symmetric positive definite matrix A, is its inverse also symmet­ ric and positive definite? Yes, because if the (positive) eigenvalues of A are −1 l1, l2, · · · ld then the eigenvalues 1/l1, 1/l2, · · · 1/ld of A are also positive. If A and B are positive definite, is A + B positive definite? We don’t know much about the eigenvalues of A + B, but we can use the property xT Ax > 0 and xT Bx > 0 to show that xT(A + B)x > 0 for x 6= 0 and so A + B is also positive definite. Now suppose A is a rectangular (m by n) matrix. A is almost certainly not symmetric, but AT A is square and symmetric. Is AT A positive definite? We’d rather not try to find the eigenvalues or the pivots of this matrix, so we ask when xT AT Ax is positive. Simplifying xT AT Ax is just a matter of moving parentheses: xT (AT A)x = (Ax)T (Ax) = jAxj2 ≥ 0.
    [Show full text]
  • On the Uniqueness of Euclidean Distance Matrix Completions Abdo Y
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Linear Algebra and its Applications 370 (2003) 1–14 www.elsevier.com/locate/laa On the uniqueness of Euclidean distance matrix completions Abdo Y. Alfakih Bell Laboratories, Lucent Technologies, Room 3J-310, 101 Crawfords Corner Road, Holmdel, NJ 07733-3030, USA Received 28 December 2001; accepted 18 December 2002 Submitted by R.A. Brualdi Abstract The Euclidean distance matrix completion problem (EDMCP) is the problem of determin- ing whether or not a given partial matrix can be completed into a Euclidean distance matrix. In this paper, we present necessary and sufficient conditions for a given solution of the EDMCP to be unique. © 2003 Elsevier Inc. All rights reserved. AMS classification: 51K05; 15A48; 52A05; 52B35 Keywords: Matrix completion problems; Euclidean distance matrices; Semidefinite matrices; Convex sets; Singleton sets; Gale transform 1. Introduction All matrices considered in this paper are real. An n × n matrix D = (dij ) is said to be a Euclidean distance matrix (EDM) iff there exist points p1,p2,...,pn in some i j 2 Euclidean space such that dij =p − p for all i, j = 1,...,n. It immediately follows that if D is EDM then D is symmetric with positive entries and with zero diagonal. We say matrix A = (aij ) is symmetric partial if only some of its entries are specified and aji is specified and equal to aij whenever aij is specified. The unspecified entries of A are said to be free. Given an n × n symmetric partial matrix A,ann × n matrix D is said to be a EDM completion of A iff D is EDM and Email address: [email protected] (A.Y.
    [Show full text]
  • Notes on Linear Algebra and Matrix Analysis
    Notes on Linear Algebra and Matrix Analysis Maxim Neumann May 2006, Version 0.1.1 1 Matrix Basics Literature to this topic: [1–4]. x†y ⇐⇒ < y,x >: standard inner product. x†x = 1 : x is normalized x†y = 0 : x,y are orthogonal x†y = 0, x†x = 1, y†y = 1 : x,y are orthonormal Ax = y is uniquely solvable if A is linear independent (nonsingular). Majorization: Arrange b and a in increasing order (bm,am) then: k k b majorizes a ⇐⇒ ∑ bmi ≥ ∑ ami ∀ k ∈ [1,...,n] (1) i=1 i=1 n n The collection of all vectors b ∈ R that majorize a given vector a ∈ R may be obtained by forming the convex hull of n! vectors, which are computed by permuting the n components of a. Direct sum of matrices A ∈ Mn1,B ∈ Mn2: A 0 A ⊕ B = ∈ M (2) 0 B n1+n2 [A,B] = traceAB†: matrix inner product. 1.1 Trace n traceA = ∑λi (3) i trace(A + B) = traceA + traceB (4) traceAB = traceBA (5) 1.2 Determinants The determinant det(A) expresses the volume of a matrix A. A is singular. Linear equation is not solvable. det(A) = 0 ⇐⇒ −1 (6) A does not exists vectors in A are linear dependent det(A) 6= 0 ⇐⇒ A is regular/nonsingular. Ai j ∈ R → det(A) ∈ R Ai j ∈ C → det(A) ∈ C If A is a square matrix(An×n) and has the eigenvalues λi, then det(A) = ∏λi detAT = detA (7) detA† = detA (8) detAB = detA detB (9) Elementary operations on matrix and determinant: Interchange of two rows : detA ∗ = −1 Multiplication of a row by a nonzero scalar c : detA ∗ = c Addition of a scalar multiple of one row to another row : detA = detA 1 2 EIGENVALUES, EIGENVECTORS, AND SIMILARITY 2 a b = ad − bc (10) c d 2 Eigenvalues, Eigenvectors, and Similarity σ(An×n) = {λ1,...,λn} is the set of eigenvalues of A, also called the spectrum of A.
    [Show full text]
  • Euclidean Distance Matrix Analysis (EDMA): Estimation of Mean Form and Mean Form Difference 1
    Mathematical Geology, Vol. 25, No. 5, 1993 Euclidean Distance Matrix Analysis (EDMA): Estimation of Mean Form and Mean Form Difference 1 Subhash Lele 2 Euclidean Distance Matrix Analysis (EDMA) of form is a coordinate free approach to the analysis of form using landmark data. In this paper, the problem of estimation of mean form, variance- covariance matrix, and mean form difference under the Gaussian perturbation model is considered using EDMA. The suggested estimators are based on the method of moments. They are shown to be consistent, that is as the sample size increases these estimators approach the true parameters. They are also shown to be computationally very simple. A method to improve their efficiency is suggested. Estimation in the presence of missing data is studied. In addition, it is shown that the superimposition method of estimation leads to incorrect mean form and variance-covariance struc- ture. KEY WORDS: coordinate free approach, invariance principle, moment estimators, non-central chi-square, nuisance parameters, procrustes methods, superimposition, missing data. INTRODUCTION Morphometrics, or the quantitative analysis of biological forms is an important subject. Many different kinds of data are utilized to analyze biological forms. Traditionally scientists have used various linear distances across the form. The technological advances in the last two decades have enabled the scientists to collect data on the complete outline of the object or coordinates of certain biological loci called landmarks, This paper concerns itself with the statistical analysis of landmark coordinate data. In particular, we suggest a method to estimate the mean form and variance-covariance parameters given a sample of n individuals from a population.
    [Show full text]