Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions (Q651875)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions |
scientific article; zbMATH DE number 5989491
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions |
scientific article; zbMATH DE number 5989491 |
Statements
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions (English)
0 references
19 December 2011
0 references
perturbation
0 references
\(l^{\infty }\)-norm
0 references
Davenport-Schinzel sequence
0 references
location of polynomial zeroes
0 references
algorithms
0 references
nearest polynomial
0 references
zero in a given domain
0 references
rational function
0 references
asymptotic bit complexity
0 references
