A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity (Q3566648)
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 5718303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity |
scientific article; zbMATH DE number 5718303 |
Statements
A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity (English)
0 references
8 June 2010
0 references
symmetric functions
0 references
generating functions
0 references
recurrence relation
0 references
multiple roots
0 references
root-finding
0 references
iteration functions
0 references
0 references
0 references
0 references
0.9022088
0 references
0.90185106
0 references
0.89461005
0 references
0.8941211
0 references
0.8886844
0 references
0.8872497
0 references
0.88636947
0 references
0.88636935
0 references
