On real factors of real interval polynomials

DOI10.1016/j.jsc.2008.04.014zbMath1188.68369OpenAlexW2052795968MaRDI QIDQ1025398

Hiroshi Sekigawa

Publication date: 18 June 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.014

zbMATH Keywords

polytopedivisibilityfactorinterval polynomialnearest polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Factorization (11Y05)

Uses Software

• Maple

Cites Work

• Interval linear systems: the state of the art
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• On approximate GCDs of univariate polynomials
• Nearest singular polynomials
• Remarks on automatic algorithm stabilization
• Floating point Gröbner bases.
• Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Locating real multiple zeros of a real interval polynomial
• Pseudofactors of multivariate polynomials
• Root Neighborhoods of a Polynomial
• Lectures on Polytopes
• Convex Polytopes
• The nearest polynomial with a given zero, and similar problems
• A note on a nearest polynomial with a given root
• The nearest polynomial with a given zero, revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On real factors of real interval polynomials