• Title/Summary/Keyword: unitary similarity

Search Result 6, Processing Time 0.016 seconds

DECOMPOSITION OF THE KRONECKER SUMS OF MATRICES INTO A DIRECT SUM OF IRREDUCIBLE MATRICES

  • Gu, Caixing;Park, Jaehui;Peak, Chase;Rowley, Jordan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.637-657
    • /
    • 2021
  • In this paper, we decompose (under unitary similarity) the Kronecker sum A ⊞ A (= A ⊗ I + I ⊗ A) into a direct sum of irreducible matrices, when A is a 3×3 matrix. As a consequence we identify 𝒦(A⊞A) as the direct sum of several full matrix algebras as predicted by Artin-Wedderburn theorem, where 𝒦(T) is the unital algebra generated by Tand T*.

BOUNDED AND UNBOUNDED OPERATORS SIMILAR TO THEIR ADJOINTS

  • Dehimi, Souheyb;Mortad, Mohammed Hichem
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.1
    • /
    • pp.215-223
    • /
    • 2017
  • In this paper, we establish results about operators similar to their adjoints. This is carried out in the setting of bounded and also unbounded operators on a Hilbert space. Among the results, we prove that an unbounded closed operator similar to its adjoint, via a cramped unitary operator, is self-adjoint. The proof of this result works also as a new proof of the celebrated result by Berberian on the same problem in the bounded case. Other results on similarity of hyponormal unbounded operators and their self-adjointness are also given, generalizing well known results by Sheth and Williams.

ON REDUCTION OF K-ALMOST NORMAL AND K-ALMOST CONJUGATE NORMAL MATRICES TO A BLOCK TRIDIAGONAL FORM

  • ASIL, K. NIAZI;KAMALVAND, M. GHASEMI
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.23 no.3
    • /
    • pp.267-282
    • /
    • 2019
  • This paper examines how one can build a block tridiagonal structure for k-almost normal matrices and also for k-almost conjugate normal matrices. We shall see that these representations are created by unitary similarity and unitary congruance transformations, respectively. It shall be proven that the orders of diagonal blocks are 1, k + 2, 2k + 3, ${\ldots}$, in both cases. Then these block tridiagonal structures shall be reviewed for the cases where the mentioned matrices satisfy in a second-degree polynomial. Finally, for these processes, algorithms are presented.

On the weyl spectrum of weight

  • Yang, Youngoh
    • Bulletin of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.91-97
    • /
    • 1998
  • In this paper we study the Weyl spectrum of weight $\alpha, \omega_\alpha(T)$, of an operator T acting on an infinite dimensional Hilbert space. Main results are as follows. Firstly, we show that the Weyll spectrum of weight $\alpha$ of a polynomially $\alpha$-compact operator is finite, and that similarity preserves polynomial $\alpha$-compactness and the $\alpha$-Weyl's theorem both. Secondly, we give a sufficient condition for an operator to be the sum of an unitary and a $\alpha$-compact operators.

  • PDF

Pseudogenes: Nuances and Nuisances in Molecular Diagnostics

  • Oh, Seung Hwan
    • Journal of Interdisciplinary Genomics
    • /
    • v.4 no.2
    • /
    • pp.19-23
    • /
    • 2022
  • Pseudogenes are genomic regions that contain gene-like sequences that have a high similarity to the known genes but are nonfunctional. They are categorized into processed, unprocessed, and unitary pseudogenes. Unprocessed pseudogenes generated by duplications can be problematic in sequencing approaches in molecular diagnostics. We discuss the risk of misdiagnosis when investigating genes with pseudogenes of high homology, and describe a method for identifying these small and annoying differences between parent genes and pseudogenes, including parent gene-specific assay design.

A METHOD FOR SOLVING OF LINEAR SYSTEM WITH NORMAL COEFFICIENT MATRICES

  • KAMALVAND, M.GHASEMI;FARAZMANDNIA, B.;ALIYARI, M.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.24 no.3
    • /
    • pp.305-320
    • /
    • 2020
  • This study aims to generalize MINRES-N2 method [1]. It means that we tend to obtain an algorithm to transfer each normal matrix - that its eigenvalues belong to an algebraic curve of low degree k- to its condensed form through using a unitary similarity transformation. Then, we aim to obtain a method to solve a system of linear equations that its coefficient matrix is equal to such a matrix by utilizing it. Finally this method is compared to the well-known GMRES method through using numerical examples. The results obtained through examples show that the given method is more efficient than GMRES.