Results 1  10
of
240
Canonical Comprehensive Gröbner Bases
 Journal of Symbolic Computation
, 2002
"... Comprehensive Gröbner bases for parametric polynomial ideals were introduced, constructed, and studied by the author in 1992. Since then the construction has been implemented in the computer algebra systems aldes/sac2, mas, reduce and maple. A comprehensive Gröbner basis is a finite subset G of a p ..."
Abstract

Cited by 139 (4 self)
 Add to MetaCart
Comprehensive Gröbner bases for parametric polynomial ideals were introduced, constructed, and studied by the author in 1992. Since then the construction has been implemented in the computer algebra systems aldes/sac2, mas, reduce and maple. A comprehensive Gröbner basis is a finite subset G of a parametric polynomial ideal I such that σ(G) constitutes a Gröbner basis of the ideal generated by σ(I) under all specializations σ of the parameters in arbitrary fields. Thos concept has found numerous...
A Gröbner free alternative for polynomial system solving
 Journal of Complexity
, 2001
"... Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute a geometric resolution of the set of common roots of the system over the field of complex numbers. A geometric resolution consists of a primitive element of the algebraic ..."
Abstract

Cited by 80 (16 self)
 Add to MetaCart
Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute a geometric resolution of the set of common roots of the system over the field of complex numbers. A geometric resolution consists of a primitive element of the algebraic extension defined by the set of roots, its minimal polynomial and the parametrizations of the coordinates. Such a representation of the solutions has a long history which goes back to Leopold Kronecker and has been revisited many times in computer algebra. We introduce a new generation of probabilistic algorithms where all the computations use only univariate or bivariate polynomials. We give a new codification of the set of solutions of a positive dimensional algebraic variety relying on a new global version of Newton’s iterator. Roughly speaking the complexity of our algorithm is polynomial in some kind of degree of the system, in its height, and linear in the complexity of evaluation
Effective Algorithms for Parametrizing Linear Control Systems over Ore Algebras
 APPLICABLE ALGEBRA IN ENGINEERING, COMMUNICATION AND COMPUTING
"... ..."
A New Criterion for Normal Form Algorithms
 Proc. AAECC, volume 1719 of LNCS
, 1999
"... In this paper, we present a new approach for computing normal forms in the quotient algebra A of a polynomial ring R by an ideal I. It is based on a criterion, which gives a necessary and sufficient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I. This cr ..."
Abstract

Cited by 45 (16 self)
 Add to MetaCart
In this paper, we present a new approach for computing normal forms in the quotient algebra A of a polynomial ring R by an ideal I. It is based on a criterion, which gives a necessary and sufficient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I. This criterion does not require any monomial ordering and generalizes the Buchberger criterion of Spolynomials. It leads to a new algorithm for constructing the multiplicative structure of a zerodimensional algebra. Described in terms of intrinsic operations on vector spaces in the ring of polynomials, this algorithm extends naturally to Laurent polynomials.
Reduction of Systems of Nonlinear Partial Differential Equations to Simplified Involutive Forms
, 1996
"... We describe the rif algorithm which uses a finite number of differentiations and algebraic operations to simplify analytic nonlinear systems of partial differential equations to what we call reduced involutive form. This form includes the integrability conditions of the system and satisfies a consta ..."
Abstract

Cited by 42 (14 self)
 Add to MetaCart
We describe the rif algorithm which uses a finite number of differentiations and algebraic operations to simplify analytic nonlinear systems of partial differential equations to what we call reduced involutive form. This form includes the integrability conditions of the system and satisfies a constant rank condition. The algorithm is useful for classifying initial value problems for determined pde systems and can yield dramatic simplifications of complex overdetermined nonlinear pde systems. Such overdetermined systems arise in analysis of physical pdes for reductions to odes using the Nonclassical Method, the search for exact solutions of Einstein's field equations and the determination of discrete symmetries of differential equations. Application of the algorithm to the associated nonlinear overdetermined system of 856 pdes arising when the Nonclassical Method is applied to a cubic nonlinear Schrodinger system yields new results. Our algorithm combines features of geometric involutiv...
Involutive Bases of Polynomial Ideals
, 1999
"... In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a monomial set. Such a division provides for each monomial the ..."
Abstract

Cited by 39 (11 self)
 Add to MetaCart
In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a monomial set. Such a division provides for each monomial the selfconsistent separation of the whole set of variables into two disjoint subsets. They are called multiplicative and nonmultiplicative. Given an admissible ordering, this separation is applied to polynomials in terms of their leading monomials. As special cases of the separation we consider those introduced by Janet, Thomas and Pommaret for the purpose of algebraic analysis of partial differential equations. Given involutive division, we define an involutive reduction and an involutive normal form. Then we introduce, in terms of the latter, the concept of involutivity for polynomial systems. We prove that an involutive system is a special, generally redundant, form of a Gröbner basis. An algorithm for construction of involutive bases is proposed. It is shown that involutive divisions satisfying certain conditions, for example, those of Janet and Thomas, provide an algorithmic construction of an involutive basis for any polynomial ideal. Some optimization in computation of involutive bases is also analyzed. In particular, we incorporate Buchberger’s chain criterion to avoid unnecessary reductions. The implementation for Pommaret division has been done in Reduce.
Reach Set Computations Using Real Quantifier Elimination
, 2000
"... Reach set computations are of fundamental importance in control theory. We consider the reach set problem for openloop systems described by parametric inhomogeneous linear dierential systems and use real quanti er elimination methods to get exact and approximate solutions. For simple elementar ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
Reach set computations are of fundamental importance in control theory. We consider the reach set problem for openloop systems described by parametric inhomogeneous linear dierential systems and use real quanti er elimination methods to get exact and approximate solutions. For simple elementary functions we give an exact calculation of the cases where exact semialgebraic transcendental implicitization is possible. For the negative cases we provide approximate alternating using discrete point checking or safe estimations of reach sets and control parameter sets. The method employs a reduction of forward and backward reach set and control parameter set problem to the transcendental implicitization problem for the components of special solutions of simpler nonparametric systems. Numerous examples are computed using the redlog and qepcad packages.
Algebraic Properties of Multilinear Constraints
, 1996
"... In this paper the dioeerent algebraic varieties that can be generated from multiple view geometry with uncalibrated cameras have been investigated. The natural descriptor, Vn , to work with is the image of IP 3 in IP 2 \Theta IP 2 \Theta \Delta \Delta \Delta \Theta IP 2 under a corresponding product ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
In this paper the dioeerent algebraic varieties that can be generated from multiple view geometry with uncalibrated cameras have been investigated. The natural descriptor, Vn , to work with is the image of IP 3 in IP 2 \Theta IP 2 \Theta \Delta \Delta \Delta \Theta IP 2 under a corresponding product of projections, (A1 \Theta A2 \Theta : : : \Theta Am). Another descriptor, the variety Vb , is the one generated by all bilinear forms between pairs of views, which consists of all points in IP 2 \Theta IP 2 \Theta \Delta \Delta \Delta \Theta IP 2 where all bilinear forms vanish. Yet another descriptor, the variety V t , is the variety generated by all trilinear forms between triplets of views. It has been shown that when m = 3, Vb is a reducible variety with one component corresponding to V t and another corresponding to the trifocal plane. Furthermore, when m = 3, V t is generated by the three bilinearities and one trilinearity, when m = 4, V t is generated by the six bil...