Skip to main content
Fixed Point Theory and Algorithms for Sciences and Engineering
Download PDF
  • Research Article
  • Open access
  • Published:

Fixed Points of Two-Sided Fractional Matrix Transformations

Fixed Point Theory and Applications volume 2007, Article number: 041930 (2007) Cite this article

Abstract

Let and be complex matrices, and consider the densely defined map on matrices. Its fixed points form a graph, which is generically (in terms of ) nonempty, and is generically the Johnson graph ; in the nongeneric case, either it is a retract of the Johnson graph, or there is a topological continuum of fixed points. Criteria for the presence of attractive or repulsive fixed points are obtained. If and are entrywise nonnegative and is irreducible, then there are at most two nonnegative fixed points; if there are two, one is attractive, the other has a limited version of repulsiveness; if there is only one, this fixed point has a flow-through property. This leads to a numerical invariant for nonnegative matrices. Commuting pairs of these maps are classified by representations of a naturally appearing (discrete) group. Special cases (e.g., is in the radical of the algebra generated by and ) are discussed in detail. For invertible size two matrices, a fixed point exists for all choices of if and only if has distinct eigenvalues, but this fails for larger sizes. Many of the problems derived from the determination of harmonic functions on a class of Markov chains.

[1234567]

References

  1. Handelman D: Eigenvectors and ratio limit theorems for Markov chains and their relatives. Journal d'Analyse Mathématique 1999, 78: 61–116.

    Article  MATH  MathSciNet  Google Scholar 

  2. Daughtry J: Isolated solutions of quadratic matrix equations. Linear Algebra and Its Applications 1978,21(1):89–94. 10.1016/0024-3795(87)90202-3

    Article  MATH  MathSciNet  Google Scholar 

  3. Potter JE: Matrix quadratic solutions. SIAM Journal on Applied Mathematics 1966,14(3):496–501. 10.1137/0114044

    Article  MATH  MathSciNet  Google Scholar 

  4. Beavers AN Jr., Denman ED: A new solution method for quadratic matrix equations. Mathematical Biosciences 1974,20(1–2):135–143. 10.1016/0025-5564(74)90073-X

    Article  MATH  MathSciNet  Google Scholar 

  5. Douglas RG, Pearcy C: On a topology for invariant subspaces. Journal of Functional Analysis 1968,2(3):323–341. 10.1016/0022-1236(68)90010-4

    Article  MATH  MathSciNet  Google Scholar 

  6. Godsil C: Association schemes. http://quoll.uwaterloo.ca/pstuff/assoc

  7. Handelman D: A less complicated formula for Johnson graphs. in preparation

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, University of Ottawa, Ottawa, ON, K1N 6N5, Canada

    David Handelman

Authors
  1. David Handelman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Handelman.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Handelman, D. Fixed Points of Two-Sided Fractional Matrix Transformations. Fixed Point Theory Appl 2007, 041930 (2007). https://doi.org/10.1155/2007/41930

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1155/2007/41930

Keywords