Bounds for resultants of univariate and bivariate polynomials

DOI10.1016/j.laa.2009.08.012zbMath1220.13021MaRDI QIDQ848582

Alexander Lifshitz, Yuval Bistritz

Publication date: 4 March 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.08.012

zbMATH Keywords

Sylvester matrix; resultant; Bezoutian; Hadamard bound

Mathematics Subject Classification ID

15A60: Norms of matrices, numerical range, applications of functional analysis to matrix theory

11C20: Matrices, determinants in number theory

13P15: Solving polynomial systems; resultants

Related Items

Fraction-free computation of the unit-circle resultant with any singularity profile, An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties, Computing Generator in Cyclotomic Integer Rings, Matrix algebraic properties of the Fisher information matrix of stationary processes, Codes correcting restricted errors, Number of common roots and resultant of two tropical univariate polynomials, Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, Computing discrete logarithms in \(\mathbb F_{p^6}\), Efficient \(q\)-integer linear decomposition of multivariate polynomials, Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case, A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Computational aspects of deciding if all roots of a polynomial lie within the unit circle
• Generalized Bezoutians and families of efficient zero-location procedures
• Zero location of polynomials with respect to the unit-circle unhampered by nonessential singularities
• On testing stability of 2-D discrete systems by a finite collection of 1-D stability tests
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• Algorithms in real algebraic geometry