On the guaranteed convergence of the Japanese zero-finding method

DOI10.2298/PIM0373059PMaRDI QIDQ4815850zbMATH OpenOpenAlexFDO

Authors M. S. Petković, Lidija Z. Rančić, D. M. Milošević

Publication date 8 September 2004

Published in Publications de l'Institut Mathematique (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/124005

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

convergencefourth order methodinitial conditionsnonlinear equationssimple zeros of a polynomial

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
• The convergence of a family of parallel zero-finding methods
• scientific article; zbMATH DE number 6172789
• On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
• The guaranteed convergence of Laguerre-like method

Cited in

(2)

• The convergence of a family of parallel zero-finding methods
• Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros

This page was built for publication: On the guaranteed convergence of the Japanese zero-finding method

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