Sciweavers

80 search results - page 12 / 16
» jsc 2006
Sort
View
JSC
2006
132views more  JSC 2006»
13 years 8 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
JSC
2006
72views more  JSC 2006»
13 years 8 months ago
Algebraic solutions of holomorphic foliations: An algorithmic approach
We present two algorithms that can be used to check whether a given holomorphic foliation of the projective plane has an algebraic solution, and discuss the performance of their im...
S. C. Coutinho, L. Menasché Schechter
JSC
2006
106views more  JSC 2006»
13 years 8 months ago
Markov bases for noncommutative Fourier analysis of ranked data
To calibrate Fourier analysis of S5 ranking data by Markov chain Monte Carlo techniques, a set of moves (Markov basis) is needed. We calculate this basis, and use it to provide a ...
Persi Diaconis, Nicholas Eriksson
JSC
2006
76views more  JSC 2006»
13 years 8 months ago
Fast computation of special resultants
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
Alin Bostan, Philippe Flajolet, Bruno Salvy, &Eacu...
JSC
2006
81views more  JSC 2006»
13 years 8 months ago
Complexity bounds for zero-test algorithms
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
Joris van der Hoeven, John Shackell