Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions

DOI10.1016/j.jsc.2011.08.012zbMath1252.65088OpenAlexW2065958989MaRDI QIDQ651875

Hiroshi Sekigawa

Publication date: 19 December 2011

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

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

zbMATH Keywords

algorithmsperturbationrational functionDavenport-Schinzel sequencenearest polynomial\(l^{\infty }\)-normasymptotic bit complexitylocation of polynomial zeroeszero in a given domain

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization ⋮ A unified approach to computing the nearest complex polynomial with a given zero

Cites Work

• A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
• On the asymptotic and practical complexity of solving bivariate systems over the reals
• Some dynamic computational geometry problems
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• The nearest polynomial with a zero in a given domain
• Locating real multiple zeros of a real interval polynomial
• Root Neighborhoods of a Polynomial
• Stability conditions for polytopes of polynomials
• The nearest polynomial with a given zero, and similar problems
• The nearest polynomial with a zero in a given domain from a geometrical viewpoint
• Real Algebraic Numbers: Complexity Analysis and Experimentation
• A Combinatorial Problem Connected with Differential Equations
• 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: Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions