A recombination algorithm for the decomposition of multivariate rational functions

Details A recombination algorithm for the decomposition of multivariate rational functions A recombination algorithm for the decomposition of multivariate rational functions

2010-11-03

arxiv.org/abs/1011.0972v1

Computer Science

Symbolic Computation

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

A recombination algorithm for the decomposition of multivariate rational functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A recombination algorithm for the decomposition of multivariate rational functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A recombination algorithm for the decomposition of multivariate rational functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603865