Afficher la notice abrégée

hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
hal.structure.identifierAnalyse cryptographique et arithmétique [CANARI]
dc.contributor.authorJOHANSSON, Fredrik
dc.date.accessioned2024-04-04T02:48:44Z
dc.date.available2024-04-04T02:48:44Z
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191768
dc.description.abstractEnWe 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.
dc.language.isoen
dc.title.enOn a fast and nearly division-free algorithm for the characteristic polynomial
dc.typeDocument de travail - Pré-publication
dc.subject.halInformatique [cs]/Calcul formel [cs.SC]
dc.subject.halInformatique [cs]/Analyse numérique [cs.NA]
dc.identifier.arxiv2011.12573
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-03016034
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03016034v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=JOHANSSON,%20Fredrik&rft.genre=preprint


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée