Hybrid method for computing the nearest singular polynomials (Q701907)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2128153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid method for computing the nearest singular polynomials |
scientific article; zbMATH DE number 2128153 |
Statements
Hybrid method for computing the nearest singular polynomials (English)
0 references
14 January 2005
0 references
We propose a combined symbolic-numeric algorithm for computing the nearest singular polynomial and its multiple zero. Explicit expressions of the minimal and the nearest singular polynomials are presented. A theoretical error bound and several numerical examples are given.
0 references
symbolic-numeric algorithm
0 references
nearest singular polynomial
0 references
error bound
0 references
numerical examples
0 references
quadratic form
0 references
minimization
0 references
multiple roots
0 references
0.85965496301651
0 references
0.8306878805160522
0 references
