Re: Matrix exponentiation

Bill Allombert on Tue, 19 Nov 2019 18:22:06 +0100

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Matrix exponentiation

To: pari-users@pari.math.u-bordeaux.fr
Subject: Re: Matrix exponentiation
From: Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>
Date: Tue, 19 Nov 2019 18:22:04 +0100
Delivery-date: Tue, 19 Nov 2019 18:22:06 +0100
In-reply-to: <VI1PR06MB54861A3EABBF4B966F96C32C884C0@VI1PR06MB5486.eurprd06.prod.outlook.com>
Mail-followup-to: pari-users@pari.math.u-bordeaux.fr
References: <VI1PR06MB54861A3EABBF4B966F96C32C884C0@VI1PR06MB5486.eurprd06.prod.outlook.com>
User-agent: NeoMutt/20170113 (1.7.2)

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.

Follow-Ups:
- Re: Matrix exponentiation
  - From: Predrag Terzic <pedja.terzic@hotmail.com>

References:
- Matrix exponentiation
  - From: Predrag Terzic <pedja.terzic@hotmail.com>

Prev by Date: Matrix exponentiation
Next by Date: Re: Matrix exponentiation
Previous by thread: Matrix exponentiation
Next by thread: Re: Matrix exponentiation
Index(es):
- Date
- Thread