DOCSLIB.ORG

Simultaneous Diagonalization Via Congruence of Hermitian Matrices

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Simultaneous Diagonalization Via Congruence of Hermitian Matrices Simultaneous diagonalization via congruence of Hermitian matrices: some equivalent conditions and a numerical solution Hieu Le Thanh* and Ngan Nguyen Thi† Department of Mathematics and Statistics, Quy Nhon University, Vietnam November 17, 2020 Abstract This paper aims at solving the Hermitian SDC problem, i.e., that of si- multaneously diagonalizing via -congruence a collection of finitely many (not need pairwise commute) Hermitian∗ matrices. Theoretically, we provide some equivalent conditions for that such a matrix collection can be simulta- neously diagonalized via ∗-congruence.Interestingly, one of such conditions leads to the existence of a positive definite solution to a semidefinite program (SDP). From practical point of view, we propose an algorithm for numeri- cally solving such problem. The proposed algorithm is a combination of (1) a positive semidefinite program detecting whether the initial Hermitian matri- ces are simultaneously diagonalizable via -congruence, and (2) a Jacobi-like ∗ algorithm for simultaneously diagonalizing via -congruence the commuting ∗ normal matrices derived from the previous stage. Illustrating examples by hand/coding in MATLAB are also presented. Keywords: Hermitian matrices, matrix ∗-congruence, matrix T-congruence, matrix similarity, simultaneous diagonalization via congruence (SDC), simultane- arXiv:2007.14034v2 [math.NA] 15 Nov 2020 ous diagonalization via similarity (SDS), semidefinite programming (SDP), maxi- mum rank linear combination of matrices. 1 Introduction Notations and preliminaries. Let F denote the field of real numbers R or complex n n n ones C, and F × denote the set of all n n matrices with entries in F. Let S (resp., n × n n H ) denote the set of real symmetric (resp., Hermitian) matrices in F × . By .∗ we denote the conjugate transpose of a matrix. For A Hn, by A 0 (resp., A 0) we mean A is positive semidefinite (resp., positive∈ definite) as usual . ≻ *Email: [email protected] †Email: [email protected] 1 n n From now on, without stated otherwise, C1,...,Cm F × are always Her- C ∈ C m mitian matrices. By (λ) we denote the Hermitian pencil (λ) =: i=1 λiCi, i.e., the parameters λ1,...,λm ranges only over real numbers. Finally, Hermitian P matrices C1,...,Cm are said to be (i) simultaneously diagonalizable via similarity on F, abbreviated F-SDS, if there n n 1 exists a nonsingular matrix P F × such that P − CiP ’s are all diagonal n n ∈ matrices in F × . When m = 1, we will say ”C1 is similar to a diagonal matrix” or “C1 is diagonalizable (via similarity)” as usual. (ii) simultaneously diagonalizable via -congruence on F, abbreviated F-SDC, ∗ n n if there exists a nonsingular matrix P F × such that P ∗CiP is diagonal ∈ for every i = 1, . , m. Here P ∗ means the conjugate transpose of P. When m =1, we will say “C1 is congruent to a diagonal matrix” as usual. It is worth mentioning that every diagonal matrix P ∗CiP is always real since Ci is Hermitian. Moreover, we will see in Theorems 4 and 7 below that P can be chosen to be real if Ci’s are all real. Additionally, one should distinguish that -congruence in this paper is different from T-one in [4]. These two types∗ of congruence will coincide only when the Hermitian matrices are real. (iii) commuting if they pairwise commute, i.e., CiCj = CjCi for every i, j = 1, . , m. Depend upon particular situation in the rest of this paper, the term “SDC” will mean either “simultaneous diagnalization” or “simultaneously diagnalizing”, or “simultaneously diagnalizable” via -congruence. It is analogously to the term “SDS”. ∗ We now recall some well-know results that will be frequently used in the rest of the paper. Fn n F Lemma 1. Let A, B × be A = diag(α1In1 ,...,αkInk ), αi’s are distinct. ∈ ni ni ∋ If AB = BA then B = diag(B ,...,Bk) with Bi F × for every i =1, . , k. 1 ∈ Furthermore, B is Hermitian (resp., symmetric) if and only if so are Bi’s. Proof. Partitioning B as B = [Bij]i,j=1,...,k, where Bii is a square submatrix of size ni ni, i = 1,...,k and off-diagonal blocks are of appropriate sizes. It then follows× from α1B11 ... α1B1k α1B11 ... αkB1k . .. .. . = AB = BA = . αkBk1 ... αkBkk α1Bk1 ... αkBkk that αiBij = αjBij, i = j. Thus Bij =0 for every i = j. The last claim is trivial.∀ 6 6 Lemma 2. (See, eg., in [13]) (i) Every A Hn can be diagonalized via similarity ∈ by a unitary matrix. That is, it can be written as A = UΛU ∗, where U is unitary, Λ is real diagonal and is uniquely defined up to a permutation of diagonal elements. Moreover, if A Sn then U can be picked to be real. ∈ n n (ii) Let C1,...,Cm F × such that each of which is similar to a diagonal matrix. They are then F-SDS∈ if and only if they are commuting. 2 n n m m (iii) Let A F × , B F × . The matrix M = diag(A, B) is diagonalizable via similarity if∈ and only if∈ so are both A and B. (iv) A complex symmetric matrix A is diagonalizable via similarity if and only 1 if it is complex orthogonally diagonalizable, i.e., Q− AQ is diagonal for some n n T complex orthogonal matrix Q C × : Q Q = I. ∈ Proof. The first and last parts can be found in [13]. We prove (ii) and (iii) for real matrices, the complex setting was proved in [13]. n n (ii) Suppose C1,...,Cm R × are commuting. We prove by induction on n. For n =1, there are nothing∈ to prove. Suppose that n 2 and that the assertion has been proved for all collections of m commuting real≥ matrices of size k k, × 1 k n 1. ≤ ≤ − By the hypothesis, C1 is diagonalized via similarity by a nonsingular matrix n n P R × , ∈ 1 P − C P = diag(α In1 ,...,αkInk ), n + ... + nk = n, αi = αj, i = j. 1 1 1 6 ∀ 6 1 1 The commutativity of C1,Ci implies that of P − C1P and P − CiP. By Lemma 1, 1 nt nt P − CiP = diag(Ci ,...,Cik), Cit R × , t =1, . , k. 1 ∈ ∀ 1 1 Furthermore, P − CiP and P − CjP commute due to the commutativity of Ci,Cj. So, Cit and Cjt commute for every t = 1, . , t. This means the matrices C2t, ...,Cmt are commuting for every t = 1, . , k. By the induction hypothesis, for each t = 1, . , k, the matrices C2t,...,Cmt are R-SDS by a nonsingular matrix nt nt Qt R × , and so are Int ,C t,...,Cmt. Let ∈ 2 n n Q = diag(Q ,...,Qk) R × , 1 ∈ and set U = P Q. One can check C1,...,Cm are R-SDS by U. The converse is trivial. (n+m) (n+m) (iii) Suppose M is DS in R × . Then there exists a nonsingular matrix (n+m) (n+m) S R × such that ∈ 1 S− MS =Λ= diag(α ,...,αn,...αn m), αi R, i =1,...,m + n. 1 + ∈ Let sj be the j-th column of S with ξj n m sj = , ξj R , νj R . νj ∈ ∈ n (n+m) m (n+m) Let E = [ξ1 ...ξn+m] R × , N = [ν1 ...νn+m] R × . If rank(E) < n or rank(N) < m then∈ ∈ m + n = rank(S) rank(E)+ rank(N) < m + n, ≤ which is impossible. Thus rank(E) = n and rank(N) = m. Moreover, it follows from MS = SΛ that the jth column ξj of E is the eigenvector of A w.r.t the eigenvalue λj. This means A has n linearly independent eigenvectors. By the same reasoning, B also has m linearly independent eigenvectors. Thus A and B are n n m m diagonalizable via similarity in R × and R × , respectively. 3 History of SDC problems. Matrix simultaneous diagonalizations, via similarity or congruence, appear in a number of research areas, for examples, quadratic equa- tions and optimization [12, 15], multi-linear algebra [6], signal processing, data analysis [6], quantum mechanics [22], ... The SDC problem, i.e., the one of finding a nonsingular matrix that simulta- neously diagonalizes a collection of matrices via congruence, can be dated back to 1868 by Weierstrass [25], 1930s by Finsler [8, 1, 11], and later studies devel- oped some conditions ensuring a collection of quadratic forms are SDC (see, eg., in [18, 20] and references therein). However, almost these works provide only sufficient (but not necessary) conditions, except for, eg., that in [23], [13, 14] and references therein dealing with two Hermitian/symmetric matrices; or that in [15] focusing on real symmetric matrices which have a positive definite linear combi- nation. Some other works focus on simultaneous block-diagonalizations of normal matrices, so does of Hermitian ones [13, 24]. An (equivalently) algorithmic con- dition for the real symmetric SDC problem is given in a preprint manuscript [19]. Very recently in the seminal paper [4], the authors develop an equivalent condition solving the complex symmetric SDC problem. Note that this admits T-congruence, since the matrices there are complex symmetric, instead of -one as in this paper. ∗ The simultaneous diagonalization via T-congruence for complex symmetric ma- trices does not guarantee for real setting. That is, the resulting nonsingular and diagonal matrices may not be real even thought the initial ones are real. An exam- ple given in [4] is that 0 1 1 1 C = , C = S2 1 1 1 2 1 0 ∈ are SDC via T-congruence. However, the resulting nonsingular matrix P and the T T corresponding diagonal ones P C1P,P C2P are properly complex. We will see in this paper that the simultaneous diagonalizableness via -congruence of Hermitian matrices will immediately holds true for real symmetric setting.∗ Turn- ing to the two matrices above, we will see from Theorem 4 below that they are not 1 0 1 R-SDC because C− C = is not similar to a real diagonal matrix (it has 1 2 1− 1 1 i√3 only complex eigenvalues ±2 ).
Load more

Recommended publications
  • New Foundations for Geometric Algebra1
    Text published in the electronic journal Clifford Analysis, Clifford Algebras and their Applications vol. 2, No. 3 (2013) pp. 193-211 New foundations for geometric algebra1 Ramon González Calvet Institut Pere Calders, Campus Universitat Autònoma de Barcelona, 08193 Cerdanyola del Vallès, Spain E-mail : [email protected] Abstract. New foundations for geometric algebra are proposed based upon the existing isomorphisms between geometric and matrix algebras. Each geometric algebra always has a faithful real matrix representation with a periodicity of 8. On the other hand, each matrix algebra is always embedded in a geometric algebra of a convenient dimension. The geometric product is also isomorphic to the matrix product, and many vector transformations such as rotations, axial symmetries and Lorentz transformations can be written in a form isomorphic to a similarity transformation of matrices. We collect the idea Dirac applied to develop the relativistic electron equation when he took a basis of matrices for the geometric algebra instead of a basis of geometric vectors. Of course, this way of understanding the geometric algebra requires new definitions: the geometric vector space is defined as the algebraic subspace that generates the rest of the matrix algebra by addition and multiplication; isometries are simply defined as the similarity transformations of matrices as shown above, and finally the norm of any element of the geometric algebra is defined as the nth root of the determinant of its representative matrix of order n. The main idea of this proposal is an arithmetic point of view consisting of reversing the roles of matrix and geometric algebras in the sense that geometric algebra is a way of accessing, working and understanding the most fundamental conception of matrix algebra as the algebra of transformations of multiple quantities.
    [Show full text]
  • Understanding the Spreading Power of All Nodes in a Network: a Continuous-Time Perspective
    i i “Lawyer-mainmanus” — 2014/6/12 — 9:39 — page 1 — #1 i i Understanding the spreading power of all nodes in a network: a continuous-time perspective Glenn Lawyer ∗ ∗Max Planck Institute for Informatics, Saarbr¨ucken, Germany Submitted to Proceedings of the National Academy of Sciences of the United States of America Centrality measures such as the degree, k-shell, or eigenvalue central- epidemic. When this ratio exceeds this critical range, the dy- ity can identify a network’s most influential nodes, but are rarely use- namics approach the SI system as a limiting case. fully accurate in quantifying the spreading power of the vast majority Several approaches to quantifying the spreading power of of nodes which are not highly influential. The spreading power of all all nodes have recently been proposed, including the accessibil- network nodes is better explained by considering, from a continuous- ity [16, 17], the dynamic influence [11], and the impact [7] (See time epidemiological perspective, the distribution of the force of in- fection each node generates. The resulting metric, the Expected supplementary Note S1). These extend earlier approaches to Force (ExF), accurately quantifies node spreading power under all measuring centrality by explicitly incorporating spreading dy- primary epidemiological models across a wide range of archetypi- namics, and have been shown to be both distinct from previous cal human contact networks. When node power is low, influence is centrality measures and more highly correlated with epidemic a function of neighbor degree. As power increases, a node’s own outcomes [7, 11, 18]. Yet they retain the common foundation degree becomes more important.
    [Show full text]
  • Similarity Preserving Linear Maps on Upper Triangular Matrix Algebras ୋ
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Linear Algebra and its Applications 414 (2006) 278–287 www.elsevier.com/locate/laa Similarity preserving linear maps on upper triangular matrix algebras ୋ Guoxing Ji ∗, Baowei Wu College of Mathematics and Information Science, Shaanxi Normal University, Xian 710062, PR China Received 14 June 2005; accepted 5 October 2005 Available online 1 December 2005 Submitted by P. Šemrl Abstract In this note we consider similarity preserving linear maps on the algebra of all n × n complex upper triangular matrices Tn. We give characterizations of similarity invariant subspaces in Tn and similarity preserving linear injections on Tn. Furthermore, we considered linear injections on Tn preserving similarity in Mn as well. © 2005 Elsevier Inc. All rights reserved. AMS classification: 47B49; 15A04 Keywords: Matrix; Upper triangular matrix; Similarity invariant subspace; Similarity preserving linear map 1. Introduction In the last few decades, many researchers have considered linear preserver problems on matrix or operator spaces. For example, there are many research works on linear maps which preserve spectrum (cf. [4,5,11]), rank (cf. [3]), nilpotency (cf. [10]) and similarity (cf. [2,6–8]) and so on. Many useful techniques have been developed; see [1,9] for some general techniques and background. Hiai [2] gave a characterization of the similarity preserving linear map on the algebra of all complex n × n matrices. ୋ This research was supported by the National Natural Science Foundation of China (no. 10571114), the Natural Science Basic Research Plan in Shaanxi Province of China (program no.
    [Show full text]
  • Similarity to Symmetric Matrices Over Finite Fields
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector FINITE FIELDS AND THEIR APPLICATIONS 4, 261Ð274 (1998) ARTICLE NO. FF980216 Similarity to Symmetric Matrices over Finite Fields Joel V. Brawley Clemson University, Clemson, South Carolina 29631 and Timothy C. Teitlo¤ Kennesaw State University, Kennesaw, Georgia 30144 E-mail: tteitlo¤@ksumail.kennesaw.edu Communicated by Zhe-Xian Wan Received October 22, 1996; revised March 31, 1998 It has been known for some time that every polynomial with coe¦cients from a finite field is the minimum polynomial of a symmetric matrix with entries from the same field. What have remained unknown, however, are the possible sizes for the symmetric matrices with a specified minimum polynomial and, in particular, the least possible size. In this paper we answer these questions using only the prime factoriz- ation of the given polynomial. Closely related is the question of whether or not a given matrix over a finite field is similar to a symmetric matrix over that field. Although partial results on that question have been published before, this paper contains a complete characterization. ( 1998 Academic Press 1. INTRODUCTION This paper seeks to solve two problems: PROBLEM 1. Determine if a given polynomial with coe¦cients from Fq, the finite field of q elements, is the minimum polynomial of a sym- metric matrix, and if so, determine the possible sizes of such symmetric matrices. PROBLEM 2. Characterize those matrices over Fq that are similar over Fq to symmetric matrices. 261 1071-5797/98 $25.00 Copyright ( 1998 by Academic Press All rights of reproduction in any form reserved.
    [Show full text]
  • Judgement of Matrix Similarity
    International Journal of Trend in Research and Development, Volume 8(5), ISSN: 2394-9333 www.ijtrd.com Judgement of Matrix Similarity Hailing Li School of Mathematics and Statistics, Shandong University of Technology, Zibo, China Abstract: Matrix similarity is very important in matrix theory. characteristic matrix of B. In this paper, several methods of judging matrix similarity are given. II. JUDGEMENT OF SIMILARITY OF MATRICES Keywords: Similarity; Transitivity; Matrix equivalence; Matrix Type 1 Using the Definition 1 to determine that the abstract rank two matrices are similar. I. INTRODUCTION Example 1 Let be a 2-order matrix, be a Matrix similarity theory has important applications not only in various branches of mathematics, such as differential 2-order invertible matrix, if , please equation, probability and statistics, computational mathematics, but also in other fields of science and technology. There are prove A many similar properties and conclusions of matrix, so it is necessary to study and sum up the similar properties and Prove judgement of matrix. Definition 1 Let A and B be n-order matrices, if there is an invertible matrix P, such that , then A is similar to B, and denoted by A~B. Definition 2 Let A,be an n-order matrix, the matrix is called the characteristic matrix of A; its determinant that is, by the definition, it can obtain is called the characteristic polynomial of A; is called the characteristic equation of A; the that root that satisfies the characteristic equation is called an eigenvalue of A; the nonzero solution vectors of the system Type 2 For choice questions, we can using Property 3 of linear equations are called the characteristic matrices to determine that two matrices are eigenvectors of the eigenvalue .
    [Show full text]
  • Matrix Similarity
    Matrix similarity Isak Johansson and Jonas Bederoff Eriksson Supervisor: Tilman Bauer Department of Mathematics 2016 1 Abstract This thesis will deal with similar matrices, also referred to as matrix conju- gation. The first problem we will attack is whether or not two given matrices are similar over some field. To solve this problem we will introduce the Ratio- nal Canonical Form, RCF. From this normal form, also called the Frobenius normal form, we can determine whether or not the given matrices are sim- ilar over any field. We can also, given some field F , see whether they are similar over F or not. To be able to understand and prove the existence and uniqueness of the RCF we will introduce some additional module theory. The theory in this part will build up to finally prove the theorems regarding the RCF that can be used to solve our problem. The next problem we will investigate is regarding simultaneous conjugation, i.e. conjugation by the same matrix on a pair of matrices. When are two pairs of similar matrices simultaneously conjugated? Can we find any necessary or even sufficient conditions on the matrices? We will address this more complicated issue with the theory assembled in the first part. 2 Contents 1 Introduction 4 2 Modules 5 2.1 Structure theorem for finitely generated modules over a P.I.D, existence . 8 2.2 Structure theorem for finitely generated modules over a P.I.D, uniqueness . 10 3 Similar matrices and normal forms 12 3.1 Linear transformations . 12 3.2 Rational Canonical Form .
    [Show full text]
  • Chapter 6 Eigenvalues and Eigenvectors
    Chapter 6 Eigenvalues and Eigenvectors Po-Ning Chen, Professor Department of Electrical and Computer Engineering National Chiao Tung University Hsin Chu, Taiwan 30010, R.O.C. 6.1 Introduction to eigenvalues 6-1 Motivations • The static system problem of Ax = b has now been solved, e.g., by Gauss- Jordan method or Cramer’s rule. • However, a dynamic system problem such as Ax = λx cannot be solved by the static system method. • To solve the dynamic system problem, we need to find the static feature of A that is “unchanged” with the mapping A. In other words, Ax maps to itself with possibly some stretching (λ>1), shrinking (0 <λ<1), or being reversed (λ<0). • These invariant characteristics of A are the eigenvalues and eigenvectors. Ax maps a vector x to its column space C(A). We are looking for a v ∈ C(A) such that Av aligns with v. The collection of all such vectors is the set of eigen- vectors. 6.1 Eigenvalues and eigenvectors 6-2 Conception (Eigenvalues and eigenvectors): The eigenvalue-eigenvector pair (λi, vi) of a square matrix A satisfies Avi = λivi (or equivalently (A − λiI)vi = 0) where vi = 0 (but λi can be zero), where v1, v2,..., are linearly independent. How to derive eigenvalues and eigenvectors? • For 3 × 3 matrix A, we can obtain 3 eigenvalues λ1,λ2,λ3 by solving 3 2 det(A − λI)=−λ + c2λ + c1λ + c0 =0. • If all λ1,λ2,λ3 are unequal, then we continue to derive: Av1 = λ1v1 (A − λ1I)v1 = 0 v1 =theonly basis of the nullspace of (A − λ1I) Av λ v ⇔ A − λ I v ⇔ v A − λ I 2 = 2 2 ( 2 ) 2 = 0 2 =theonly basis of the nullspace of ( 2 ) Av3 = λ3v3 (A − λ3I)v3 = 0 v3 =theonly basis of the nullspace of (A − λ3I) and the resulting v1, v2 and v3 are linearly independent to each other.
    [Show full text]
  • James B. Carrell Groups, Matrices, and Vector Spaces a Group Theoretic Approach to Linear Algebra Groups, Matrices, and Vector Spaces James B
    James B. Carrell Groups, Matrices, and Vector Spaces A Group Theoretic Approach to Linear Algebra Groups, Matrices, and Vector Spaces James B. Carrell Groups, Matrices, and Vector Spaces A Group Theoretic Approach to Linear Algebra 123 James B. Carrell Department of Mathematics University of British Columbia Vancouver, BC Canada ISBN 978-0-387-79427-3 ISBN 978-0-387-79428-0 (eBook) DOI 10.1007/978-0-387-79428-0 Library of Congress Control Number: 2017943222 Mathematics Subject Classification (2010): 15-01, 20-01 © Springer Science+Business Media LLC 2017 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made.
    [Show full text]
  • Math 4571 – Lecture 24
    Math 4571 { Lecture 24 Math 4571 (Advanced Linear Algebra) Lecture #24 Diagonalization: Review of Eigenvalues and Eigenvectors Diagonalization The Cayley-Hamilton Theorem This material represents x4.1-x4.2 from the course notes. Math 4571 { Lecture 24 Eigenvalues, I Recall our definition of eigenvalues and eigenvectors for linear transformations: Definition If T : V ! V is a linear transformation, a nonzero vector v with T (v) = λv is called an eigenvector of T , and the corresponding scalar λ 2 F is called an eigenvalue of T . By convention, the zero vector 0 is not an eigenvector. Definition If T : V ! V is a linear transformation, then for any fixed value of λ 2 F , the set Eλ of vectors in V satisfying T (v) = λv is a subspace of V called the λ-eigenspace. Math 4571 { Lecture 24 Eigenvalues, II Examples: 2 2 T : R ! R is the map with T (x; y) = h2x + 3y; x + 4yi, then v = h3; −1i is a 1-eigenvector since T (v) = h3; −1i = v, and w = h1; 1i is an 5-eigenvector since T (w) = h5; 5i = 5w. If T : Mn×n(R) ! Mn×n(R) is the transpose map, then the 1-eigenspace of T consists of the symmetric matrices, while the (−1)-eigenspace consists of the skew-symmetric matrices. If V is the space of infinitely-differentiable functions and D : V ! V is the derivative map, then for any real r, the function f (x) = erx is an eigenfunction with eigenvalue r since D(erx ) = rerx . R x If I : R[x] ! R[x] is the integration map I (p) = 0 p(t) dt, then I has no eigenvectors, since I (p) always has a larger degree than p, so I (p) cannot equal λp for any λ 2 R.
    [Show full text]
  • T-Jordan Canonical Form and T-Drazin Inverse Based on the T-Product
    T-Jordan Canonical Form and T-Drazin Inverse based on the T-Product Yun Miao∗ Liqun Qiy Yimin Weiz October 24, 2019 Abstract In this paper, we investigate the tensor similar relationship and propose the T-Jordan canonical form and its properties. The concept of T-minimal polynomial and T-characteristic polynomial are proposed. As a special case, we present properties when two tensors commutes based on the tensor T-product. We prove that the Cayley-Hamilton theorem also holds for tensor cases. Then we focus on the tensor decompositions: T-polar, T-LU, T-QR and T-Schur decompositions of tensors are obtained. When a F-square tensor is not invertible with the T-product, we study the T-group inverse and T-Drazin inverse which can be viewed as the extension of matrix cases. The expression of T-group and T-Drazin inverse are given by the T-Jordan canonical form. The polynomial form of T-Drazin inverse is also proposed. In the last part, we give the T-core-nilpotent decomposition and show that the T-index and T-Drazin inverse can be given by a limiting formula. Keywords. T-Jordan canonical form, T-function, T-index, tensor decomposition, T-Drazin inverse, T-group inverse, T-core-nilpotent decomposition. AMS Subject Classifications. 15A48, 15A69, 65F10, 65H10, 65N22. arXiv:1902.07024v2 [math.NA] 22 Oct 2019 ∗E-mail: [email protected]. School of Mathematical Sciences, Fudan University, Shanghai, 200433, P. R. of China. Y. Miao is supported by the National Natural Science Foundation of China under grant 11771099.
    [Show full text]
  • ISSN: 2320-5407 Int. J. Adv. Res. 6(7), 963-968
    ISSN: 2320-5407 Int. J. Adv. Res. 6(7), 963-968 Journal Homepage: - www.journalijar.com Article DOI: 10.21474/IJAR01/7446 DOI URL: http://dx.doi.org/10.21474/IJAR01/7446 RESEARCH ARTICLE SIMILARITY MEASURE FOR SOCIAL NETWORKS. Roland T H Siagian, Sawaluddin and Opim Salim Sitompul. Department of Mathematics, University of Sumatera Utara, Medan, Indonesia. …………………………………………………………………………………………………….... Manuscript Info Abstract ……………………. ……………………………………………………………… Manuscript History Along with the growth in the use of social networks, the measurement of social parameters (e.g., centrality and similarity) becomes more Received: 20 May 2018 important. Many algorithms have been proposed to measure the graph Final Accepted: 22 June 2018 similarity as a representation of social networks. The purpose of this Published: July 2018 paper is to analyze the characteristics of similarity algorithms, and Keywords:- compare the performance of each algorithms to determine its strengths Social Networks, DFS, BFS, SimRank, and weaknesses. P-Rank, PageSim, Vertex Similarity. Copy Right, IJAR, 2018,. All rights reserved. …………………………………………………………………………………………………….... Introduction:- Over the past few decades, major revolutions in the mass media field have been marked or more precisely created by new media such as computers, telephone networks, communication networks, the internet and multimedia technologies (Mahmoud and Auter, 2009). Mahmoud and Auter also explained further that online communication is the most important format in computer-mediated communication, that is with the internet as the medium. The internet is a great many-to-many communication networking the form of emails, news portals, chat rooms, groups, and webpages, which can applied in online journalism, e-commerce and online advertising. Along with this, social users increasing aggressively utilize the internet as a medium of communication.
    [Show full text]
  • Jordan Canonical Form with Parameters from Frobenius Form with Parameters
    Jordan Canonical Form with Parameters from Frobenius Form with Parameters Robert M. Corless, Marc Moreno Maza, and Steven E. Thornton ORCCA, University of Western Ontario, London, Ontario, Canada Motivation Parametric Matrix Computations in CAS Computer algebra systems generally give generic answers for computations on matrices with parameters. 1 Example Jordan canonical form of:2 3 6 α 0 1 7 6 7 6 7 6 0 α − 3 0 7 with α 2 C 4 5 0 0 −2 Maple Mathematica SymPy Sage 2 3 2 3 2 3 2 3 6 −2 7 6 −2 7 6 α − 3 7 6 7 6 −2 7 6 7 6 7 6 7 6 7 6 7 6 7 6 α 7 6 7 6 α 7 6 α 7 4 5 6 −3 + α 7 4 5 4 5 4 5 α − 3 α − 3 −2 α 2 Example Jordan canonical form2 of: 3 2 3 6 α 0 1 7 6 −2 0 1 7 6 7 6 7 6 7 α = −2 6 7 6 0 α − 3 0 7 −−−−! 6 0 −5 0 7 4 5 4 5 0 0 −2 0 0 −2 Maple Mathematica SymPy Sage 2 3 2 3 2 3 2 3 6 −5 7 6 −5 7 6 −5 7 6 −5 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 −2 1 7 6 −2 1 7 6 −2 1 7 6 −2 1 7 4 5 4 5 4 5 4 5 −2 −2 −2 −2 3 Prior Work • Arnol’d, V.I.: On matrices depending on parameters.
    [Show full text]