A note on a nearest polynomial with a given root
From MaRDI portal
Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Polynomials and rational functions of one complex variable (30C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)
Recommendations
- The nearest polynomial with a given zero, revisited
- The nearest polynomial to multiple given polynomials with a given zero in the real case
- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
- Computing the nearest singular univariate polynomials with given root multiplicities
- On a problem of Nesterenko: when is the closest root of a polynomial a real number?
Cited in
(17)- On real factors of real interval polynomials
- 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 with a zero in a given domain
- Efficient computation of the nearest polynomial by linearized alternating direction method
- A sequence of nearest polynomials with given factors
- Using weighted norms to find nearest polynomials satisfying linear constraints
- The nearest polynomial to multiple given polynomials with a given zero
- On a problem of Nesterenko: when is the closest root of a polynomial a real number?
- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
- scientific article; zbMATH DE number 5577992 (Why is no real title available?)
- Computing the nearest singular univariate polynomials with given root multiplicities
- scientific article; zbMATH DE number 1262454 (Why is no real title available?)
- The nearest polynomial with a given zero, revisited
- The nearest complex polynomial with a zero in a given complex domain
- Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
- 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: A note on a nearest polynomial with a given root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739510)