𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Bézout Construction of the Resultant

✍ Scribed by P. Bikker; A.Yu. Uteshev

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
860 KB
Volume
28
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

This paper deals with some ideas of Bézout and his successors Poisson, Netto and Laurent for solving polynomial systems. We treat them from the determinantal and from the Gröbner basis point of view. This results in effective algorithms for constructing the multivariate resultant. Other problems of Elimination Theory are discussed: how to find an eliminant for a polynomial system, how to represent its zeroes as the rational functions of the roots of this eliminant and how to separate zeroes.

📜 SIMILAR VOLUMES

Fast Computation of the Bezout and Dixon
Fast Computation of the Bezout and Dixon Resultant Matrices
✍ Eng-Wee Chionh; Ming Zhang; Ronald N. Goldman 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon-Cayley resultant matrix for three bivariate polynomials of bidegree (m, n). Standard methods based on explicit formulas re

Stabilization of nonlinear systems based
Stabilization of nonlinear systems based on a generalized Bézout identity
✍ Alfonso Baños 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 604 KB

The relationship between the BCzout and input-output approaches to right-coprimeness is investigated. We introduce a generalized BCzout identity and analyze its relationship to right-coprimeness. In terms of the generalized BCzout identity, a right factorization of a nonlinear plant is coprime acco

The Bézout equation for functions of log
The Bézout equation for functions of log-type growth in convex domains of finite type
✍ Michał Jasiczak 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

The aim of this paper is to solve a division problem for the algebra of functions, which are holomorphic in a domain D ⊂ C n , n > 1, and grow near the boundary not faster than some power oflog dist(z, bD). The domain D is assumed to be smoothly bounded and convex of finite d'Angelo type.

On the Resolution of Resultant Type Equa
On the Resolution of Resultant Type Equations
✍ István Gaál 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Given an irreducible polynomial P ∈ Z[X] of degree at least three and 0 = a ∈ Z we are going to determine all those monic quadratic polynomials This is the first attempt for the complete resolution of resultant type equations. We illustrate our algorithm with a detailed example.