Simultaneous elimination by using several tools from real algebraic geometry
computer aided geometric designeliminationgreatest common divisor of polynomialsHermite's methodreal algebraic geometry
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Real algebraic and real-analytic geometry (14P99) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Numerical computation of solutions to systems of equations (65H10) Computer science aspects of computer-aided design (68U07) Symbolic computation and algebraic computation (68W30)
There are several methods in computer algebra to eliminate variables: Gröbner bases, resultants, Ritt-characteristic sets, etc. This paper presents two new elimination procedures for two particular problems: The simultaneous elimination of one variable from several polynomial that is based in a linear-algebra method to compute the degree of the gcd of several univariate polynomials over an integral domain, called \textit{S. Barnett}'s method [Proc. Camb. Philos. Soc. 70, 263-268 (1971; Zbl 0224.15018)], and the simultaneous elimination of several variables in several equations containing a Pham system (a zero-dimensional polynomial system with very good parameter specialization properties) that is based on Hermite's method. The extension of the technique above to more general systems is difficult because it depends on the existence of the universal base for a quotient ring.
- Polar varieties and efficient real elimination
- Generalized polar varieties and an efficient real elimination.
- On the intrinsic complexity of elimination problems in effective algebraic geometry
- Equimultiplicity, algebraic elimination, and blowing-up
- scientific article; zbMATH DE number 1961537
- Elimination and nonlinear equations of Rees algebras
- A Gröbner-based treatment of elimination theory for affine varieties
- Elimination with applications to singularities in positive characteristic
- Elimination algebras and inductive arguments in resolution of singularities
- Elimination ideals and Bézout relations
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- scientific article; zbMATH DE number 421661 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1023365 (Why is no real title available?)
- scientific article; zbMATH DE number 1157666 (Why is no real title available?)
- scientific article; zbMATH DE number 1163432 (Why is no real title available?)
- scientific article; zbMATH DE number 3055967 (Why is no real title available?)
- Inertia characteristics of self-adjoint matrix polynomials
- Multidimensional analogues of Newton's formulas for systems of nonlinear algebraic equations and some of their applications
- On the combinatorial and algebraic complexity of quantifier elimination
- On the complexity of computing the greatest common divisor of several univariate polynomials
- Radical computations of zero-dimensional ideals and real root counting.
- Solutions of systems of algebraic equations and linear maps on residue class rings
This page was built for publication: Simultaneous elimination by using several tools from real algebraic geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808663)
