Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
Revision as of 12:13, 28 February 2024
scientific article; zbMATH DE number 6268305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of zeros of polynomial systems with bounded degree under finite-precision |
scientific article; zbMATH DE number 6268305 |
Statements
Fast computation of zeros of polynomial systems with bounded degree under finite-precision (English)
0 references
12 March 2014
0 references
Smale's 17th problem
0 references
finite-precision
0 references
round-off error
0 references
complex polynomial systems
0 references
fixed precise algorithm
0 references
variable precise algorithm
0 references
