Sciweavers

9 search results - page 1 / 2
» Computation of Darboux polynomials and rational first integr...
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 5 months ago
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
Guillaume Chèze
CASC
2005
Springer
113views Mathematics» more  CASC 2005»
13 years 10 months ago
Real Solving of Bivariate Polynomial Systems
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
Ioannis Z. Emiris, Elias P. Tsigaridas
CORR
2010
Springer
94views Education» more  CORR 2010»
12 years 12 months ago
Partitions and Coverings of Trees by Bounded-Degree Subtrees
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
David R. Wood
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
13 years 9 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
JC
2006
105views more  JC 2006»
13 years 4 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...