Sciweavers

ISSAC
2005
Springer
70views Mathematics» more  ISSAC 2005»
14 years 5 months ago
Approximation of dynamical systems using s-systems theory: application to biological systems
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
Laurent Tournier
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 5 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
ISSAC
2005
Springer
63views Mathematics» more  ISSAC 2005»
14 years 5 months ago
Symbolic-numeric completion of differential systems by homotopy continuation
Two ideas are combined to construct a hybrid symbolicnumeric differential-elimination method for identifying and including missing constraints arising in differential systems. F...
Greg Reid, Jan Verschelde, Allan D. Wittkopf, Weny...
ISSAC
2005
Springer
110views Mathematics» more  ISSAC 2005»
14 years 5 months ago
Multivariate power series multiplication
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...
Éric Schost
ISSAC
2005
Springer
94views Mathematics» more  ISSAC 2005»
14 years 5 months ago
Domains and expressions: an interface between two approaches to computer algebra
This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach t...
Cosmin E. Oancea, Stephen M. Watt
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
14 years 5 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
ISSAC
2005
Springer
97views Mathematics» more  ISSAC 2005»
14 years 5 months ago
Probabilistic algorithms for computing resultants
Let A and B be two polynomials in   [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
Michael B. Monagan