A recursive algorithm for constructing complicated Dixon matrices (Q606826)
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 5817350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recursive algorithm for constructing complicated Dixon matrices |
scientific article; zbMATH DE number 5817350 |
Statements
A recursive algorithm for constructing complicated Dixon matrices (English)
0 references
18 November 2010
0 references
Dixon polynomial
0 references
Dixon matrix
0 references
quantifier elimination
0 references
formal power series
0 references
numerical examples
0 references
system of polynomial equations
0 references
recursive algorithm
0 references
dynamic programming algorithm
0 references
0.91822666
0 references
0.9099336
0 references
0.8814274
0 references
0.87658894
0 references
0.87294245
0 references
0.8704773
0 references
0.8668397
0 references
0.8658093
0 references
