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

AbstractThe application of the recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to other numerical problems is considered. Some estimates for the computational complexity of the resulting sequential and parallel algorithms are presented