English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51258/86283 (59%)
Visitors : 8009916      Online Users : 60
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106937


    Title: Nonnegative square roots of matrices
    Authors: Bit-ShunTam;Peng-RueiHuang
    Keywords: Nonnegative matrix;Nonnegative square root;Square root of digraph;Permutation digraph;Bigraph;Monomial matrices;Nilpotent matrix;Rank-one matrix
    Date: 2016-06-01
    Issue Date: 2016-08-15
    Publisher: Elsevier Inc.
    Abstract: By the square root of a (square) matrix A we mean a matrix B that satisfies B2=A. In this paper, we begin a study of the (entrywise) nonnegative square roots of nonnegative matrices, adopting mainly a graph-theoretic approach. To start with, we settle completely the question of existence and uniqueness of nonnegative square roots for 2-by-2 nonnegative matrices. By the square of a digraph H , denoted by H2, we mean the digraph with the same vertex set as H such that (i,j) is an arc if there is a vertex k such that (i,k) and (k,j) are both arcs in H. We call a digraph H a square root of a digraph G if H2=G. It is observed that a necessary condition for a nonnegative matrix to have a nonnegative square root is that its digraph has a square root, and also that a digraph G has a square root if and only if there exists a nonnegative matrix A with digraph G such that A has a nonnegative square root. We consider when or whether certain kinds of digraphs (including digraphs that are disjoint union of directed paths and circuits, permutation digraphs or a special kind of bigraphs) have square roots. We also consider when certain kinds of nonnegative matrices (including monomial matrices, rank-one matrices and nilpotent matrices with index two) have nonnegative square roots. A known characterization of loopless digraphs to have square roots, due to F. Escalantge, L. Montejano, and T. Rojano, is extended (and amended) to digraphs possibly with loops. Some natural open questions are also posed.
    Relation: Linear Algebra and its Applications 498, pp.404-440
    DOI: 10.1016/j.laa.2015.11.011
    Appears in Collections:[數學學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML64View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback