Results 1 
8 of
8
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
, 2001
"... In engineering and applied mathematics, polynomial systems arise whose solution sets contain components of different dimensions and multiplicities. In this article we present algorithms, based on homotopy continuation, that compute much of the geometric information contained in the primary decomposi ..."
Abstract

Cited by 58 (27 self)
 Add to MetaCart
In engineering and applied mathematics, polynomial systems arise whose solution sets contain components of different dimensions and multiplicities. In this article we present algorithms, based on homotopy continuation, that compute much of the geometric information contained in the primary decomposition of the solution set. In particular, ignoring multiplicities, our algorithms lay out the decomposition of the set of solutions into irreducible components, by finding, at each dimension, generic points on each component. As byproducts, the computation also determines the degree of each component and an upper bound on itsmultiplicity. The bound issharp (i.e., equal to one) for reduced components. The algorithms make essential use of generic projection and interpolation, and can, if desired, describe each irreducible component precisely as the common zeroesof a finite number of polynomials.
Numerical Homotopies to compute generic Points on positive dimensional Algebraic Sets
 Journal of Complexity
, 1999
"... Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for fourbar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A procedure of A. Sommese and C. Wampler consists in slicing the com ..."
Abstract

Cited by 51 (24 self)
 Add to MetaCart
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for fourbar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A procedure of A. Sommese and C. Wampler consists in slicing the components with linear subspaces in general position to obtain generic points of the components as the isolated solutions of an auxiliary system. Since this requires the solution of a number of larger overdetermined systems, the procedure is computationally expensive and also wasteful because many solution paths diverge. In this article an embedding of the original polynomial system is presented, which leads to a sequence of homotopies, with solution paths leading to generic points of all components as the isolated solutions of an auxiliary system. The new procedure significantly reduces the number of paths to solutions that need to be followed. This approach has been implemented and applied to...
Using monodromy to decompose solution sets of polynomial systems into irreducible components
 PROCEEDINGS OF A NATO CONFERENCE, FEBRUARY 25  MARCH 1, 2001, EILAT
, 2001
"... ..."
Numerical Irreducible Decomposition using PHCpack
, 2003
"... Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capability as a blackbox device to solve systems which have positive dimensional components of solutions. We indicate how the ..."
Abstract

Cited by 21 (14 self)
 Add to MetaCart
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capability as a blackbox device to solve systems which have positive dimensional components of solutions. We indicate how the software package PHCpack can be used in conjunction with Maple and programs written in C. We describe a numerically stable algorithm for decomposing positive dimensional solution sets of polynomial systems into irreducible components.
On Factorized Gröbner Bases
 Computer algebra in science and engineering, pages 77 – 89. World Scientific
, 1994
"... We report on some experience with a new version of the well known Gröbner algorithm with factorization and constraint inequalities, implemented in our REDUCE package CALI, [12]. We discuss some of its details and present run time comparisons with other existing implementations on well splitting exam ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We report on some experience with a new version of the well known Gröbner algorithm with factorization and constraint inequalities, implemented in our REDUCE package CALI, [12]. We discuss some of its details and present run time comparisons with other existing implementations on well splitting examples.
Representing polynomials in computer algebra systems
 In Proc. New Computer Technologies in Control Systems
, 1994
"... There are discussed implementational aspects of the specialpurpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and noncommutative polynomials are described. Furthermo ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
There are discussed implementational aspects of the specialpurpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and noncommutative polynomials are described. Furthermore, comparisons of time and memory requirements of di erent polynomial representations are reported. 1
About the Polynomial System Solve Facility of Axiom
 Michael J. Wester, John Wiley & Sons, Chichester, United Kingdom, ISBN 047198353
, 1996
"... In memoriam to Renate. We report on some experiences with the general purpose Computer Algebra Systems (CAS) Axiom, Macsyma, Maple, Mathematica, MuPAD, and Reduce solving systems of polynomial equations and the way they present their solutions. This snapshot (taken in spring 1996) of the current pow ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In memoriam to Renate. We report on some experiences with the general purpose Computer Algebra Systems (CAS) Axiom, Macsyma, Maple, Mathematica, MuPAD, and Reduce solving systems of polynomial equations and the way they present their solutions. This snapshot (taken in spring 1996) of the current power of the different systems in a special area concentrates both on CPUtimes and the quality of the output. 1
Computing subfields : Reverse of the primitive element problem
 In Computational algebraic geometry
, 1993
"... We describe an algorithm which computes all subfields of an effectively given finite algebraic extension. Although the base field can be arbitrary, we focus our attention on the rationals. This appears to be a fundamental tool for the simplification of algebraic numbers. Introduction Many algo ..."
Abstract
 Add to MetaCart
We describe an algorithm which computes all subfields of an effectively given finite algebraic extension. Although the base field can be arbitrary, we focus our attention on the rationals. This appears to be a fundamental tool for the simplification of algebraic numbers. Introduction Many algorithms in computer algebra contain subroutines which require to use algebraic numbers. Computing with them is especially important when polynomial systems of equation have to be solved. As an example let us consider the now called cyclic 7throots of unit, which are the solutions of the following system [4, 1] : a + b + c + d + e + f + g = 0 ab + bc + cd + de + ef + fg + ga = 0 abc + bcd + cde + def + efg + fga + gab = 0 abcd + bcde + cdef + defg + efga + fgab + gabc = 0 abcde + bcdef + cdefg + defga + efgab + fgabc + gabcd = 0 abcdef + bcdefg + cdefga + defgab + efgabc + fgabcd + gabcde = 0 abcdefg = 1: Some of the solutions of this system are of the form (a; b; c; 1=c; 1=b; 1=a; 1...