scientific article; zbMATH DE number 4199482

MaRDI QIDQ3350675zbMATH OpenFDO

Authors M. S. Petković, Lidija V. Stefanović

Publication date 1990

zbMATH Keywords

computational efficiencyiterative methodspolynomial zerosroot-finding methods with recursive corrections

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 794403
• On the Complexity of Reliable Root Approximation
• On a general class of multipoint root-finding methods of high computational efficiency
• On the efficiency of the computations for approximating the solutions of equations
• On Accurate Computations of the Perron Root
• Short Notes: Rapidly Converging Iterative Formulae for Finding Square Roots and their Computational Efficiencies
• An efficient higher order family of root finders
• On computational efficiency for multi-precision zero-finding methods
• Remarks on ``On a general class of multipoint root-finding methods of high computational efficiency
• scientific article; zbMATH DE number 524098

Cited in

(4)

• On iteration methods without derivatives for the simultaneous determination of polynomial zeros
• scientific article; zbMATH DE number 3880014 (Why is no real title available?)
• scientific article; zbMATH DE number 1984134 (Why is no real title available?)
• An analysis on the efficiency of Euler's method for computing the matrix pth root

This page was built for publication:

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