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

DOI10.1016/J.JSC.2011.08.012zbMATH Open1252.65088OpenAlexW2065958989MaRDI QIDQ651875FDOQ651875

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 sequence\(l^{\infty }\)-normasymptotic bit complexitylocation of polynomial zeroesnearest polynomialzero in a given domain

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the asymptotic and practical complexity of solving bivariate systems over the reals
• Real Algebraic Numbers: Complexity Analysis and Experimentation
• Some dynamic computational geometry problems
• The nearest polynomial with a given zero, and similar problems
• The nearest polynomial with a given zero, revisited
• Stability conditions for polytopes of polynomials
• A Combinatorial Problem Connected with Differential Equations
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• The nearest polynomial with a zero in a given domain
• Root Neighborhoods of a Polynomial
• A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
• Locating real multiple zeros of a real interval polynomial
• The nearest polynomial with a zero in a given domain from a geometrical viewpoint
• A note on a nearest polynomial with a given root

Cited In (3)

• 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
• A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension

This page was built for publication: Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651875)