Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/moc/BriquelCPR14, #quickstatements; #temporary_batch_1731461124002 |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000736017 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/moc/BriquelCPR14 / rank | |||
Normal rank |
Latest revision as of 02:51, 13 November 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
0 references