Pages that link to "Item:Q5739514"

The following pages link to The nearest polynomial with a given zero, revisited (Q5739514):

Displaying 11 items.

• Computing the nearest singular univariate polynomials with given root multiplicities (Q385010) (← links)
• Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
• The nearest complex polynomial with a zero in a given complex domain (Q650944) (← links)
• Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions (Q651875) (← links)
• On real factors of real interval polynomials (Q1025398) (← links)
• Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization (Q2290644) (← links)
• A unified approach to computing the nearest complex polynomial with a given zero (Q2354766) (← links)
• The nearest polynomial to multiple given polynomials with a given zero in the real case (Q2357370) (← links)
• The nearest polynomial with a zero in a given domain (Q2378507) (← links)
• Efficient computation of the nearest polynomial by linearized alternating direction method (Q2663820) (← links)
• The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval (Q3597978) (← links)