I have a nxn tridiagonal matrix (let's name it A) and i want to find a way to solve A(adsbygoogle = window.adsbygoogle || []).push({}); ^{p}, p=1,2,3,....inf, most efficient* (using the structure of my matrix)

my first problem is how many calculations do i need for A^{2},

and then how many calculations for the hole A^{p}?

any help please!!!

*by most efficient i mean with the least calculations possible

**Physics Forums | Science Articles, Homework Help, Discussion**

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!

# Tridiagonal matrices multiplication

**Physics Forums | Science Articles, Homework Help, Discussion**