Hybrid method for computing the nearest singular polynomials (Q701907): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5689624 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4232504 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Detection and validation of clusters of polynomial zeros / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4227320 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On approximate GCDs of univariate polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5645536 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nearest singular polynomials / rank | |||
Normal rank | |||
Revision as of 16:28, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hybrid method for computing the nearest singular polynomials |
scientific article |
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
