Predrag Terzic on Tue, 19 Nov 2019 18:41:45 +0100 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
Re: Matrix exponentiation |
Let me make myself clear.
If M=[1,1;1,0] and n=5 which algorithm is used to calculate M^n and what is its computational complexity?
Pedja
From: Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>
Sent: Tuesday, November 19, 2019 6:22 PM To: pari-users@pari.math.u-bordeaux.fr <pari-users@pari.math.u-bordeaux.fr> Subject: Re: Matrix exponentiation On Tue, Nov 19, 2019 at 05:00:17PM +0000, Predrag Terzic wrote:
> Which algorithm is used for matrix exponentiation in PARI/GP 2.11.1 > and what is its computational complexity? Is it repeated squaring > algorithm (binary exponentiation) or something else? Matrix exponentiation is not available in PARI/GP. exp(M) does component-wise exponentiation. Sorry! Bill. |