A unified approach to computing the nearest complex polynomial with a given zero (Q2354766)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unified approach to computing the nearest complex polynomial with a given zero |
scientific article |
Statements
A unified approach to computing the nearest complex polynomial with a given zero (English)
0 references
24 July 2015
0 references
nearest polynomial
0 references
dual norm
0 references
explicit expression
0 references
Lagrange dual problem
0 references
0 references
0 references
