On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems (Q1091081)
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: On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems |
scientific article; zbMATH DE number 4009661
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems |
scientific article; zbMATH DE number 4009661 |
Statements
On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems (English)
0 references
1985
0 references
The author discusses the application of parallel and sequential techniques to the eigenvalue approach for rootfinding of polynomials.
0 references
algebraic algorithms
0 references
roots of a polynomial
0 references
computational complexity
0 references
sequential algorithm
0 references
eigenvalue
0 references
0.8780604
0 references
0.87665373
0 references
0.8712059
0 references
0.8643119
0 references
0.86126506
0 references
0.8605721
0 references
