On Joint Eigenvalues of Commuting Matrices. R. Bhatia L. Elsner y. September 28, Abstract
|
|
- Jewel Snow
- 5 years ago
- Views:
Transcription
1 On Joint Eigenvalues of Commuting Matrices R. Bhatia L. Elsner y September 28, 994 Abstract A spectral radius formula for commuting tuples of operators has been proved in recent years. We obtain an analog for all the joint eigenvalues of a commuting tuple of matrices. For a single matrix this reduces to an old result of Yamamoto. Introduction, formulation of the result Let T = (T ; : : :; T s ) be an s-tuple of complex d d-matrices. The joint spectrum pt (T ) is the set of all points = ( ; : : :; s ) 2 C s (called joint eigenvalues) for which there exists a nonzero vector x 2 C d (called joint eigenvector) satisfying T j x = j x for j = ; : : :; s: () If the T 0 i s are commuting then pt(t ) 6= ;. The joint spectrum can be read o the diagonal of the common triangular form: There exists a unitary d d - matrix U such that U H T j U = 0 B@ (j) : : : : : : : : : 0 (j) 2 : : : : : : (j) d CA for j = ; : : :; s: (2) Indian Statistical Institute, Delhi centre, 7, SJS Sansanwal Marg, New Delhi 006, India. Supported by Sonderforschungsbereich 343 "Diskrete Modelle in der Mathematik". y Fakultat fur Mathematik, Universitat Bielefeld, Postfach 003, D-3350 Bielefeld, Germany.
2 Then pt (T ) = f i = ( () i ; : : :; (s) ) : i = ; : : :; dg: We order the joint eigenvalues according to their norms i jj jj : : : jj d jj: (3) Here jj:jj denotes the Euclidean norm in C r and will later on also denote the associated operator norm for matrices. We omit the reference to the dimensions. The s-tuple T can be identied with a linear operator mapping C d into C sd. If S = (S ; : : :; S m ) is another m-tuple of dd-matrices, we dene as T S the sm?tuple of matrices, whose entries are T i S j ; i = ; : : :; s; j = ; : : :m, ordered lexicographically. Continuing in this way we dene T m, consisting of s m entries, each of which is a product of m of the T 0 i s. Identifying again T m with an operator mapping C d into C sm d, T m has d singular values In this note we will prove s (T m ) s 2 (T m ) : : : s d (T m ): (4) Theorem For any s-tuple T = (T ; : : :; T s ) of commuting d d-matrices lim m! (s j (T m )) m = jj j jj j = ; : : :; d: (5) For j = this has been proved in [2], hence we know jj jj = lim m! (s (T m )) m : (6) We also remark that (6) has been proved in [] for l p?norms and in [5] for innite-dimensional Hilbert spaces. If s = then T m is the usual m-th power of T = T, and the joint spectrum is the usual spectrum. For this case (5) has been proved by Yamamoto [6], who showed that for a d d?matrix T with eigenvalues i ordered according to their moduli lim m! (s j (T m )) m = j j j j = ; : : :; d: (7) We will prove Theorem in the following section. 2
3 2 Proof of the Theorem It is convenient to introduce a Kronecker-type matrix product " ~ " in the following way: Let A and B be two (r,s) and (t,u) block matrices A = (A ij ) i=;:::;r; j=;:::;s B = (B ij ) i=;:::;t; j=;:::;u where the A ij and B ij are d d matrices. Dene A ij B = (A ij B kl ) k=;:::;t; l=;:::;u and the rt su - block matrix A ~ B = 0 B@ A B : : : A sb.. A r B : : : A rs B CA (8) of dimension rtd sud. This product is associative. For d = this is the usual Kronecker product, which we will denote by "", following the customary notation (see e.g. [4]). Except for d = however A ~ B is dierent from A B which is an rtd 2 sud 2 matrix. So the product depends on d. However in order to avoid an overload of indices and as we keep d xed throughout, we refrained from stressing this fact in the notation. The main relation for carries over to ~, namely (A ~ B)(C ~ D) = AC ~ BD (9) if all the blocks in B commute with those in C, and the dimensions are tting. For this it suces that AC and BD can be formed. We observe that T m, as dened in the rst section, has the representation T m = T ~ : : : ~ T as the m-fold product of T with itself. First we show that we can transform T to a simpler form without changing the magnitudes involved in (5). Then we prove the Theorem for this simple form using (6) and (7). Let S be a nonsingular d d - matrix, ~T i = ST i S? i = ; : : :; s; 3
4 and ~T = ( ~ T ; : : :; ~ T s ): Obviously the ~ T 0 i s commute too, and pt ( ~ T ) = pt (T ). We show s i ( ~ T m ) jjsjj jjs? jjs i (T m ) i = ; : : :; d; (0) which implies that the lefthand side of (5) is not changed if we replace T m by T ~ m. T m consists of s m blocks of d d matrices C i ; i = ; : : :; s m, each of which is a product of m of the T 0 s. Hence the corresponding block ~ i C i of T ~ m satises Ci ~ = SC i S?. Thus ( T ~ m ) H T ~ m Xs m = ~C H i ~C i () i= Xs m = (S? ) H ( C H i SH SC i )S? (2) i= jjsjj 2 (S? ) H (T m ) H T m S? (3) Here "" is the Loewner partial ordering. Let z 2 C d and x = Sz. The last inequality implies x H ( ~ T m ) H ~ T m x x H x jjsjj 2 jjs? jj 2 zh (T m ) H T m z : (4) z H z Using the Courant-Fischer representation of the eigenvalues : : : d of a hermitean d d matrix B (e.g. [4]) i = min dimv =d+?i max x2v;x6=0 x H Bx x H x for B = ( ~ T m ) H ~ T m and then for B = (T m ) H T m and taking (4) into account, (0) follows. Another transformation of T which doesn't change the numbers jj i jj is the following: Given a unitary s s-matrix U = (u ij ), let W = U I d, where I d is the unit matrix of dimension d, and i.e. ^T i = sx j= ^T = W T; (5) u ij T j i = ; : : :; s 4
5 Then it is obvious that the joint spectrum of ^T is given by the vectors ^i = U i ; i = ; : : :; d, where i 2 pt (T ). Hence jj^ i jj = jj i jj; i = ; : : :; d. Also by using (9) we get ^T m = (W T ) ~ : : : ~ (W T ) (6) = (W ~ : : : ~ W )(T ~ : : : ~ T ) (7) =: W (m) T m : (8) Again by (9) we see that W (m) dened in the last eaquation is a unitary mapping of C sm d into itself, hence s i ( ^T m ) = s i (T m ); i = ; : : :; d: Having now assembled our tools, we invoke a result in ([3], Vol.I, p. 224), by which there P exists a nonsingular d d? matrix S and positive integers t s ; : : :; s t with s i= i = d, such that where ~T i = ~T i = ST i S? = diag( ~ T i ; : : :; ~ T t i ) i = ; : : :; s; 0 B@ ~ i : : : : : :. 0.. : : : CA for i = ; : : :; s = ; : : :; t (9) 0 0 ~ i is an s s? matrix, upper triangular with constant diagonal. Observe that also ( T ~ m ) H T ~ m is block diagonal with s s blocks. This shows that we have to prove (5) only for T 0 i s of the form (9). Clearly then jj jj = : : : = jj d jj. Also by applying a suitable transformation of the form (5), we can assume that T 2 ; : : :; T d have zero diagonals, while the diagonal of T is jj jj. Now from (T m ) H T m (T m ) H T m we get (s (T m )) m (s i (T m )) m (s d (T m )) m i = ; : : :; d: But the leftmost term converges to jj jj by (6), while the rightmost term converges to minj i (T )j = jj jj by (7). Hence (5) holds for i = ; : : :; d. This nishes the proof. 5
6 References [] R. Bhatia and T. Bhattacharyya On the joint spectral radius of commuting matrices Preprint [2] M. Cho and T. Huruya, On the joint spectral radius Proc. Roy. Irish Acad. Sect. A 9, 39-44(99) [3] F.R. Gantmacher,The Theory of Matrices Chelsea, (977) [4] M. Marcus and H. Minc A Survey of Matrix Theory and Matrix inequalities Prindle, Weber and Schmidt, Boston (964) [5] V. Muller and A. Soltysiak Spectral radius formula for commuting Hilbert space operators Studia Mathematica 03(992), [6] T. Yamamoto On the extreme values of the roots of matrices J. Math. Soc. Japan 9, (967) 6
Infinite products and paracontracting matrices
Electronic Journal of Linear Algebra Volume 2 ELA Volume 2 (1997) Article 1 1997 Infinite products and paracontracting matrices Wolf-Jurgen Beyn beyn@math.uni.bielefeld.de Ludwig Elsner elsner@mathematik.uni-bielefeld.de
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationVICTORIA POWERS AND THORSTEN W ORMANN Suppose there exists a real, symmetric, psd matrix B such that f = x B x T and rank t. Since B is real symmetric
AN ALGORITHM FOR SUMS OF SQUARES OF REAL POLYNOMIALS Victoria Powers and Thorsten Wormann Introduction We present an algorithm to determine if a real polynomial is a sum of squares (of polynomials), and
More informationELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices
ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS KOLMAN & HILL NOTES BY OTTO MUTZBAUER 11 Systems of Linear Equations 1 Linear Equations and Matrices Numbers in our context are either real numbers or complex
More informationLecture notes on Quantum Computing. Chapter 1 Mathematical Background
Lecture notes on Quantum Computing Chapter 1 Mathematical Background Vector states of a quantum system with n physical states are represented by unique vectors in C n, the set of n 1 column vectors 1 For
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationEXAM. Exam 1. Math 5316, Fall December 2, 2012
EXAM Exam Math 536, Fall 22 December 2, 22 Write all of your answers on separate sheets of paper. You can keep the exam questions. This is a takehome exam, to be worked individually. You can use your notes.
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationStructured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control
Electronic Journal of Linear Algebra Volume 34 Volume 34 08) Article 39 08 Structured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control Christian Mehl Technische Universitaet
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationMath 489AB Exercises for Chapter 2 Fall Section 2.3
Math 489AB Exercises for Chapter 2 Fall 2008 Section 2.3 2.3.3. Let A M n (R). Then the eigenvalues of A are the roots of the characteristic polynomial p A (t). Since A is real, p A (t) is a polynomial
More informationNotes on matrix arithmetic geometric mean inequalities
Linear Algebra and its Applications 308 (000) 03 11 www.elsevier.com/locate/laa Notes on matrix arithmetic geometric mean inequalities Rajendra Bhatia a,, Fuad Kittaneh b a Indian Statistical Institute,
More informationMATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
More informationInterpolating the arithmetic geometric mean inequality and its operator version
Linear Algebra and its Applications 413 (006) 355 363 www.elsevier.com/locate/laa Interpolating the arithmetic geometric mean inequality and its operator version Rajendra Bhatia Indian Statistical Institute,
More informationOn the classication of algebras
Technische Universität Carolo-Wilhelmina Braunschweig Institut Computational Mathematics On the classication of algebras Morten Wesche September 19, 2016 Introduction Higman (1950) published the papers
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
More informationClarkson Inequalities With Several Operators
isid/ms/2003/23 August 14, 2003 http://www.isid.ac.in/ statmath/eprints Clarkson Inequalities With Several Operators Rajendra Bhatia Fuad Kittaneh Indian Statistical Institute, Delhi Centre 7, SJSS Marg,
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More information1 Vectors. Notes for Bindel, Spring 2017 Numerical Analysis (CS 4220)
Notes for 2017-01-30 Most of mathematics is best learned by doing. Linear algebra is no exception. You have had a previous class in which you learned the basics of linear algebra, and you will have plenty
More informationMoore Penrose inverses and commuting elements of C -algebras
Moore Penrose inverses and commuting elements of C -algebras Julio Benítez Abstract Let a be an element of a C -algebra A satisfying aa = a a, where a is the Moore Penrose inverse of a and let b A. We
More informationDEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular
form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix
More informationa~k) = (Q-1 A.Q)kk the (k, k)
196 INEQUALITffiS FOR THE OINT SPECTRUM OF SIMULTANEOUSLY TRIANGULARIZABLE MATRICES A. Pryde 1. INTRODUCTION Let A= (Al'..., A~ be an m-tuple of n by n matrices. We say that A is triangularizable if there
More informationTwo remarks on normality preserving Borel automorphisms of R n
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 3, No., February 3, pp. 75 84. c Indian Academy of Sciences Two remarks on normality preserving Borel automorphisms of R n K R PARTHASARATHY Theoretical Statistics
More informationSection 3.9. Matrix Norm
3.9. Matrix Norm 1 Section 3.9. Matrix Norm Note. We define several matrix norms, some similar to vector norms and some reflecting how multiplication by a matrix affects the norm of a vector. We use matrix
More informationOn Vector Product Algebras
On Vector Product Algebras By Markus Rost. This text contains some remarks on vector product algebras and the graphical techniques. It is partially contained in the diploma thesis of D. Boos and S. Maurer.
More information2 W. LAWTON, S. L. LEE AND ZUOWEI SHEN is called the fundamental condition, and a sequence which satises the fundamental condition will be called a fu
CONVERGENCE OF MULTIDIMENSIONAL CASCADE ALGORITHM W. LAWTON, S. L. LEE AND ZUOWEI SHEN Abstract. Necessary and sucient conditions on the spectrum of the restricted transition operators are given for the
More informationEdge Isoperimetric Theorems for Integer Point Arrays
Edge Isoperimetric Theorems for Integer Point Arrays R. Ahlswede, S.L. Bezrukov Universität Bielefeld, Fakultät für Mathematik Postfach 100131, 33501 Bielefeld, Germany Abstract We consider subsets of
More informationBackground on Linear Algebra - Lecture 2
Background on Linear Algebra - Lecture September 6, 01 1 Introduction Recall from your math classes the notion of vector spaces and fields of scalars. We shall be interested in finite dimensional vector
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationQuantum Information & Quantum Computing
Math 478, Phys 478, CS4803, February 9, 006 1 Georgia Tech Math, Physics & Computing Math 478, Phys 478, CS4803 Quantum Information & Quantum Computing Problems Set 1 Due February 9, 006 Part I : 1. Read
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationNumerical Programming I (for CSE)
Technische Universität München WT 1/13 Fakultät für Mathematik Prof. Dr. M. Mehl B. Gatzhammer January 1, 13 Numerical Programming I (for CSE) Tutorial 1: Iterative Methods 1) Relaxation Methods a) Let
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationOctober 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable
International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität
More informationMATRICES ARE SIMILAR TO TRIANGULAR MATRICES
MATRICES ARE SIMILAR TO TRIANGULAR MATRICES 1 Complex matrices Recall that the complex numbers are given by a + ib where a and b are real and i is the imaginary unity, ie, i 2 = 1 In what we describe below,
More informationHomework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.
Math 5327 Fall 2018 Homework 7 1. For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable. 3 1 0 (a) A = 1 2 0 1 1 0 x 3 1 0 Solution: 1 x 2 0
More informationStrict singularity of a Volterra-type integral operator on H p
Strict singularity of a Volterra-type integral operator on H p Santeri Miihkinen, University of Eastern Finland IWOTA Chemnitz, 14-18 August 2017 Santeri Miihkinen, UEF Volterra-type integral operator
More informationALUTHGE ITERATION IN SEMISIMPLE LIE GROUP. 1. Introduction Given 0 < λ < 1, the λ-aluthge transform of X C n n [4]:
Unspecified Journal Volume 00, Number 0, Pages 000 000 S????-????(XX)0000-0 ALUTHGE ITERATION IN SEMISIMPLE LIE GROUP HUAJUN HUANG AND TIN-YAU TAM Abstract. We extend, in the context of connected noncompact
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationDepartment of Mathematics Technical Report May 2000 ABSTRACT. for any matrix norm that is reduced by a pinching. In addition to known
University of Kentucky Lexington Department of Mathematics Technical Report 2000-23 Pinchings and Norms of Scaled Triangular Matrices 1 Rajendra Bhatia 2 William Kahan 3 Ren-Cang Li 4 May 2000 ABSTRACT
More informationSome bounds for the spectral radius of the Hadamard product of matrices
Some bounds for the spectral radius of the Hadamard product of matrices Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang, Tin-Yau Tam. June 1, 2004 Abstract Some bounds for the spectral radius of the Hadamard
More informationSingular Value Inequalities for Real and Imaginary Parts of Matrices
Filomat 3:1 16, 63 69 DOI 1.98/FIL16163C Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Singular Value Inequalities for Real Imaginary
More informationContents 1 Introduction and Preliminaries 1 Embedding of Extended Matrix Pencils 3 Hamiltonian Triangular Forms 1 4 Skew-Hamiltonian/Hamiltonian Matri
Technische Universitat Chemnitz Sonderforschungsbereich 393 Numerische Simulation auf massiv parallelen Rechnern Peter Benner Ralph Byers Volker Mehrmann Hongguo Xu Numerical Computation of Deating Subspaces
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More information76 Griesemer, Lewis, Siedentop the Dirac operator in the gap with the number of negative eigenvalues of a corresponding Schrodinger operator (see [5])
Doc. Math. J. DMV 75 A Minimax Principle for Eigenvalues in Spectral Gaps: Dirac Operators with Coulomb Potentials Marcel Griesemer, Roger T. Lewis, Heinz Siedentop Received: March 9, 999 Communicated
More informationDerivations, derivatives and chain rules
Linear Algebra and its Applications 302±303 (1999) 231±244 www.elsevier.com/locate/laa Derivations, derivatives and chain rules Rajendra Bhatia *, Kalyan B. Sinha 1 Indian Statistical Institute, 7, S.J.S.
More informationMath 310 Final Exam Solutions
Math 3 Final Exam Solutions. ( pts) Consider the system of equations Ax = b where: A, b (a) Compute deta. Is A singular or nonsingular? (b) Compute A, if possible. (c) Write the row reduced echelon form
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationSection 9.2: Matrices. Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns.
Section 9.2: Matrices Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns. That is, a 11 a 12 a 1n a 21 a 22 a 2n A =...... a m1 a m2 a mn A
More informationQUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE. Denitizable operators in Krein spaces have spectral properties similar to those
QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE BRANKO CURGUS and BRANKO NAJMAN Denitizable operators in Krein spaces have spectral properties similar to those of selfadjoint operators in Hilbert spaces.
More information1 Matrices and Systems of Linear Equations
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationMatrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
More informationMatrix Algebra. Matrix Algebra. Chapter 8 - S&B
Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number
More informationLinear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 2, pp. 83-93, December 994. Copyright 994,. ISSN 068-963. ETNA CONVERGENCE OF INFINITE PRODUCTS OF MATRICES AND INNER OUTER ITERATION SCHEMES RAFAEL
More informationarxiv: v1 [math.ca] 7 Jan 2015
Inertia of Loewner Matrices Rajendra Bhatia 1, Shmuel Friedland 2, Tanvi Jain 3 arxiv:1501.01505v1 [math.ca 7 Jan 2015 1 Indian Statistical Institute, New Delhi 110016, India rbh@isid.ac.in 2 Department
More informationComputational math: Assignment 1
Computational math: Assignment 1 Thanks Ting Gao for her Latex file 11 Let B be a 4 4 matrix to which we apply the following operations: 1double column 1, halve row 3, 3add row 3 to row 1, 4interchange
More informationNorm inequalities related to the matrix geometric mean
isid/ms/2012/07 April 20, 2012 http://www.isid.ac.in/ statmath/eprints Norm inequalities related to the matrix geometric mean RAJENDRA BHATIA PRIYANKA GROVER Indian Statistical Institute, Delhi Centre
More informationLecture Notes for Inf-Mat 3350/4350, Tom Lyche
Lecture Notes for Inf-Mat 3350/4350, 2007 Tom Lyche August 5, 2007 2 Contents Preface vii I A Review of Linear Algebra 1 1 Introduction 3 1.1 Notation............................... 3 2 Vectors 5 2.1 Vector
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationLINEAR MAPS PRESERVING NUMERICAL RADIUS OF TENSOR PRODUCTS OF MATRICES
LINEAR MAPS PRESERVING NUMERICAL RADIUS OF TENSOR PRODUCTS OF MATRICES AJDA FOŠNER, ZEJUN HUANG, CHI-KWONG LI, AND NUNG-SING SZE Abstract. Let m, n 2 be positive integers. Denote by M m the set of m m
More informationLecture 10 - Eigenvalues problem
Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems
More informationComputational Methods. Eigenvalues and Singular Values
Computational Methods Eigenvalues and Singular Values Manfred Huber 2010 1 Eigenvalues and Singular Values Eigenvalues and singular values describe important aspects of transformations and of data relations
More informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
More informationLinear Algebra in Actuarial Science: Slides to the lecture
Linear Algebra in Actuarial Science: Slides to the lecture Fall Semester 2010/2011 Linear Algebra is a Tool-Box Linear Equation Systems Discretization of differential equations: solving linear equations
More informationMath 502 Fall 2005 Solutions to Homework 3
Math 502 Fall 2005 Solutions to Homework 3 (1) As shown in class, the relative distance between adjacent binary floating points numbers is 2 1 t, where t is the number of digits in the mantissa. Since
More information5 and A,1 = B = is obtained by interchanging the rst two rows of A. Write down the inverse of B.
EE { QUESTION LIST EE KUMAR Spring (we will use the abbreviation QL to refer to problems on this list the list includes questions from prior midterm and nal exams) VECTORS AND MATRICES. Pages - of the
More informationp (z) = p z 1 pz : The pseudo-hyperbolic distance ½(z; w) between z and w in D is de ned by ½(z; w) = j z (w)j =
EXTREME POINTS OF THE CLOSED CONVEX HULL OF COMPOSITION OPERATORS TAKUYA HOSOKAW A Abstract. W e study the extreme points of the closed convex hull of the set of all composition operators on the space
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationMODELLING OF FLEXIBLE MECHANICAL SYSTEMS THROUGH APPROXIMATED EIGENFUNCTIONS L. Menini A. Tornambe L. Zaccarian Dip. Informatica, Sistemi e Produzione
MODELLING OF FLEXIBLE MECHANICAL SYSTEMS THROUGH APPROXIMATED EIGENFUNCTIONS L. Menini A. Tornambe L. Zaccarian Dip. Informatica, Sistemi e Produzione, Univ. di Roma Tor Vergata, via di Tor Vergata 11,
More informationAppendix C Vector and matrix algebra
Appendix C Vector and matrix algebra Concepts Scalars Vectors, rows and columns, matrices Adding and subtracting vectors and matrices Multiplying them by scalars Products of vectors and matrices, scalar
More information2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2
1 A Good Spectral Theorem c1996, Paul Garrett, garrett@math.umn.edu version February 12, 1996 1 Measurable Hilbert bundles Measurable Banach bundles Direct integrals of Hilbert spaces Trivializing Hilbert
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationSpectral properties of m-isometric operators
Functional Analysis, Approximation and Computation 4:2 (2012), 33 39 Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/faac Spectral properties
More informationOrthonormal Transformations
Orthonormal Transformations Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo October 25, 2010 Applications of transformation Q : R m R m, with Q T Q = I 1.
More information3.2 Gaussian Elimination (and triangular matrices)
(1/19) Solving Linear Systems 3.2 Gaussian Elimination (and triangular matrices) MA385/MA530 Numerical Analysis 1 November 2018 Gaussian Elimination (2/19) Gaussian Elimination is an exact method for solving
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationOn composition operators
On composition operators for which C 2 ϕ C ϕ 2 Sungeun Jung (Joint work with Eungil Ko) Department of Mathematics, Hankuk University of Foreign Studies 2015 KOTAC Chungnam National University, Korea June
More informationMath Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.
Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems
More informationDiagonal matrix solutions of a discrete-time Lyapunov inequality
Diagonal matrix solutions of a discrete-time Lyapunov inequality Harald K. Wimmer Mathematisches Institut Universität Würzburg D-97074 Würzburg, Germany February 3, 1997 Abstract Diagonal solutions of
More informationChapter 3 Least Squares Solution of y = A x 3.1 Introduction We turn to a problem that is dual to the overconstrained estimation problems considered s
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 informationBanach Journal of Mathematical Analysis ISSN: (electronic)
Banach J. Math. Anal. 6 (2012), no. 1, 139 146 Banach Journal of Mathematical Analysis ISSN: 1735-8787 (electronic) www.emis.de/journals/bjma/ AN EXTENSION OF KY FAN S DOMINANCE THEOREM RAHIM ALIZADEH
More informationKotoro Tanahashi and Atsushi Uchiyama
Bull. Korean Math. Soc. 51 (2014), No. 2, pp. 357 371 http://dx.doi.org/10.4134/bkms.2014.51.2.357 A NOTE ON -PARANORMAL OPERATORS AND RELATED CLASSES OF OPERATORS Kotoro Tanahashi and Atsushi Uchiyama
More informationSome bounds for the spectral radius of the Hadamard product of matrices
Some bounds for the spectral radius of the Hadamard product of matrices Tin-Yau Tam Mathematics & Statistics Auburn University Georgia State University, May 28, 05 in honor of Prof. Jean H. Bevis Some
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationBasic Concepts in Linear Algebra
Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University February 2, 2015 Grady B Wright Linear Algebra Basics February 2, 2015 1 / 39 Numerical Linear Algebra Linear
More informationAN ASYMPTOTIC BEHAVIOR OF QR DECOMPOSITION
Unspecified Journal Volume 00, Number 0, Pages 000 000 S????-????(XX)0000-0 AN ASYMPTOTIC BEHAVIOR OF QR DECOMPOSITION HUAJUN HUANG AND TIN-YAU TAM Abstract. The m-th root of the diagonal of the upper
More informationAN EXTENSION OF YAMAMOTO S THEOREM ON THE EIGENVALUES AND SINGULAR VALUES OF A MATRIX
Unspecified Journal Volume 00, Number 0, Pages 000 000 S????-????(XX)0000-0 AN EXTENSION OF YAMAMOTO S THEOREM ON THE EIGENVALUES AND SINGULAR VALUES OF A MATRIX TIN-YAU TAM AND HUAJUN HUANG Abstract.
More informationThe Singular Value Decomposition and Least Squares Problems
The Singular Value Decomposition and Least Squares Problems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 27, 2009 Applications of SVD solving
More informationComponentwise perturbation analysis for matrix inversion or the solution of linear systems leads to the Bauer-Skeel condition number ([2], [13])
SIAM Review 4():02 2, 999 ILL-CONDITIONED MATRICES ARE COMPONENTWISE NEAR TO SINGULARITY SIEGFRIED M. RUMP Abstract. For a square matrix normed to, the normwise distance to singularity is well known to
More informationLinear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains
Linear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 3, 3 Systems
More informationOrthogonal Symmetric Toeplitz Matrices
Orthogonal Symmetric Toeplitz Matrices Albrecht Böttcher In Memory of Georgii Litvinchuk (1931-2006 Abstract We show that the number of orthogonal and symmetric Toeplitz matrices of a given order is finite
More information