A recombination algorithm for the decomposition of multivariate rational functions - Université Toulouse 1 Capitole Accéder directement au contenu
Article Dans Une Revue Mathematics of Computation Année : 2013

A recombination algorithm for the decomposition of multivariate rational functions

Résumé

In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study the complexity of this strategy and we show that this method improves the previous ones. In appendix, we explain how the strategy proposed recently by J. Berthomieu and G. Lecerf for the sparse factorization can be used in the decomposition setting. Then we deduce a decomposition algorithm in the sparse bivariate case and we give its complexity
Fichier principal
Vignette du fichier
cheze_recomb_decomp.pdf (251.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00531601 , version 1 (03-11-2010)

Identifiants

Citer

Guillaume Chèze. A recombination algorithm for the decomposition of multivariate rational functions. Mathematics of Computation, 2013, 82, pp.1793--1812. ⟨hal-00531601⟩
333 Consultations
632 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More