Sciweavers

1291 search results - page 2 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 10 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
ADG
2006
Springer
204views Mathematics» more  ADG 2006»
13 years 11 months ago
Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
This paper describes the recent convergence of four topics: polynomial systems, flexibility of three dimensional objects, computational chemistry, and computer algebra. We discuss...
Robert H. Lewis, Evangelos A. Coutsias
ICDIM
2007
IEEE
14 years 2 days ago
Exploration of multiple roots for a polynomial system
Several problems from engineering, chemistry, medicine, etc. can be formulated as a system of equations. Finding a solution for such a system sometimes requires high computational...
Crina Grosan, Ajith Abraham
JSC
2010
155views more  JSC 2010»
13 years 4 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan