Today in the lecture we have learned the Putzer Algorithm, which enables us to calculate the higher powers(A^n, n>1 an integer) of a square matrix A. The other well-known methods use the Cayley-Hamilton Theorem, and the Jordan form of a matrix. I wonder whether there are other efficient ways to evaluate A^n.(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Finding powers of a square matrix

Loading...

Similar Threads - Finding powers square | Date |
---|---|

I How to find admissible functions for a domain? | Jan 31, 2018 |

I How to find the matrix of the derivative endomorphism? | Oct 22, 2017 |

I Finding the Kernel of a Matrix Map | Sep 15, 2017 |

Find the highest power of 2 dividing n! | Oct 20, 2007 |

Power series to find the inverse of any function in Z_2[x]? | Dec 5, 2005 |

**Physics Forums - The Fusion of Science and Community**