On a fast and nearly division-free algorithm for the characteristic polynomial - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2020

On a fast and nearly division-free algorithm for the characteristic polynomial

Abstract

We review the Preparata-Sarwate algorithm, a simple $O(n^{3.5})$ method for computing the characteristic polynomial, determinant and adjugate of an $n \times n$ matrix using only ring operations together with exact divisions by small integers. The algorithm is a baby-step giant-step version of the more well-known Faddeev-Leverrier algorithm. We make a few comments about the algorithm and evaluate its performance empirically.
Fichier principal
Vignette du fichier
paper.pdf (160.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03016034 , version 1 (20-11-2020)
hal-03016034 , version 2 (21-11-2020)
hal-03016034 , version 3 (24-11-2020)

Identifiers

Cite

Fredrik Johansson. On a fast and nearly division-free algorithm for the characteristic polynomial. 2020. ⟨hal-03016034v3⟩
374 View
582 Download

Altmetric

Share

Gmail Facebook X LinkedIn More