DOCSLIB.ORG

On an Algorithm of G. Birkhoff Concerning Doubly

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
On an Algorithm of G. Birkhoff Concerning Doubly ON AN ALGORITHM OF G. BIRKHOFF CONCERNING DOUBLY STOCHASTIC MATRICES Diane M. Johnson, A.L. Dulmage and N.S. Mendelsohn (received June 20, I960) In [1] G. Birkhoff stated an algorithm for expressing a doubly stochastic matrix as an average of permutation matrices. In this note we prove two graphical lemmas and use these to find an upper bound for the number of permutation matrices which the Birkhoff algorithm may use. A doubly stochastic matrix is a matrix of non-negative elements with row and column sums equal to unity and is there­ fore a square matrix. A permutation matrix is an n x n doubly stochastic matrix which has n^-n zeros and consequently has n ones, one in each row and one in each column. It has been shown by Birkhoff [1],Hoffman and Wielandt [5] and von Neumann [7] that the set of all doubly stochastic matrices, considered as a set of points in a space of n^ dimensions con­ stitute the convex hull of permutation matrices. In other words, any doubly stochastic matrix A is expressible as a linear combination cjA} + CZ-^Z + ••• + ct^t wnere tne Aj are permutation matrices and the c^ are ^ 0 with £3 c^ = 1. We say A is an average of Aj, A£, . .. , At. The graph of an m x n matrix A = (an) of non-negative elements is the bipartite graph K for which one vertex set is the set S=(sj, S2> •••> srn) of rows and the other vertex set is the set T = (t^, t£> . ••> tn) of columns* The unordered pair [S£, tj] is an edge of K if and only if a]j is greater than zero. The edges of K corresponding to the places where a 1 appears in a permutation matrix will be called a diagonal of edges of K. Research supported in part by the United States Air Force Office of Scientific Research under Contract AF49(638)-860. Canad. Math. Bull. vol. 3, no. 3, September I960 237 Downloaded from https://www.cambridge.org/core. 29 Sep 2021 at 10:55:44, subject to the Cambridge Core terms of use. In [3] and [4] the structure and canonical decomposition of a bipartite graph have been discussed and an irreducible graph has been defined in [4]. LEMMA 1. A bipartite graph K is the graph of some doubly stochastic matrix if and only if the canonical decompo­ sition of K is the disjoint union of irreducible subgraphs. Proof. Let A be an n X n doubly stochastic matrix and let K be its bipartite graph. Since a doubly stochastic matrix is an average A = c^A^ + c2"^2 + • • • + cf^t °^ Perma~ tation matrices, every non-zero element aii = cl e 1 + c2 e 2 + * • • + ct *~t w^ere £ i = 1 or 0 for all i and there exists at least one integer p, Upst, such that L p = 1. The presence of CpAp in the expression for A ensures that the edge [s^, tj] belongs to a diagonal of edges in K* Thus every edge of K is admissible [3.1 and the graph of K is identical with the first core of K. In the canonical decompo­ sition, as displayed in figure 1 of [4], there can be no rectan­ gular blocks such as Xj[ x W^ or U^ * V^ for each such block contains a subgraph of K which is the graph of a doubly stochastic submatrix of A and every doubly stochastic matrix is square. Thus the canonical decomposition of K consists of k disjoint irreducible subgraphs G± with vertex sets S^ and Conversely if K is the union of disjoint irreducible sub­ graphs, a doubly stochastic matrix A for which K is the graph can be constructed as follows. Let N be the number of edge s « There exists at least one diagonal containing each edge. Let A| be a pe-rmutation matrix the graph of which is a diagonal through the i th edge. The matrix 1 5T- n is a doubly stochastic matrix which has K as graph. In [3] the exterior dimension E(K) of a bipartite graph K is defined. LEMMA 2. Let K be an n x n bipartite graph which has a canonical decomposition consisting of k disjoint irredu­ cible subgraphs and let K1 be any proper subgraph of K which has a canonical decomposition consisting of k1 (k1 > k) disjoint irreducible subgraphs with E(K) = E(K!) = n. If p is the 238 Downloaded from https://www.cambridge.org/core. 29 Sep 2021 at 10:55:44, subject to the Cambridge Core terms of use. number of blocks of the core of the decomposition which have the same vertex sets in K and K!, and if N(K) and N(K!) are respectively the number of edges in K and K1 respectively, then N(K) - N(K!) > k« - p. Proof, Using the notation of [43 section 3, K is the union of k disjoint irreducible subgraphs G^ = (S^ x TjJ r\ K for i = 1, 2, . * , k. Let N(G|) = n^, nj -f n2 + . + n^ = N(K). K1 is the union of k! disjoint irreducible subgraphs 1 1 G'i = (S^ x T^) A K for i = 1, 2, .. , k . Let ! ! ! f ! NfG^) = n i, n x + n 2 + . + n k»= N(K ). We may index the blocks of the core so that we have G1^ C G^ for i = 1, 2, . .. , p. Thus n£ > n\ for i = 1, 2, . , p. There exist = k! qx > 1, q2 > 1, . , q^.p > 1, where <n + q2 + . + <lk-p " P> such that the union of the q^ disjoint irreducible subgraphs G!pfl> G,p+2> •••» G!pfqi îs a subgraph of Gj^i and, in general, the union of the qm disjoint irreducible subgraphs ! ! ! G , G „, . , G (h = q, + qo + . + q J ^m+1 hm+2 Vfe m l Z m'1 is a subgraph of G , m = 1, 2, . , k - p. ° p+ m Now consider the induced graph which results from the ï I 1 partitions Sp^l = S pfluS pf2 u ... uS ^^, ! G Tp+l = T p+x uT'p+2 u ... ^T'p+qx » pfl* Since ! (S'p+j x T p^j) n Gp^i is irreducible for j= 1, 2, ,.., qlt the induced qj X q^ bipartite graph I is irreducible by [4] theorem 3 and hence has at least 2q edges. Thus I has at ! least qx edges in addition to CS'^j, T ^.j ] , j = 1, 2, . • . , q1# It follows that Gp+i has at least q^ edges which are not edges of Glp+i uGlp+2 u ••• vGVqi* Thus qi n v n. + q pfi * Lj=1 Vj i and, similarly, V qm , p + m ^3=1 1^+j "m for m = 1, 2, ..., k-p. Thus k-p N(K) = I* ».+!*•* n + ^i=l i *~m=l p + m 239 Downloaded from https://www.cambridge.org/core. 29 Sep 2021 at 10:55:44, subject to the Cambridge Core terms of use. P n + k Pn + k > Z i=l i I '"r=l Vr Z rn=T l ** = N(Kf ) + k! - p. COROLLARY • Since p ék - 1, we have the weaker result N(K) - N(K') ^ (k« - k) + 1. Lemma 2 may be generalised as follows. If K is any n x n bipartite graph in which E(K) = n, and if K1 is any subgraph of K such that E(K!) = n, then the induced bipartite graph I con­ tains at least q^ edges at least one of which is not in G!p+1 u Glpf2 u • • • vjG,p+q' The rest of these ^1 edges are inadmissible in K1 and admissible in K. Accordingly, if u is the total number of inadmissible edges of K1 which are admis­ sible in K, N(K) - N(K!) + u > k1 - p. Let K be an n x n bipartite graph which is the union of disjoint irreducible subgraphs. Let t^ be the smallest integer such that every doubly stochastic matrix A for which K is the bipartite graph is expressible as an average of not more than t^ permutation matrices. It was mentioned in [2] that the algorithm described by Birkhoff [1] never requires more than n^ - n + 1 permutation matrices. It has been shown in [6] , using a dimen­ sional argument that tj^ ^ n2 - 2n + 2. However, this is an exis­ tence proof and does not show how to construct the average. The main result of this note is the following. THEOREM. Let A be an n x n doubly stochastic matrix with bipartite graph K. If N is the number of edges in K and k is the number of disjoint irreducible subgraphs in the canonical decomposition of K, then tk ^ N - 2n 4- k + 1, The Birkhoff algorithm expresses A as an average of at most t^ permutation matrices. Proof. The Birkhoff construction is as follows. Let ci be the smallest (possibly unique) non-zero element of A. There exists a diagonal of non-zeros of which c^ is the least. Let A^ be the permutation matrix with ones on this diagonal, and let 2 1 Ad) = A - cjAi. Repeating this process, let A< ) = A^ ) - c2A2. Continuing, there must exist an integer t such that A(t~^) = ^(t-2) . C£_j Afc_} and A'*"*) has a diagonal of n non-zero 240 Downloaded from https://www.cambridge.org/core. 29 Sep 2021 at 10:55:44, subject to the Cambridge Core terms of use. equal elements and n^ - n zeros. The integer t may vary depending on the choice of the diagonals, A^"*) = ctAt and A = c^Ai + C2A2 + • ' • + ctAf Denote A by A(°) and let K(i) be the graph of A^), i = 0, 1, 2, .
Load more

Recommended publications
  • MATH 2370, Practice Problems
    MATH 2370, Practice Problems Kiumars Kaveh Problem: Prove that an n × n complex matrix A is diagonalizable if and only if there is a basis consisting of eigenvectors of A. Problem: Let A : V ! W be a one-to-one linear map between two finite dimensional vector spaces V and W . Show that the dual map A0 : W 0 ! V 0 is surjective. Problem: Determine if the curve 2 2 2 f(x; y) 2 R j x + y + xy = 10g is an ellipse or hyperbola or union of two lines. Problem: Show that if a nilpotent matrix is diagonalizable then it is the zero matrix. Problem: Let P be a permutation matrix. Show that P is diagonalizable. Show that if λ is an eigenvalue of P then for some integer m > 0 we have λm = 1 (i.e. λ is an m-th root of unity). Hint: Note that P m = I for some integer m > 0. Problem: Show that if λ is an eigenvector of an orthogonal matrix A then jλj = 1. n Problem: Take a vector v 2 R and let H be the hyperplane orthogonal n n to v. Let R : R ! R be the reflection with respect to a hyperplane H. Prove that R is a diagonalizable linear map. Problem: Prove that if λ1; λ2 are distinct eigenvalues of a complex matrix A then the intersection of the generalized eigenspaces Eλ1 and Eλ2 is zero (this is part of the Spectral Theorem). 1 Problem: Let H = (hij) be a 2 × 2 Hermitian matrix. Use the Min- imax Principle to show that if λ1 ≤ λ2 are the eigenvalues of H then λ1 ≤ h11 ≤ λ2.
    [Show full text]
  • Lecture 2: Spectral Theorems
    Lecture 2: Spectral Theorems This lecture introduces normal matrices. The spectral theorem will inform us that normal matrices are exactly the unitarily diagonalizable matrices. As a consequence, we will deduce the classical spectral theorem for Hermitian matrices. The case of commuting families of matrices will also be studied. All of this corresponds to section 2.5 of the textbook. 1 Normal matrices Definition 1. A matrix A 2 Mn is called a normal matrix if AA∗ = A∗A: Observation: The set of normal matrices includes all the Hermitian matrices (A∗ = A), the skew-Hermitian matrices (A∗ = −A), and the unitary matrices (AA∗ = A∗A = I). It also " # " # 1 −1 1 1 contains other matrices, e.g. , but not all matrices, e.g. 1 1 0 1 Here is an alternate characterization of normal matrices. Theorem 2. A matrix A 2 Mn is normal iff ∗ n kAxk2 = kA xk2 for all x 2 C : n Proof. If A is normal, then for any x 2 C , 2 ∗ ∗ ∗ ∗ ∗ 2 kAxk2 = hAx; Axi = hx; A Axi = hx; AA xi = hA x; A xi = kA xk2: ∗ n n Conversely, suppose that kAxk = kA xk for all x 2 C . For any x; y 2 C and for λ 2 C with jλj = 1 chosen so that <(λhx; (A∗A − AA∗)yi) = jhx; (A∗A − AA∗)yij, we expand both sides of 2 ∗ 2 kA(λx + y)k2 = kA (λx + y)k2 to obtain 2 2 ∗ 2 ∗ 2 ∗ ∗ kAxk2 + kAyk2 + 2<(λhAx; Ayi) = kA xk2 + kA yk2 + 2<(λhA x; A yi): 2 ∗ 2 2 ∗ 2 Using the facts that kAxk2 = kA xk2 and kAyk2 = kA yk2, we derive 0 = <(λhAx; Ayi − λhA∗x; A∗yi) = <(λhx; A∗Ayi − λhx; AA∗yi) = <(λhx; (A∗A − AA∗)yi) = jhx; (A∗A − AA∗)yij: n ∗ ∗ n Since this is true for any x 2 C , we deduce (A A − AA )y = 0, which holds for any y 2 C , meaning that A∗A − AA∗ = 0, as desired.
    [Show full text]
  • Rotation Matrix - Wikipedia, the Free Encyclopedia Page 1 of 22
    Rotation matrix - Wikipedia, the free encyclopedia Page 1 of 22 Rotation matrix From Wikipedia, the free encyclopedia In linear algebra, a rotation matrix is a matrix that is used to perform a rotation in Euclidean space. For example the matrix rotates points in the xy -Cartesian plane counterclockwise through an angle θ about the origin of the Cartesian coordinate system. To perform the rotation, the position of each point must be represented by a column vector v, containing the coordinates of the point. A rotated vector is obtained by using the matrix multiplication Rv (see below for details). In two and three dimensions, rotation matrices are among the simplest algebraic descriptions of rotations, and are used extensively for computations in geometry, physics, and computer graphics. Though most applications involve rotations in two or three dimensions, rotation matrices can be defined for n-dimensional space. Rotation matrices are always square, with real entries. Algebraically, a rotation matrix in n-dimensions is a n × n special orthogonal matrix, i.e. an orthogonal matrix whose determinant is 1: . The set of all rotation matrices forms a group, known as the rotation group or the special orthogonal group. It is a subset of the orthogonal group, which includes reflections and consists of all orthogonal matrices with determinant 1 or -1, and of the special linear group, which includes all volume-preserving transformations and consists of matrices with determinant 1. Contents 1 Rotations in two dimensions 1.1 Non-standard orientation
    [Show full text]
  • COMPLEX MATRICES and THEIR PROPERTIES Mrs
    ISSN: 2277-9655 [Devi * et al., 6(7): July, 2017] Impact Factor: 4.116 IC™ Value: 3.00 CODEN: IJESS7 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY COMPLEX MATRICES AND THEIR PROPERTIES Mrs. Manju Devi* *Assistant Professor In Mathematics, S.D. (P.G.) College, Panipat DOI: 10.5281/zenodo.828441 ABSTRACT By this paper, our aim is to introduce the Complex Matrices that why we require the complex matrices and we have discussed about the different types of complex matrices and their properties. I. INTRODUCTION It is no longer possible to work only with real matrices and real vectors. When the basic problem was Ax = b the solution was real when A and b are real. Complex number could have been permitted, but would have contributed nothing new. Now we cannot avoid them. A real matrix has real coefficients in det ( A - λI), but the eigen values may complex. We now introduce the space Cn of vectors with n complex components. The old way, the vector in C2 with components ( l, i ) would have zero length: 12 + i2 = 0 not good. The correct length squared is 12 + 1i12 = 2 2 2 2 This change to 11x11 = 1x11 + …….. │xn│ forces a whole series of other changes. The inner product, the transpose, the definitions of symmetric and orthogonal matrices all need to be modified for complex numbers. II. DEFINITION A matrix whose elements may contain complex numbers called complex matrix. The matrix product of two complex matrices is given by where III. LENGTHS AND TRANSPOSES IN THE COMPLEX CASE The complex vector space Cn contains all vectors x with n complex components.
    [Show full text]
  • 7 Spectral Properties of Matrices
    7 Spectral Properties of Matrices 7.1 Introduction The existence of directions that are preserved by linear transformations (which are referred to as eigenvectors) has been discovered by L. Euler in his study of movements of rigid bodies. This work was continued by Lagrange, Cauchy, Fourier, and Hermite. The study of eigenvectors and eigenvalues acquired in- creasing significance through its applications in heat propagation and stability theory. Later, Hilbert initiated the study of eigenvalue in functional analysis (in the theory of integral operators). He introduced the terms of eigenvalue and eigenvector. The term eigenvalue is a German-English hybrid formed from the German word eigen which means “own” and the English word “value”. It is interesting that Cauchy referred to the same concept as characteristic value and the term characteristic polynomial of a matrix (which we introduce in Definition 7.1) was derived from this naming. We present the notions of geometric and algebraic multiplicities of eigen- values, examine properties of spectra of special matrices, discuss variational characterizations of spectra and the relationships between matrix norms and eigenvalues. We conclude this chapter with a section dedicated to singular values of matrices. 7.2 Eigenvalues and Eigenvectors Let A Cn×n be a square matrix. An eigenpair of A is a pair (λ, x) C (Cn∈ 0 ) such that Ax = λx. We refer to λ is an eigenvalue and to ∈x is× an eigenvector−{ } . The set of eigenvalues of A is the spectrum of A and will be denoted by spec(A). If (λ, x) is an eigenpair of A, the linear system Ax = λx has a non-trivial solution in x.
    [Show full text]
  • Lecture 7 We Know from a Previous Lecture Thatρ(A) a for Any ≤ ||| ||| � Chapter 6 + Appendix D: Location and Perturbation of Matrix Norm
    KTH ROYAL INSTITUTE OF TECHNOLOGY Eigenvalue Perturbation Results, Motivation Lecture 7 We know from a previous lecture thatρ(A) A for any ≤ ||| ||| � Chapter 6 + Appendix D: Location and perturbation of matrix norm. That is, we know that all eigenvalues are in a eigenvalues circular disk with radius upper bounded by any matrix norm. � Some other results on perturbed eigenvalue problems More precise results? � Chapter 8: Nonnegative matrices What can be said about the eigenvalues and eigenvectors of Magnus Jansson/Mats Bengtsson, May 11, 2016 A+�B when� is small? 2 / 29 Geršgorin circles Geršgorin circles, cont. Geršgorin’s Thm: LetA=D+B, whereD= diag(d 1,...,d n), IfG(A) contains a region ofk circles that are disjoint from the andB=[b ] M has zeros on the diagonal. Define rest, then there arek eigenvalues in that region. ij ∈ n n 0.6 r �(B)= b i | ij | j=1 0.4 �j=i � 0.2 ( , )= : �( ) ] C D B z C z d r B λ i { ∈ | − i |≤ i } Then, all eigenvalues ofA are located in imag[ 0 n λ (A) G(A) = C (D,B) k -0.2 k ∈ i ∀ i=1 � -0.4 TheC i (D,B) are called Geršgorin circles. 0 0.2 0.4 0.6 0.8 1 1.2 1.4 real[ λ] 3 / 29 4 / 29 Geršgorin, Improvements Invertibility and stability SinceA T has the same eigenvalues asA, we can do the same IfA M is strictly diagonally dominant such that ∈ n but summing over columns instead of rows. We conclude that n T aii > aij i λi (A) G(A) G(A ) i | | | |∀ ∈ ∩ ∀ j=1 �j=i � 1 SinceS − AS has the same eigenvalues asA, the above can be then “improved” by 1.
    [Show full text]
  • On Almost Normal Matrices
    W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 6-2013 On Almost Normal Matrices Tyler J. Moran College of William and Mary Follow this and additional works at: https://scholarworks.wm.edu/honorstheses Part of the Mathematics Commons Recommended Citation Moran, Tyler J., "On Almost Normal Matrices" (2013). Undergraduate Honors Theses. Paper 574. https://scholarworks.wm.edu/honorstheses/574 This Honors Thesis is brought to you for free and open access by the Theses, Dissertations, & Master Projects at W&M ScholarWorks. It has been accepted for inclusion in Undergraduate Honors Theses by an authorized administrator of W&M ScholarWorks. For more information, please contact [email protected]. On Almost Normal Matrices A thesis submitted in partial fulllment of the requirement for the degree of Bachelor of Science in Mathematics from The College of William and Mary by Tyler J. Moran Accepted for Ilya Spitkovsky, Director Charles Johnson Ryan Vinroot Donald Campbell Williamsburg, VA April 3, 2013 Abstract An n-by-n matrix A is called almost normal if the maximal cardinality of a set of orthogonal eigenvectors is at least n−1. We give several basic properties of almost normal matrices, in addition to studying their numerical ranges and Aluthge transforms. First, a criterion for these matrices to be unitarily irreducible is established, in addition to a criterion for A∗ to be almost normal and a formula for the rank of the self commutator of A. We then show that unitarily irreducible almost normal matrices cannot have flat portions on the boundary of their numerical ranges and that the Aluthge transform of A is never normal when n > 2 and A is unitarily irreducible and invertible.
    [Show full text]
  • Inclusion Relations Between Orthostochastic Matrices And
    Linear and Multilinear Algebra, 1987, Vol. 21, pp. 253-259 Downloaded By: [Li, Chi-Kwong] At: 00:16 20 March 2009 Photocopying permitted by license only 1987 Gordon and Breach Science Publishers, S.A. Printed in the United States of America Inclusion Relations Between Orthostochastic Matrices and Products of Pinchinq-- Matrices YIU-TUNG POON Iowa State University, Ames, lo wa 5007 7 and NAM-KIU TSING CSty Poiytechnic of HWI~K~tig, ;;e,~g ,?my"; 2nd A~~KI:Lkwe~ity, .Auhrn; Al3b3m-l36849 Let C be thc set of ail n x n urthusiuihaatic natiiccs and ;"', the se! of finite prnd~uctpof n x n pinching matrices. Both sets are subsets of a,, the set of all n x n doubly stochastic matrices. We study the inclusion relations between C, and 9'" and in particular we show that.'P,cC,b~t-~p,t~forn>J,andthatC~$~~fori123. 1. INTRODUCTION An n x n matrix is said to be doubly stochastic (d.s.) if it has nonnegative entries and ail row sums and column sums are 1. An n x n d.s. matrix S = (sij)is said to be orthostochastic (0.s.) if there is a unitary matrix U = (uij) such that 2 sij = luijl , i,j = 1, . ,n. Following [6], we write S = IUI2. The set of all n x n d.s. (or 0s.) matrices will be denoted by R, (or (I,, respectively). If P E R, can be expressed as 1-t (1 2 54 Y. T POON AND N K. TSING Downloaded By: [Li, Chi-Kwong] At: 00:16 20 March 2009 for some permutation matrix Q and 0 < t < I, then we call P a pinching matrix.
    [Show full text]
  • Section 6.1.2: the Schur Decomposition 6.1.3: Nonunitary Decompositions
    Section 6.1.2: The Schur Decomposition 6.1.3: Nonunitary Decompositions Jim Lambers March 22, 2021 • Now that we have answered the first of the two questions posed earlier, by identifying a class of matrices for which eigenvalues are easily obtained, we move to the second question: how can a general square matrix A be reduced to (block) triangular form, in such a way that its eigenvalues are preserved? • That is, we need to find a similarity transformation (that is, A P −1AP for some P ) that can bring A closer to triangular form, in some sense. n n×n • With this goal in mind, suppose that x 2 C is a normalized eigenvector of A 2 C (that is, kxk2 = 1), with eigenvalue λ. • Furthermore, suppose that P is a Householder reflection such that P x = e1. (this can be done based on Section 4.2) • Because P is complex, it is Hermitian, meaning that P H = P , and unitary, meaning that P H P = I. • This the generalization of a real Householder reflection being symmetric and orthogonal. • Therefore, P is its own inverse, so P e1 = x. • It follows that the matrix P H AP , which is a similarity transformation of A, satisfies H H H P AP e1 = P Ax = λP x = λP x = λe1: H H • That is, e1 is an eigenvector of P AP with eigenvalue λ, and therefore P AP has the block structure λ vH P H AP = : (1) 0 B • Therefore, λ(A) = fλg [ λ(B), which means that we can now focus on the (n − 1) × (n − 1) matrix B to find the rest of the eigenvalues of A.
    [Show full text]
  • Normal Matrix Polynomials with Nonsingular Leading Coefficients∗
    Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 17, pp. 458-472, September 2008 ELA NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS∗ NIKOLAOS PAPATHANASIOU† AND PANAYIOTIS PSARRAKOS† Abstract. In this paper, the notions of weakly normal and normal matrixpolynomials with nonsingular leading coefficients are introduced. These matrixpolynomials are characterized using orthonormal systems of eigenvectors and normal eigenvalues. The conditioning of the eigenvalue problem of a normal matrixpolynomial is also studied, thereby constructing an appropriate Jordan canonical form. Key words. Matrixpolynomial, Normal eigenvalue, Weighted perturbation, Condition number. AMS subject classifications. 15A18, 15A22, 65F15, 65F35. 1. Introduction. In pure and applied mathematics, normality of matrices (or operators) arises in many concrete problems. This is reflected in the fact that there are numerous ways to describe a normal matrix (or operator). A list of about ninety conditions on a square matrix equivalent to being normal can be found in [5, 7]. The study of matrix polynomials has also a long history, especially in the context of spectral analysis, leading to solutions of associated linear systems of higher order; see [6, 10, 11] and references therein. Surprisingly, it seems that the notion of nor- mality has been overlooked by people working in this area. Two exceptions are the work of Adam and Psarrakos [1], as well as Lancaster and Psarrakos [9]. Our present goal is to take a comprehensive look at normality of matrix poly- nomials. To avoid infinite eigenvalues, we restrict ourselves to matrix polynomials with nonsingular leading coefficients. The case of singular leading coefficients and infinite eigenvalues will be considered in future work.
    [Show full text]
  • Supplement: Symmetric and Hermitian Matrices
    Supplement: Symmetric and Hermitian Matrices A Bunch of Definitions Definition: A real n × n matrix A is called symmetric if AT = A. Definition: A complex n × n matrix A is called Hermitian if A∗ = A, where A∗ = AT , the conjugate transpose. Definition: A complex n × n matrix A is called normal if A∗A = AA∗, i.e. commutes with its conjugate transpose. It is quite a surprising result that these three kinds of matrices are always diagonalizable; and moreover, one can construct an orthonormal basis (in standard inner product) for Rn/Cn, consisting of eigenvectors of A. Hence the matrix P that gives diagonalization A = P DP −1 will be orthogonal/unitary, namely: T −1 T Definition: An n × n real matrix P is called orthogonal if P P = In, i.e. P = P . ∗ −1 ∗ Definition: An n × n complex matrix P is called unitary if P P = In, i.e. P = P . Diagonalization using these special kinds of P will have special names: Definition: A matrix A is called orthogonally diagonalizable if A is similar to a diagonal matrix D with an orthogonal matrix P , i.e. A = P DP T . A matrix A is called unitarily diagonalizable if A is similar to a diagonal matrix D with a unitary matrix P , i.e. A = P DP ∗. Then we have the following big theorems: Theorem: Every real n × n symmetric matrix A is orthogonally diagonalizable Theorem: Every complex n × n Hermitian matrix A is unitarily diagonalizable. Theorem: Every complex n × n normal matrix A is unitarily diagonalizable. To prove the above results, it is convenient to introduce the concept of adjoint operator, which allows us to discuss effectively the \transpose" operation in a general inner product space.
    [Show full text]
  • Orthogonal Polynomials in the Normal Matrix Model with a Cubic Potential
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Available online at www.sciencedirect.com Advances in Mathematics 230 (2012) 1272–1321 www.elsevier.com/locate/aim Orthogonal polynomials in the normal matrix model with a cubic potential Pavel M. Blehera, Arno B.J. Kuijlaarsb,∗ a Department of Mathematical Sciences, Indiana University-Purdue University Indianapolis, 402 N. Blackford St., Indianapolis, IN 46202, USA b Department of Mathematics, Katholieke Universiteit Leuven, Celestijnenlaan 200B bus 2400, 3001 Leuven, Belgium Received 29 June 2011; accepted 6 March 2012 Available online 23 April 2012 Communicated by Nikolai Makarov Abstract We consider the normal matrix model with a cubic potential. The model is ill-defined, and in order to regularize it, Elbau and Felder introduced a model with a cut-off and corresponding system of orthogonal polynomials with respect to a varying exponential weight on the cut-off region on the complex plane. In the present paper we show how to define orthogonal polynomials on a specially chosen system of infinite contours on the complex plane, without any cut-off, which satisfy the same recurrence algebraic identity that is asymptotically valid for the orthogonal polynomials of Elbau and Felder. The main goal of this paper is to develop the Riemann–Hilbert (RH) approach to the orthogonal polynomials under consideration and to obtain their asymptotic behavior on the complex plane as the degree n of the polynomial goes to infinity. As the first step in the RH approach, we introduce an auxiliary vector equilibrium problem for a pair of measures (µ1; µ2/ on the complex plane.
    [Show full text]