Matrix powering in PARI/GP

Asked Nov 19 '19 at 13:38

Active Nov 20 '19 at 07:32

Viewed 68 times

Which algorithm is used for matrix powering in PARI/GP and what is its computational complexity? Is it repeated squaring algorithm (binary powering) or something else? I cannot find these informations on the internet.

SOLVED

According to Bill Allombert (main PARI/GP developer) it is a binary powering which has O(log n) computational complexity.

edited Nov 20 '19 at 07:32

asked Nov 19 '19 at 13:38

Pedja

1

Maybe have a look at the source code? https://pari.math.u-bordeaux.fr/pub/pari/snapshots/ – JohanC Nov 19 '19 at 14:59
@JohanC Thank you for the link. – Pedja Nov 19 '19 at 17:03
1

Instead of appending _Solved […]_ to the question, you can actually answer your own question below. – Jeppe Stig Nielsen Dec 25 '19 at 21:45

Matrix powering in PARI/GP

0 Answers0