Distribution for the Standard Eigenvalues of Quaternion Matrices
|
|
- Alexander Bennett
- 5 years ago
- Views:
Transcription
1 International Mathematical Forum, Vol. 7, 01, no. 17, Distribution for the Standard Eigenvalues of Quaternion Matrices Shahid Qaisar College of Mathematics and Statistics, Chongqing University Chongqing, , P. R. China Limin Zou College of Mathematics and Statistics, Chongqing University Chongqing, , P. R. China Abstract This paper aims to estimate and locate the standard eigenvalues of quaternion matrices. We prove that all the standard eigenvalues of a central closed matrix are located in one Geršgorin ball. We shall conclude the paper with some numerical examples which will show the effectiveness of our new results. Mathematics Subject Classification: 15A18; 15A4; 15A60 Keywords: Quaternion matrices, Standard eigenvalues, Geršgorin ball 1 Introduction Quaternion was introduced by the Irish mathematician Hamilton ( in 1843[1]. Hamilton probably never thought that one day in the future the quaternions he had invented would be used in computer graphics, control theory, physics, and mechanics. In some differential equations problems involving the long-term stability of an oscillating system, one is sometimes interested in showing that the eigenvalues of a quaternion matrix all lie in the left half-plane. And sometimes in statistics or numerical analysis one needs to show that a Hermitian quaternion matrix is positive definite. It is well known that the main obstacle in the study of quaternion matrices is the non -commutative multiplication of quaternions. So, it is not easy to
2 83 S. Qaisar and L.Zou study quaternion algebra problems. However, quaternion algebra theory is becoming more and more important in recent years, and the study of quaternion matrices is still developing because of the above application [-4]. Throughout the paper, we use a set of notation and terminology. R and C are the set of the real and complex numbers, respectively. Let H be the normed vector space and skew field of real quaternions: H = {a = a 0 + a 1 i + a j + a 3 k, a 0,a 1,a,a 3 R}. It is common to use H for quaternion in honor of the inventor, Hamilton. For any a = a 0 + a 1 i + a j + a 3 k H, the conjugate of a is a = a = a 0 a 1 i a j a 3 k and the modulus of a is a = aā = āa =(a 0 + a 1 + a + a 3 1/. Let H n n and H n 1 be the collections of all n n matrices with entries in H and n-column vectors, respectively. Let I n and H (n, u be the collections of all n n unit matrices with entries in H and quaternion unitary matrix, respectively. For X H n 1,X T is the transpose of X. IfX =(x 1,x...x n T, then X =( x 1, x,..., x n T is the conjugate of X and X =( x 1, x,..., x n is the conjugate transpose of X. The modulus of X is defined to be X = X X. For an n n matrix A =(a ij n n (a ij H, the conjugate transpose of A is the n n matrix A = A T. The well-known Geršgorin theorem is one of fundamental theorems in complex matrix theory. It guarantees that all the eigenvalues of a matrix are located in the union of n Geršgorin disks. Recently, the Geršgorin theorem has been generalized to real quaternion division algebra [3, 5]. In this paper, we prove that all the standard eigenvalues of a central closed matrix are located in one Geršgorin ball. To do this, we need the following definitions and lemmas. Some definitions and lemmas Definition.1[6] Suppose that a is a given real quaternion and R is a positive real number. The set G = {z H : z a R} is said to be a Geršgorin ball with the center a and the radiusr. Definition. LetA =(a ij n n H n n. The Frobinus norm of A is defined by 1 n n A F = a ij = Tr(A A.. j=1 Lemma.3[4] Any n n quaternion matrix A has exact n right eigenvalues which are complex numbers with nonnegative imaginary parts. These eigenvalues are said to be the standard eigenvalues of A. Lemma.4[4] Let A = (a ij n n H n n. Then there exists a unitary
3 Standard eigenvalues of quaternion matrices 833 matrix U such that U AU is an upper triangular matrix with diagonal entries h 1 + k 1 i,,h n + k n i, where the h t + k t i s are the standard eigenvalues of A, i.e., k t 0,t=1,,,n. We denote the set of the standard eigenvalues of A by λ (A. The upper triangular matrix is said to be the Schur upper triangular matrix of A. Lemma.5[7] LetA =(a ij n n H n n. Suppose that the standard eigenvalues of A are λ 1,λ,,λ n. Then n λ i A 4 F AA F + A F. Lemma.6[4] If A =(a ij n n H n n is in triangular form, then every diagonal entries is a right eigenvalue of A. Definition.7[8] A quaternion matrix A is said to be a central closed matrix if there exists a invertible matrix P such that P 1 AP = diag (λ 1,λ,,λ n, where λ i s are real numbers. By Lemma.3 and Lemma.6, we see that λ i s are standard eigenvalues of A. Recall that the trace of a square complex matrix is the sum of main diagonal entries of the matrix, which is equal to the sum of the eigenvalues of the matrix. This is not always true in quaternion case. Example.8 Let ( 1 i A =. j k Then the trace of A is 1 + k. The standard eigenvalues of A are λ 1 = i and λ = i. Obviously, Tr(A λ 1 + λ. Fortunately we can show that the trace of central closed matrix is equal to the sum of the standard eigenvalues of the matrix. Lemma.9[8] Let A be an n n central closed matrix and suppose that the standard eigenvalues of A are λ 1,λ,,λ n. Then n Tr(A = λ i. It turns out that if A and B are n n complex matrices, then Tr(AB = Tr(BA. However, quaternion matrices are different from complex matrices. Example.10 Let A = ( i 0 0 i and B = ( k 0 0 k. Then Tr(AB Tr(BA.
4 834 S. Qaisar and L.Zou The following is the generalization of the result Tr(AB = Tr(BA of complex matrices to quaternion matrices, which will be used in the distribution for the standard eigenvalues of quaternion matrices. Lemma.11 Let A =(a ij n n H n n and B =(b ij n n H n n. Then Re (Tr(AB = Re (Tr(BA. For quaternion matrices, we know that left row rank is equal to right column rank. Both of them are equal to rank (A. It is easy to show that if an n n central closed matrix A hassnon-zero standard eigenvalues, then rank (A s. Lemma.1 Let A be an n n central closed matrix and suppose that the standard eigenvalues of A are λ 1,λ,,λ n and λ 1,λ,,λ s 0. Then Tr(A rank (A A 4 F AA F + A F. Proof. By Lemma.9, we have Tr(A s = λ i. Using Lemma.5, it is easy to see the following s s s λ i s λ i rank (A λ i rank (A A 4 F AA F + A F. So the lemma is proved. Lemma.13 Let A be an n n central closed matrix and λ be a standard eigenvalue of A. Suppose that F (A = AA F A F, then F (A =F (λi A. Proof. It is easy to see that F (A R, λ R and F (λi A R. Since F (λi A = (λi A(λI A F (λi A we have = Tr((λI A(λI A (λi A(λI A Tr((λI A (λi A (λi A(λI A, F (λi A =F (A+Tr(λ (A AA + A A A λ (A AA + AAA + AA A + AA A. By Lemma.11, we have that is So the lemma is proved. Re (F (λi A = Re (F (A, F (A =F (λi A. F
5 Standard eigenvalues of quaternion matrices Main Results We now focus on the location of the standard eigenvalues of quaternion matrices. Theorem 3.1 Let A be an n n central closed matrix. Then all the standard eigenvalues λ of A are located in the following Geršgorin ball: { G (A = z H : z Tr(A } n R (A, where R (A = n 1 n 1 F Tr(A η = ( A n Proof. Let B = λi A. Then By Lemma.1, we have Tr(B rank (B Using Lemma.13, we have n 1 n η + η n 1 F (A, n, F (A = AA F A F. rank (B =rank (λi A n 1. B 4F F (B (n 1 B 4 F F (B. F (B =F (A. Thus We compute Tr(λI A (n 1 λi A 4 F F (A. (1 Tr(λI A = Tr(λI A Tr(λI A = n λ λnt r ( A λnt r (A+ Tr(A, λi A 4 F =[Tr((λI A (λi A ] = ( nλ λt r (A λt r (A+Tr(AA Let Then = ( nλ λt r (A λt r (A+ A F. ω = nλ λt r ( A λt r (A. Tr(λI A = nω + Tr(A, (
6 836 S. Qaisar and L.Zou λi A 4 F = ( ω + A F. (3 So, taking the four fundamental operations of arithmetic of ( and (3 permits us to eliminate the unknown ω and obtain ( 1 λi A 4 F = ( Tr(λI A Tr(A + A F. n Let x = λ Tr(A n and η = ( A F Tr(A n.thus λi A 4 F =(nx + η and therefore n x (n 1 (nx + η F (A. The discriminant of n x =(n 1 (nx + η F (A is Then, we obtain x = λ Tr(A n Δ=4n (n 1 ( n η (n 1 F (A 0. n 1 n 1 n 1 n η + η n 1 F (A, n i.e. λ Tr(A n n 1 n 1 n 1 n η + η n 1 n F (A. So λ (A G (A. Then all the standard eigenvalues λ of A are located in one Geršgorin ball. Definition 3. LetA =(a ij n n H n n be given. If A = A, then A is a selfconjugate matrix over quaternion division algebra. The set of self-conjugate quaternion matrices remarked by H (n,. Theorem 3.3 Let A H (n,. Then all the standard eigenvalues λ of A are located in the following Geršgorin ball { G (A = z H : z Tr(A } n R (A, where R (A = n 1 η and η = ( A n F Tr(A n. Proof. Since A H (n,, we have F (A = AA A F =0. F Thus the theorem holds.
7 Standard eigenvalues of quaternion matrices Numerical examples Example 4.1 Let A = ( 0 j 0 1 and P = ( 1 1 j 0. Then ( ( ( ( ( 0 j 0 j 0 j P 1 =, P 1 j 1 AP = = 1 j 0 1 j So A is a central closed matrix. By Theorem 3.1, we have that all the standard eigenvalues of A lie in Geršgorin ball around o =0.5 of radius R We calculate that the standard eigenvalues of A are λ 1 = 1 and λ = 0. It is easy to see that the estimation isn t gross. Example 4. Let A = and P = Then P 1 AP = So A is a central closed matrix. By Theorem 3.1, we have that all the standard eigenvalues of A lie in Geršgorin ball around o = of radius R We calculate that the standard eigenvalues of A are λ 1 = 3,λ =, and λ 3 = 11. It is not hard to see that the estimation is quite accurate. Example 4.3 Let 1 i j k i 1 k j A = j k 7 i. k j i 1 Then A is a self-conjugate matrix over quaternion division algebra. By Theorem 3.3, we have that all the standard eigenvalues of A lie in Geršgorin ball around o =.5 of radius R We calculate that the standard eigenvalues of A are λ 1 =1,λ = 1, λ 3 =, and λ 4 = 8. It is not hard to see that the estimation is very sharp. 5 Conclusion Nowadays quaternions are not only part of contemporary mathematics (algebra, analysis, geometry, and computation, but they are also widely and.
8 838 S. Qaisar and L.Zou heavily used in programming video games and controlling spacecrafts. In this paper, we present some results for the standard eigenvalues of quaternion matrices. These results may be useful to further study other algebra problems over quaternion division algebra. Let A be a central closed matrix. Since P 1 AP has the same standard eigenvalues as A whenever P is invertible. We can apply the Theorem 3.1 to P 1 AP, perhaps for some choice of P the bounds obtained may be sharper. Now, we have three questions as follows. Question 1 What kind of P satisfy R (P 1 AP <R(A? Question What is the minimal radius of G (A? Question 3 When we find the minimal radius of G (A, is G (A the minimal Gerschgorin ball which contains all the standard eigenvalues of A? How can we find the minimal Gerschgorin ball which contains all the standard eigenvalues of A? ACKNOWLEDGEMENTS. The authors wish to express their heartfelt thanks to Professor Chuanjiang He and Professor Sabir Hussain for their detailed and helpful suggestions for revising the manuscript. References [1] B. L. van der Waerden, Hamilton s discovery of quaternions. Math. Magazine 49( [] R. Goldman. Understanding quaternions. Graphical Models. 73( [3] L. Zou, Y. Jiang, J. Wu. Location for the right eigenvalues of quaternion matrices. J Appl Math Comput, In Press. [4] F. Zhang. Quaternions and matrices of quaternions. Linear Algebra Appl. 51( [5] F. Zhang. Geršgorin type theorems for quaternionic matrices. Linear Algebra Appl. 44( [6] J. Wu. Distribution and estimation for eigenvalues of real quaternion matrices. Comput Math Appl. 55( [7] R. Kress, H. L. De Vries, R. Wegmann. On nonnormal matrices. Linear Algebra Appl. 8( [8] B. Tu. The generalization of Schur theorem over quaternion division ring. Chinese Annals of Mathematics. 1988( Received: November, 011
The estimation of eigenvalues of sum, difference, and tensor product of matrices over quaternion division algebra
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 3023 3033 www.elsevier.com/locate/laa The estimation of eigenvalues of sum, difference, and tensor product of matrices
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 8 Lecture 8 8.1 Matrices July 22, 2018 We shall study
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
1.1. Introduction SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to 1.1. Introduction Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More informationMassachusetts Institute of Technology Department of Economics Statistics. Lecture Notes on Matrix Algebra
Massachusetts Institute of Technology Department of Economics 14.381 Statistics Guido Kuersteiner Lecture Notes on Matrix Algebra These lecture notes summarize some basic results on matrix algebra used
More information18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in
806 Problem Set 8 - Solutions Due Wednesday, 4 November 2007 at 4 pm in 2-06 08 03 Problem : 205+5+5+5 Consider the matrix A 02 07 a Check that A is a positive Markov matrix, and find its steady state
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 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 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 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 informationMATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006
MATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006 Sherod Eubanks HOMEWORK 2 2.1 : 2, 5, 9, 12 2.3 : 3, 6 2.4 : 2, 4, 5, 9, 11 Section 2.1: Unitary Matrices Problem 2 If λ σ(u) and U M n is unitary, show that
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationSome inequalities for unitarily invariant norms of matrices
Wang et al Journal of Inequalities and Applications 011, 011:10 http://wwwjournalofinequalitiesandapplicationscom/content/011/1/10 RESEARCH Open Access Some inequalities for unitarily invariant norms of
More informationMatrix Inequalities by Means of Block Matrices 1
Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,
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 informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationLinear Algebra Lecture Notes-II
Linear Algebra Lecture Notes-II Vikas Bist Department of Mathematics Panjab University, Chandigarh-64 email: bistvikas@gmail.com Last revised on March 5, 8 This text is based on the lectures delivered
More informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.2: Fundamentals 2 / 31 Eigenvalues and Eigenvectors Eigenvalues and eigenvectors of
More informationGENERAL ARTICLE Realm of Matrices
Realm of Matrices Exponential and Logarithm Functions Debapriya Biswas Debapriya Biswas is an Assistant Professor at the Department of Mathematics, IIT- Kharagpur, West Bengal, India. Her areas of interest
More informationDiagonalization. P. Danziger. u B = A 1. B u S.
7., 8., 8.2 Diagonalization P. Danziger Change of Basis Given a basis of R n, B {v,..., v n }, we have seen that the matrix whose columns consist of these vectors can be thought of as a change of basis
More informationEigenvalues and Eigenvectors
/88 Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Eigenvalue Problem /88 Eigenvalue Equation By definition, the eigenvalue equation for matrix
More informationMatrices A brief introduction
Matrices A brief introduction Basilio Bona DAUIN Politecnico di Torino Semester 1, 2014-15 B. Bona (DAUIN) Matrices Semester 1, 2014-15 1 / 44 Definitions Definition A matrix is a set of N real or complex
More informationMINIMAL NORMAL AND COMMUTING COMPLETIONS
INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 4, Number 1, Pages 5 59 c 8 Institute for Scientific Computing and Information MINIMAL NORMAL AND COMMUTING COMPLETIONS DAVID P KIMSEY AND
More information2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian
FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian
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 informationEigenvalues and Eigenvectors: An Introduction
Eigenvalues and Eigenvectors: An Introduction The eigenvalue problem is a problem of considerable theoretical interest and wide-ranging application. For example, this problem is crucial in solving systems
More informationA Brief Outline of Math 355
A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting
More informationMath Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT
Math Camp II Basic Linear Algebra Yiqing Xu MIT Aug 26, 2014 1 Solving Systems of Linear Equations 2 Vectors and Vector Spaces 3 Matrices 4 Least Squares Systems of Linear Equations Definition A linear
More informationACM 104. Homework Set 5 Solutions. February 21, 2001
ACM 04 Homework Set 5 Solutions February, 00 Franklin Chapter 4, Problem 4, page 0 Let A be an n n non-hermitian matrix Suppose that A has distinct eigenvalues λ,, λ n Show that A has the eigenvalues λ,,
More informationGeneralized Numerical Radius Inequalities for Operator Matrices
International Mathematical Forum, Vol. 6, 011, no. 48, 379-385 Generalized Numerical Radius Inequalities for Operator Matrices Wathiq Bani-Domi Department of Mathematics Yarmouk University, Irbed, Jordan
More informationDifferential Topology Final Exam With Solutions
Differential Topology Final Exam With Solutions Instructor: W. D. Gillam Date: Friday, May 20, 2016, 13:00 (1) Let X be a subset of R n, Y a subset of R m. Give the definitions of... (a) smooth function
More informationCLASSICAL GROUPS DAVID VOGAN
CLASSICAL GROUPS DAVID VOGAN 1. Orthogonal groups These notes are about classical groups. That term is used in various ways by various people; I ll try to say a little about that as I go along. Basically
More informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
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 informationLecture notes: Applied linear algebra Part 1. Version 2
Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and
More informationEigenvalues and Eigenvectors
Chapter 1 Eigenvalues and Eigenvectors Among problems in numerical linear algebra, the determination of the eigenvalues and eigenvectors of matrices is second in importance only to the solution of linear
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful
More informationHomework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)
CS 106 Spring 2004 Homework 1 Elena Davidson 8 April 2004 Problem 1.1 Let B be a 4 4 matrix to which we apply the following operations: 1. double column 1, 2. halve row 3, 3. add row 3 to row 1, 4. interchange
More informationUp to this point, our main theoretical tools for finding eigenvalues without using det{a λi} = 0 have been the trace and determinant formulas
Finding Eigenvalues Up to this point, our main theoretical tools for finding eigenvalues without using det{a λi} = 0 have been the trace and determinant formulas plus the facts that det{a} = λ λ λ n, Tr{A}
More informationEIGENVALUE PROBLEMS. Background on eigenvalues/ eigenvectors / decompositions. Perturbation analysis, condition numbers..
EIGENVALUE PROBLEMS Background on eigenvalues/ eigenvectors / decompositions Perturbation analysis, condition numbers.. Power method The QR algorithm Practical QR algorithms: use of Hessenberg form and
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 informationFirst, we review some important facts on the location of eigenvalues of matrices.
BLOCK NORMAL MATRICES AND GERSHGORIN-TYPE DISCS JAKUB KIERZKOWSKI AND ALICJA SMOKTUNOWICZ Abstract The block analogues of the theorems on inclusion regions for the eigenvalues of normal matrices are given
More informationEigenvalues and Eigenvectors
5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS nn Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),
More informationThe Singular Value Decomposition
The Singular Value Decomposition Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) SVD Fall 2015 1 / 13 Review of Key Concepts We review some key definitions and results about matrices that will
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationLecture 1 Review: Linear models have the form (in matrix notation) Y = Xβ + ε,
2. REVIEW OF LINEAR ALGEBRA 1 Lecture 1 Review: Linear models have the form (in matrix notation) Y = Xβ + ε, where Y n 1 response vector and X n p is the model matrix (or design matrix ) with one row for
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationKnowledge Discovery and Data Mining 1 (VO) ( )
Knowledge Discovery and Data Mining 1 (VO) (707.003) Review of Linear Algebra Denis Helic KTI, TU Graz Oct 9, 2014 Denis Helic (KTI, TU Graz) KDDM1 Oct 9, 2014 1 / 74 Big picture: KDDM Probability Theory
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationDuke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014
Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014 Linear Algebra A Brief Reminder Purpose. The purpose of this document
More informationMath Spring 2011 Final Exam
Math 471 - Spring 211 Final Exam Instructions The following exam consists of three problems, each with multiple parts. There are 15 points available on the exam. The highest possible score is 125. Your
More informationSymmetric and anti symmetric matrices
Symmetric and anti symmetric matrices In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, matrix A is symmetric if. A = A Because equal matrices have equal
More informationUniversity of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm
University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm Name: The proctor will let you read the following conditions
More informationAlgebra I Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary
More informationChapter 1. Matrix Calculus
Chapter 1 Matrix Calculus 11 Definitions and Notation We assume that the reader is familiar with some basic terms in linear algebra such as vector spaces, linearly dependent vectors, matrix addition and
More informationDiagonalizing Matrices
Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B
More informationInternational Journal of Mathematics Trends and Technology (IJMTT) Volume 48 Number 4 August 2017
International Journal of Mathematics Trends and Technology (IJMTT) Volume 48 Number 4 August 27 On Bicomplex Representation Methods and Application of uaternion Range Hermitian matrices (q-p) S. Sridevi
More informationG1110 & 852G1 Numerical Linear Algebra
The University of Sussex Department of Mathematics G & 85G Numerical Linear Algebra Lecture Notes Autumn Term Kerstin Hesse (w aw S w a w w (w aw H(wa = (w aw + w Figure : Geometric explanation of the
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 198 NOTES ON MATRIX METHODS 1. Matrix Algebra Margenau and Murphy, The Mathematics of Physics and Chemistry, Chapter 10, give almost
More informationChapter 5 Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Outline 5.1 Eigenvalues and Eigenvectors 5.2 Diagonalization 5.3 Complex Vector Spaces 2 5.1 Eigenvalues and Eigenvectors Eigenvalue and Eigenvector If A is a n n
More informationTrace Inequalities for a Block Hadamard Product
Filomat 32:1 2018), 285 292 https://doiorg/102298/fil1801285p Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Trace Inequalities for
More informationMath 489AB Exercises for Chapter 1 Fall Section 1.0
Math 489AB Exercises for Chapter 1 Fall 2008 Section 1.0 1.0.2 We want to maximize x T Ax subject to the condition x T x = 1. We use the method of Lagrange multipliers. Let f(x) = x T Ax and g(x) = x T
More informationNotes on basis changes and matrix diagonalization
Notes on basis changes and matrix diagonalization Howard E Haber Santa Cruz Institute for Particle Physics, University of California, Santa Cruz, CA 95064 April 17, 2017 1 Coordinates of vectors and matrix
More informationSingular Value Decomposition
Chapter 6 Singular Value Decomposition In Chapter 5, we derived a number of algorithms for computing the eigenvalues and eigenvectors of matrices A R n n. Having developed this machinery, we complete our
More informationLU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU
LU Factorization A m n matri A admits an LU factorization if it can be written in the form of Where, A = LU L : is a m m lower triangular matri with s on the diagonal. The matri L is invertible and is
More informationA Tropical Extremal Problem with Nonlinear Objective Function and Linear Inequality Constraints
A Tropical Extremal Problem with Nonlinear Objective Function and Linear Inequality Constraints NIKOLAI KRIVULIN Faculty of Mathematics and Mechanics St. Petersburg State University 28 Universitetsky Ave.,
More informationMath 225 Linear Algebra II Lecture Notes. John C. Bowman University of Alberta Edmonton, Canada
Math 225 Linear Algebra II Lecture Notes John C Bowman University of Alberta Edmonton, Canada March 23, 2017 c 2010 John C Bowman ALL RIGHTS RESERVED Reproduction of these lecture notes in any form, in
More informationLecture 2: Linear operators
Lecture 2: Linear operators Rajat Mittal IIT Kanpur The mathematical formulation of Quantum computing requires vector spaces and linear operators So, we need to be comfortable with linear algebra to study
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 informationEcon 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis
Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms De La Fuente notes that, if an n n matrix has n distinct eigenvalues, it can be diagonalized. In this supplement, we will provide
More informationMatrices A brief introduction
Matrices A brief introduction Basilio Bona DAUIN Politecnico di Torino Semester 1, 2014-15 B. Bona (DAUIN) Matrices Semester 1, 2014-15 1 / 41 Definitions Definition A matrix is a set of N real or complex
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 informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - 4 (Alberto Bressan, Spring 27) Review of complex numbers In this chapter we shall need to work with complex numbers z C These can be written in the form z = a+ib,
More informationStrict diagonal dominance and a Geršgorin type theorem in Euclidean
Strict diagonal dominance and a Geršgorin type theorem in Euclidean Jordan algebras Melania Moldovan Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
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 informationComputational Foundations of Cognitive Science. Addition and Scalar Multiplication. Matrix Multiplication
Computational Foundations of Cognitive Science Lecture 1: Algebraic ; Transpose; Inner and Outer Product Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk February 23, 21 1
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
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 informationPOSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS
Adv. Oper. Theory 3 (2018), no. 1, 53 60 http://doi.org/10.22034/aot.1702-1129 ISSN: 2538-225X (electronic) http://aot-math.org POSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
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 informationJordan Canonical Form of A Partitioned Complex Matrix and Its Application to Real Quaternion Matrices
COMMUNICATIONS IN ALGEBRA, 29(6, 2363-2375(200 Jordan Canonical Form of A Partitioned Complex Matrix and Its Application to Real Quaternion Matrices Fuzhen Zhang Department of Math Science and Technology
More informationJim Lambers MAT 610 Summer Session Lecture 2 Notes
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the
More informationLinear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway
Linear Algebra: Lecture Notes Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway November 6, 23 Contents Systems of Linear Equations 2 Introduction 2 2 Elementary Row
More informationREPRESENTATION THEORY WEEK 7
REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationMath 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationI = i 0,
Special Types of Matrices Certain matrices, such as the identity matrix 0 0 0 0 0 0 I = 0 0 0, 0 0 0 have a special shape, which endows the matrix with helpful properties The identity matrix is an example
More informationDIAGONALIZATION BY SIMILARITY TRANSFORMATIONS
DIAGONALIZATION BY SIMILARITY TRANSFORMATIONS The correct choice of a coordinate system (or basis) often can simplify the form of an equation or the analysis of a particular problem. For example, consider
More information3 (Maths) Linear Algebra
3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra
More informationMaths for Signals and Systems Linear Algebra in Engineering
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 15, Tuesday 8 th and Friday 11 th November 016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE
More informationLinear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4
Linear Algebra Section. : LU Decomposition Section. : Permutations and transposes Wednesday, February 1th Math 01 Week # 1 The LU Decomposition We learned last time that we can factor a invertible matrix
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 informationDiagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Diagonalization MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Motivation Today we consider two fundamental questions: Given an n n matrix A, does there exist a basis
More informationMatrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein
Matrix Mathematics Theory, Facts, and Formulas with Application to Linear Systems Theory Dennis S. Bernstein PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Special Symbols xv Conventions, Notation,
More informationRecall : Eigenvalues and Eigenvectors
Recall : Eigenvalues and Eigenvectors Let A be an n n matrix. If a nonzero vector x in R n satisfies Ax λx for a scalar λ, then : The scalar λ is called an eigenvalue of A. The vector x is called an eigenvector
More information