The nearest polynomial to multiple given polynomials with a given zero

DOI10.1145/2631948.2631975zbMath1345.68295OpenAlexW2014020176MaRDI QIDQ2819727

Hiroshi Sekigawa

Publication date: 29 September 2016

Published in: Proceedings of the 2014 Symposium on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2631948.2631975

zbMATH Keywords

nearest polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical computation of roots of polynomial equations (65H04)

Related Items (4)

Efficient computation of the nearest polynomial by linearized alternating direction method ⋮ 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 ⋮ The nearest polynomial to multiple given polynomials with a given zero in the real case

This page was built for publication: The nearest polynomial to multiple given polynomials with a given zero