Pages that link to "Item:Q650944"
From MaRDI portal
The following pages link to The nearest complex polynomial with a zero in a given complex domain (Q650944):
Displaying 8 items.
- Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions (Q651875) (← links)
- The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach (Q1985438) (← 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 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)
- A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension (Q6548958) (← links)