Minimum converging precision of the QR-factorization algorithm for real polynomial GCD (Q5301675)
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: Minimum converging precision of the QR-factorization algorithm for real polynomial GCD |
scientific article; zbMATH DE number 5494045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum converging precision of the QR-factorization algorithm for real polynomial GCD |
scientific article; zbMATH DE number 5494045 |
Statements
20 January 2009
0 references
0.7860974073410034
0 references
0.7783790826797485
0 references
0.7562796473503113
0 references
