Optimisation Problems for the Determinant of a Sum of 3 3 Matrices
|
|
- Ezra Brown
- 5 years ago
- Views:
Transcription
1 Irish Math. Soc. Bulletin 62 (2008), Optimisation Problems for the Determinant of a Sum of 3 3 Matrices FINBARR HOLLAND Abstract. Given a pair of positive definite 3 3 matrices A, B, the maximum and minimum values of det(u AU + V BV ) are determined when U, V vary within the collection of unitary 3 3 matrices. 1. Introduction Let m, n be a pair of natural numbers. Suppose A 1, A 2,..., A n are m m Hermitian positive definite matrices. What are the maximum and minimum values of the expression ( n ) det Ui A i U i as U 1, U 2,..., U n range over the group G m of m m unitary matrices? The case m = 2 of this arose in the context of an interesting maximum-likelihood problem which is discussed in [3], and the minimum value was determined there when the given matrices were real and symmetric, and the Us members of the subgroup of G 2 of orthogonal matrices. In this note we address the above problem only in the case m = 3, and resolve it when n = 2. However, the methods used here don t appear to generalise to the case of general m, even when n = 2. Accordingly, a different strategy has been devised to deal with this more general case, which will be the subject of another paper. However, at the time of writing, the general case of arbitrary m, n remains open Mathematics Subject Classification. Primary 15A45. Key words and phrases. Positive definite matrices, unitary matrices, doublystochastic matrices, extreme points, rearrangement inequality.
2 32 Finbarr Holland 2. Statement of the Main Result Theorem 1. Let S and T be two 3 3 positive definite matrices with spectra σ(s) = {s 1, s 2, s 3 } and σ(t ) = {t 1, t 2, t 3 }, respectively, where s 1 s 2 s 3 > 0 and t 1 t 2 t 3 > 0. Then min{det(s + U T U) : U G 3 } = (s i + t i ), and max{det(s + U T U) : U G 3 } = (s i + t 4 i ). 3. Two Preparatory Lemmas Lemma 1. Let A = [a ij ] be a 3 3 matrix. Let M = x + a 11 a 12 a 13 a 21 y + a 22 a 23. a 31 a 32 z + a 33 Then det M = xyz + yza 11 + zxa 22 + xya 33 + xa 11 + ya 22 + za 33 + det A. Proof. Here and later, we use the customary notation A ij for the cofactor of the typical element a ij, so that, in particular, A 11, A 22, A 33 are the principal minors of A of order 2 2. Expanding by elements of the first row, det M = (x + a 11 )[(y + a 22 )(z + a 33 ) a 23 a 32 ] a 12 [a 21 (z + a 33 ) a 31 a 23 ] + a 13 [a 21 a 32 a 31 (y + a 22 )] = (x + a 11 )(y + a 22 )(z + a 33 ) [xa 23 a 32 + ya 13 a 31 + za 12 a 21 ] a 11 a 23 a 32 a 12 [a 21 a 33 a 31 a 23 ] + a 13 [a 21 a 32 a 31 a 22 ] = (x + a 11 )(y + a 22 )(z + a 33 ) a 11 a 23 a 32 [xa 23 a 32 + ya 13 a 31 + za 12 a 21 ] a 12 A 12 + a 13 A 13 = xyz + xya 33 + yza 22 + zxa 11 + x[a 22 a 33 a 23 a 32 ] + y[a 11 a 33 a 13 a 31 ] + z[a 11 a 22 a 12 a 21 ] + a 11 A 11 a 12 A 12 + a 13 A 13 = xyz + xya 33 + yza 22 + zxa 11 + xa 11 + ya 22 + za 33 + det A.
3 Optimisation Problems 33 We wish to exploit this result when A = U T U, where T is a diagonal matrix with positive diagonal elements p q r > 0, and U = [u ij ] is unitary. A calculation shows that In particular, a ij = pu i1 u j1 + qu i2 u j2 + ru i3 u j3, i, j = 1, 2, 3. a ii = p u i1 2 + q u i2 2 + r u i3 2, i = 1, 2, 3. In addition, A is invertible and A 1 = U T 1 U = (det A) 1 [A ij ] t, whence or A ii pqr = p 1 u i1 2 + q 1 u i2 2 + r 1 u i3 2, i = 1, 2, 3, A ii = qr u i1 2 + rp u i2 2 + pq u i3 2, i = 1, 2, 3. Observe too that u ij 2 = u ij 2 = 1, i, j = 1, 2, 3, and so the matrix [ u ij 2 ] is doubly-stochastic. With this in mind we prove a rearrangement inequality. Lemma 2. Let [p ij ] stand for an arbitrary n n doubly-stochastic matrix. Let a, b be two real n 1 vectors whose entries are in decreasing order. Then a i b n i+1 a i b j p ij a i b i. Proof. Consider the function f defined on the convex set P of all n n doubly-stochastic matrices P = [p ij ] by f(p ) = a i b j p ij, P P. Clearly, f is linear in P, and so convex on P. Hence it attains its maximum and minimum at an extreme point of P. But, by Birkhoff s theorem [1], the set of extreme points of the latter consists of the set of permutation matrices {π(i) = [δ iπ(j) ] : π S n }, where S n
4 34 Finbarr Holland denotes the group of permutations of {1, 2,..., n}. Hence min{f(p ) : P P} = min{f(π(i)) : π S n } = min{ a i b j δ iπ(j) : π S n } = min{ = a π(j) b j : π S n } a j b n j+1, by the elementary rearrangement inequality, since a, b are similarly ordered [2]. This argument establishes that a i b n i+1 a i b j p ij, with equality when p ij = δ i(n j+1), i, j = 1, 2,..., n,. The maximum can be handled in the same way. 4. Proof of the Main Result Define F on the group G 3 of 3 3 unitary matrices by F (U) = det(s + U T U), U G 3. In the first place, there are matrices V, W G 3 such that S = V s s 2 0 V V V, 0 0 s 3 and say. Hence T = W t t t 3 W W ΛW, F (W UV ) = det( + U ΛU), whence it s enough to deal with the case where S =, T = Λ. This being so, we can appeal to Lemma 1, taking [ A = U U = t k u ik u jk ], k=1
5 Optimisation Problems 35 and obtain that det( + U ΛU) = det( + A) = s 1 s 2 s 3 + s 1 s 2 s 3 k=1 = s 1 s 2 s 3 + s 1 s 2 s 3 + t 1 t 2 t 3 s i = s 1 s 2 s 3 + s 1 s 2 s 3 + t 1 t 2 t 3 s 1 s 2 s 3 +s 1 s 2 s 3 k a kk + i s k A kk + det A k=1 t j u ij 2 t 1 j u ij 2 + t 1 t 2 t 3 i t j u ij 2 s i t 1 j u ij 2 + t 1 t 2 t 3 i t i +t 1 t 2 t 3 s i t 1 i +t 1 t 2 t 3, by Lemma 2, since s 1, s 2, s 3, and t 1 1, t 1 2, t 1 3 are oppositely ordered. It follows that det( + U ΛU) s 1 s 2 s 3 + t 1 s 2 s 3 + t 2 s 1 s 3 + t 3 s 1 s 2 + s 1 t 2 t 2 + t 2 s 1 s 3 + t 3 s 1 s 2 + t 1 t 2 t 3 = (s 1 + t 1 )(s 2 + t 2 )(s 3 + t 3 ), with equality when U = I, the identity matrix. Hence min{f (U) : U G 3 } = (s i + t i ). Arguing in a similar manner, it can be seen that max{f (U) : U G 3 } = (s i + t 4 i ). This completes the proof of Theorem 1.
6 36 Finbarr Holland References [1] R. Bhatia, Matrix Analysis, Springer-Verlag, [2] G. H. Hardy, J. E. Littlewood and G. Pólya, Inequalities, Cambridge University Press, [3] F. Holland and K. Roy Choudhrey, Likelihood ratio tests for equality of shape under varying degrees of orientation invariance, J. Multivariate Analysis 99 (2008), Finbarr Holland, Mathematics Department, University College, Cork, Ireland, Received on 25 July 2008.
Clarkson 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,
b jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60
On the Hu-Hurley-Tam Conjecture Concerning The Generalized Numerical Range Che-Man Cheng Faculty of Science and Technology, University of Macau, Macau. E-mail: fstcmc@umac.mo and Chi-Kwong Li Department
Matrix Factorization and Analysis
Chapter 7 Matrix Factorization and Analysis Matrix factorizations are an important part of the practice and analysis of signal processing. They are at the heart of many signal-processing algorithms. Their
MATH 2050 Assignment 8 Fall [10] 1. Find the determinant by reducing to triangular form for the following matrices.
MATH 2050 Assignment 8 Fall 2016 [10] 1. Find the determinant by reducing to triangular form for the following matrices. 0 1 2 (a) A = 2 1 4. ANS: We perform the Gaussian Elimination on A by the following
CHAPTER III THE PROOF OF INEQUALITIES
CHAPTER III THE PROOF OF INEQUALITIES In this Chapter, the main purpose is to prove four theorems about Hardy-Littlewood- Pólya Inequality and then gives some examples of their application. We will begin
Determinants Chapter 3 of Lay
Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j
5.6. PSEUDOINVERSES 101. A H w.
5.6. PSEUDOINVERSES 0 Corollary 5.6.4. If A is a matrix such that A H A is invertible, then the least-squares solution to Av = w is v = A H A ) A H w. The matrix A H A ) A H is the left inverse of A and
PROOF 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
Determinants of 2 2 Matrices
Determinants In section 4, we discussed inverses of matrices, and in particular asked an important question: How can we tell whether or not a particular square matrix A has an inverse? We will be able
Some inequalities for sum and product of positive semide nite matrices
Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,
Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract
Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract Let F be a field, M n (F ) the algebra of n n matrices over F and
ENGR-1100 Introduction to Engineering Analysis. Lecture 21. Lecture outline
ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility
1 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
Linear Algebra Solutions 1
Math Camp 1 Do the following: Linear Algebra Solutions 1 1. Let A = and B = 3 8 5 A B = 3 5 9 A + B = 9 11 14 4 AB = 69 3 16 BA = 1 4 ( 1 3. Let v = and u = 5 uv = 13 u v = 13 v u = 13 Math Camp 1 ( 7
Matrix 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,
ENGR-1100 Introduction to Engineering Analysis. Lecture 21
ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility
Notes on Linear Algebra
1 Notes on Linear Algebra Jean Walrand August 2005 I INTRODUCTION Linear Algebra is the theory of linear transformations Applications abound in estimation control and Markov chains You should be familiar
Lecture 3: QR-Factorization
Lecture 3: QR-Factorization This lecture introduces the Gram Schmidt orthonormalization process and the associated QR-factorization of matrices It also outlines some applications of this factorization
Math 407: Linear Optimization
Math 407: Linear Optimization Lecture 16: The Linear Least Squares Problem II Math Dept, University of Washington February 28, 2018 Lecture 16: The Linear Least Squares Problem II (Math Dept, University
Math 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
c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March
SIAM REVIEW. c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp. 93 97, March 1995 008 A UNIFIED PROOF FOR THE CONVERGENCE OF JACOBI AND GAUSS-SEIDEL METHODS * ROBERTO BAGNARA Abstract.
1 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
1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
Elementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
Math 896 Coding Theory
Math 896 Coding Theory Problem Set Problems from June 8, 25 # 35 Suppose C 1 and C 2 are permutation equivalent codes where C 1 P C 2 for some permutation matrix P. Prove that: (a) C 1 P C 2, and (b) if
Matrix Energy. 1 Graph Energy. Christi DiStefano Gary Davis CSUMS University of Massachusetts at Dartmouth. December 16,
Matrix Energy Christi DiStefano Gary Davis CSUMS University of Massachusetts at Dartmouth December 16, 2009 Abstract We extend Ivan Gutmans idea of graph energy, stemming from theoretical chemistry via
CHI-KWONG LI AND YIU-TUNG POON. Dedicated to Professor John Conway on the occasion of his retirement.
INTERPOLATION BY COMPLETELY POSITIVE MAPS CHI-KWONG LI AND YIU-TUNG POON Dedicated to Professor John Conway on the occasion of his retirement. Abstract. Given commuting families of Hermitian matrices {A
Lecture 8: Determinants I
8-1 MATH 1B03/1ZC3 Winter 2019 Lecture 8: Determinants I Instructor: Dr Rushworth January 29th Determinants via cofactor expansion (from Chapter 2.1 of Anton-Rorres) Matrices encode information. Often
22m:033 Notes: 3.1 Introduction to Determinants
22m:033 Notes: 3. Introduction to Determinants Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman October 27, 2009 When does a 2 2 matrix have an inverse? ( ) a a If A =
Albert W. Marshall. Ingram Olkin Barry. C. Arnold. Inequalities: Theory. of Majorization and Its Applications. Second Edition.
Albert W Marshall Ingram Olkin Barry C Arnold Inequalities: Theory of Majorization and Its Applications Second Edition f) Springer Contents I Theory of Majorization 1 Introduction 3 A Motivation and Basic
CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
Extra Problems for Math 2050 Linear Algebra I
Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as
Lattices and Hermite normal form
Integer Points in Polyhedra Lattices and Hermite normal form Gennady Shmonin February 17, 2009 1 Lattices Let B = { } b 1,b 2,...,b k be a set of linearly independent vectors in n-dimensional Euclidean
PROBLEMS IAN SHORT. ( 1) n x n
Irish Math. Soc. Bulletin Number 8, Winter 27, 87 9 ISSN 79-5578 PROBLEMS IAN SHORT Problems The first problem this issue was contributed by Finbarr Holland of University College Cork. Problem 8.. Let
Compound matrices and some classical inequalities
Compound matrices and some classical inequalities Tin-Yau Tam Mathematics & Statistics Auburn University Dec. 3, 04 We discuss some elegant proofs of several classical inequalities of matrices by using
Short proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 35 2009 Short proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices Eric A. Carlen carlen@math.rutgers.edu
Trace 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
Structured Hadamard matrices and quantum information
Structured Hadamard matrices and quantum information Karol Życzkowski in collaboration with Adam G asiorowski, Grzegorz Rajchel (Warsaw) Dardo Goyeneche (Concepcion/ Cracow/ Gdansk) Daniel Alsina, José
1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5
J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix
Algebra 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
Markov Decision Processes
Markov Decision Processes Lecture notes for the course Games on Graphs B. Srivathsan Chennai Mathematical Institute, India 1 Markov Chains We will define Markov chains in a manner that will be useful to
Refined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
Linear Algebra and Vector Analysis MATH 1120
Faculty of Engineering Mechanical Engineering Department Linear Algebra and Vector Analysis MATH 1120 : Instructor Dr. O. Philips Agboola Determinants and Cramer s Rule Determinants If a matrix is square
Violation of CP symmetry. Charles Dunkl (University of Virginia)
Violation of CP symmetry form a point of view of a mathematician Karol Życzkowski in collaboration with Charles Dunkl (University of Virginia) J. Math. Phys. 50, 123521 (2009). ZFCz IF UJ, Kraków January
Semidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
We continue our study of the Pythagorean Theorem begun in ref. 1. The numbering of results and remarks in ref. 1 will
The Pythagorean Theorem: II. The infinite discrete case Richard V. Kadison Mathematics Department, University of Pennsylvania, Philadelphia, PA 19104-6395 Contributed by Richard V. Kadison, December 17,
Cheng Soon Ong & Christian Walder. Canberra February June 2017
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2017 (Many figures from C. M. Bishop, "Pattern Recognition and ") 1of 141 Part III
arxiv:math/ v1 [math.fa] 4 Jan 2007
Tr[ABA] p = Tr[B 1/2 A 2 B 1/2 ] p. On the Araki-Lieb-Thirring inequality arxiv:math/0701129v1 [math.fa] 4 Jan 2007 Koenraad M.R. Audenaert Institute for Mathematical Sciences, Imperial College London
1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
Mathematics. EC / EE / IN / ME / CE. for
Mathematics for EC / EE / IN / ME / CE By www.thegateacademy.com Syllabus Syllabus for Mathematics Linear Algebra: Matrix Algebra, Systems of Linear Equations, Eigenvalues and Eigenvectors. Probability
Positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras
Positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
Gaussian Elimination and Back Substitution
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 4 Notes These notes correspond to Sections 31 and 32 in the text Gaussian Elimination and Back Substitution The basic idea behind methods for solving
arxiv: v1 [math.ra] 10 Nov 2018
arxiv:1811.04243v1 [math.ra] 10 Nov 2018 BURNSIDE S THEOREM IN THE SETTING OF GENERAL FIELDS HEYDAR RADJAVI AND BAMDAD R. YAHAGHI Abstract. We extend a well-known theorem of Burnside in the setting of
LS.1 Review of Linear Algebra
LS. LINEAR SYSTEMS LS.1 Review of Linear Algebra In these notes, we will investigate a way of handling a linear system of ODE s directly, instead of using elimination to reduce it to a single higher-order
Spectral 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
forms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms
Christopher Engström November 14, 2014 Hermitian LU QR echelon Contents of todays lecture Some interesting / useful / important of matrices Hermitian LU QR echelon Rewriting a as a product of several matrices.
CLASSIFICATION OF COMPLETELY POSITIVE MAPS 1. INTRODUCTION
CLASSIFICATION OF COMPLETELY POSITIVE MAPS STEPHAN HOYER ABSTRACT. We define a completely positive map and classify all completely positive linear maps. We further classify all such maps that are trace-preserving
Stat 159/259: Linear Algebra Notes
Stat 159/259: Linear Algebra Notes Jarrod Millman November 16, 2015 Abstract These notes assume you ve taken a semester of undergraduate linear algebra. In particular, I assume you are familiar with the
The maximal determinant and subdeterminants of ±1 matrices
Linear Algebra and its Applications 373 (2003) 297 310 www.elsevier.com/locate/laa The maximal determinant and subdeterminants of ±1 matrices Jennifer Seberry a,, Tianbing Xia a, Christos Koukouvinos b,
LORENTZIAN MATRIX MULTIPLICATION AND THE MOTIONS ON LORENTZIAN PLANE. Kırıkkale University, Turkey
GLASNIK MATEMATIČKI Vol. 41(61)(2006), 329 334 LORENTZIAN MATRIX MULTIPLICATION AND THE MOTIONS ON LORENTZIAN PLANE Halı t Gündoğan and Osman Keçı lı oğlu Kırıkkale University, Turkey Abstract. In this
POSITIVE 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
Block Diagonal Majorization on C 0
Iranian Journal of Mathematical Sciences and Informatics Vol. 8, No. 2 (2013), pp 131-136 Block Diagonal Majorization on C 0 A. Armandnejad and F. Passandi Department of Mathematics, Vali-e-Asr University
Inequalities For Singular Values And Traces Of Quaternion Hermitian Matrices
Inequalities For Singular Values And Traces Of Quaternion Hermitian Matrices K. Gunasekaran M. Rahamathunisha Ramanujan Research Centre, PG and Research Department of Mathematics, Government Arts College
Norm 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
Linear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another.
Homework # due Thursday, Oct. 0. Show that the diagonals of a square are orthogonal to one another. Hint: Place the vertices of the square along the axes and then introduce coordinates. 2. Find the equation
Extremity of b-bistochastic Quadratic Stochastic Operators on 2D Simplex
Malaysian Journal of Mathematical Sciences 11(2): 119 139 (2017) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES Journal homepage: http://einspem.upm.edu.my/journal Extremity of b-bistochastic Quadratic Stochastic
Intrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
Math 291-2: Lecture Notes Northwestern University, Winter 2016
Math 291-2: Lecture Notes Northwestern University, Winter 2016 Written by Santiago Cañez These are lecture notes for Math 291-2, the second quarter of MENU: Intensive Linear Algebra and Multivariable Calculus,
arxiv: 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
Math 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
Inner image-kernel (p, q)-inverses in rings
Inner image-kernel (p, q)-inverses in rings Dijana Mosić Dragan S. Djordjević Abstract We define study the inner image-kernel inverse as natural algebraic extension of the inner inverse with prescribed
Here are some additional properties of the determinant function.
List of properties Here are some additional properties of the determinant function. Prop Throughout let A, B M nn. 1 If A = (a ij ) is upper triangular then det(a) = a 11 a 22... a nn. 2 If a row or column
Polynomial mappings into a Stiefel manifold and immersions
Polynomial mappings into a Stiefel manifold and immersions Iwona Krzyżanowska Zbigniew Szafraniec November 2011 Abstract For a polynomial mapping from S n k to the Stiefel manifold Ṽk(R n ), where n k
arxiv:math/ v5 [math.ac] 17 Sep 2009
On the elementary symmetric functions of a sum of matrices R. S. Costas-Santos arxiv:math/0612464v5 [math.ac] 17 Sep 2009 September 17, 2009 Abstract Often in mathematics it is useful to summarize a multivariate
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
An alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions - Corrected Version
1 An alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions - Corrected Version Robert Shorten 1, Oliver Mason 1 and Christopher King 2 Abstract The original
Moore 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
Banach 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
Chapter 3. Basic Properties of Matrices
3.1. Basic Definitions and Notations 1 Chapter 3. Basic Properties of Matrices Note. This long chapter (over 100 pages) contains the bulk of the material for this course. As in Chapter 2, unless stated
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
SYLLABUS. 1 Linear maps and matrices
Dr. K. Bellová Mathematics 2 (10-PHY-BIPMA2) SYLLABUS 1 Linear maps and matrices Operations with linear maps. Prop 1.1.1: 1) sum, scalar multiple, composition of linear maps are linear maps; 2) L(U, V
arxiv:math/ v1 [math.oa] 9 May 2005
arxiv:math/0505154v1 [math.oa] 9 May 2005 A GENERALIZATION OF ANDÔ S THEOREM AND PARROTT S EXAMPLE DAVID OPĚLA Abstract. Andô s theorem states that any pair of commuting contractions on a Hilbert space
SPECTRAL ORDER PRESERVING MATRICES AND MUIRHEAD'S THEOREM
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 200, 1974 SPECTRAL ORDER PRESERVING MATRICES AND MUIRHEAD'S THEOREM BY KONG-MING chongo.1) ABSTRACT. In this paper, a characterization is given
Lecture 11. Linear systems: Cholesky method. Eigensystems: Terminology. Jacobi transformations QR transformation
Lecture Cholesky method QR decomposition Terminology Linear systems: Eigensystems: Jacobi transformations QR transformation Cholesky method: For a symmetric positive definite matrix, one can do an LU decomposition
Fundamentals of Engineering Analysis (650163)
Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is
1 Matrices and Systems of Linear Equations. a 1n a 2n
March 31, 2013 16-1 16. Systems of Linear Equations 1 Matrices and Systems of Linear Equations An m n matrix is an array A = (a ij ) of the form a 11 a 21 a m1 a 1n a 2n... a mn where each a ij is a real
j=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p.
LINEAR ALGEBRA Fall 203 The final exam Almost all of the problems solved Exercise Let (V, ) be a normed vector space. Prove x y x y for all x, y V. Everybody knows how to do this! Exercise 2 If V is a
Math 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
On Expected Gaussian Random Determinants
On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose
Notes on Determinants and Matrix Inverse
Notes on Determinants and Matrix Inverse University of British Columbia, Vancouver Yue-Xian Li March 17, 2015 1 1 Definition of determinant Determinant is a scalar that measures the magnitude or size of
ACM 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 λ,,
Math 3108: Linear Algebra
Math 3108: Linear Algebra Instructor: Jason Murphy Department of Mathematics and Statistics Missouri University of Science and Technology 1 / 323 Contents. Chapter 1. Slides 3 70 Chapter 2. Slides 71 118
APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
Chapter 2. Square matrices
Chapter 2. Square matrices Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/18 Invertible matrices Definition 2.1 Invertible matrices An n n matrix A is said to be invertible, if there is a
POLYA CONDITIONS FOR MULTIVARIATE BIRKHOFF INTERPOLATION: FROM GENERAL TO RECTANGULAR SETS OF NODES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXIX, 1(20), pp. 9 18 9 POLYA CONDITIONS FOR MULTIVARIATE BIRKHOFF INTERPOLATION: FROM GENERAL TO RECTANGULAR SETS OF NODES M. CRAINIC and N. CRAINIC Abstract. Polya conditions
RANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES
RANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES CHI-KWONG LI, YIU-TUNG POON, AND XUEFENG WANG Abstract. Let M n be the set of n n complex matrices. in this note, all the possible ranks of a bipartite
Assignment 12. O = O ij O kj = O kj O ij. δ ik = O ij
Assignment 12 Arfken 4.1.1 Show that the group of n n orthogonal matrices On has nn 1/2 independent parameters. First we need to realize that a general orthogonal matrix, O, has n 2 elements or parameters,
Math 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
Math Homework 8 (selected problems)
Math 102 - Homework 8 (selected problems) David Lipshutz Problem 1. (Strang, 5.5: #14) In the list below, which classes of matrices contain A and which contain B? 1 1 1 1 A 0 0 1 0 0 0 0 1 and B 1 1 1
On the algebraic structure of Dyson s Circular Ensembles. Jonathan D.H. SMITH. January 29, 2012
Scientiae Mathematicae Japonicae 101 On the algebraic structure of Dyson s Circular Ensembles Jonathan D.H. SMITH January 29, 2012 Abstract. Dyson s Circular Orthogonal, Unitary, and Symplectic Ensembles