Recurrences for Entries of Powers of Matrices
Stănică, Gabriela N.
MetadataShow full item record
In this note, giving course to a challenge in a recent paper of Larcombe , we find the entries of any nth power of a 3 x 3 matrix, and as a byproduct, we recover Larcombe's result on 2 x 2 matrices. Further, we look at block matrices and show an invariance result for the powers of such matrices.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Demmel, J. W.; Gragg, William B. (Monterey, California. Naval Postgraduate School, 1992); NPS-MA-92-010It is known that small relative perturbations in the entries of a bidiagonal matrix only cause small relative perturbations in its singular values, independent of the values of the matrix entries. In this paper we show ...
Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors Solus, Liam; Uhler, Caroline; Yoshida, Ruriko (Elsevier, 2016);For a graph G with p vertices the closed convex cone S≽0(G) consists of all real positive semidefinite p × p matrices whose sparsity pattern is given by G, that is, those matrices with zeros in the off-diagonal entries ...
Florkowski, Stanley F. (Monterey, California. Naval Postgraduate School, 2008);In Graph Theory, every graph can be expressed in terms of certain real, symmetric matrices derived from the graph, most notably the adjacency or Laplacian matrices. Spectral Graph Theory focuses on the set of eigenvalues ...