On the convergence order for some methods of simultaneous root finding for polynomials using a computer algebra system

zbMATH Open1249.65106MaRDI QIDQ2881180FDOQ2881180

Authors Ernest Scheiber 

Publication date 3 April 2012

Published in Bulletin of the Transilvania University of Brașov. Series III. Mathematics, Informatics, Physics (Search for Journal in Brave)

zbMATH Keywords

convergence orderparallel methodroots of polynomial

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99) Numerical computation of roots of polynomial equations (65H04) Simultaneous approximation (41A28)

Recommendations

• Convergence conditions of some methods for the simultaneous computation of polynomial zero
• On initial conditions for the convergence of simultaneous root finding methods
• On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros
• Publication:4885365
• scientific article; zbMATH DE number 1206065

Cited In (2)

• 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
• A generalized algorithm for the order verification of numerical methods

Uses Software

• Mathematica

This page was built for publication: On the convergence order for some methods of simultaneous root finding for polynomials using a computer algebra system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2881180)