arXiv Open Access 2010

A recombination algorithm for the decomposition of multivariate rational functions

Guillaume Chèze

Lihat Sumber

Abstrak

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

Topik & Kata Kunci

cs.SC cs.DS math.AC

Penulis (1)

Guillaume Chèze

Format Sitasi

APA MLA BibTeX

Chèze, G. (2010). A recombination algorithm for the decomposition of multivariate rational functions. https://arxiv.org/abs/1011.0972

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2010
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓