Higher-order root-finding algorithm and its applications

DOI10.1080/00207160.2025.2561050MaRDI QIDQ6862216zbMATH OpenFDO

Authors Wei-Guo Foo, Chik How Tan

Publication date 9 February 2026

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2025.2561050

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Computational methods for problems pertaining to information and communication theory (94-08)

Cites work

• A Mathematical Theory of Communication
• Bounds for entropy and divergence for distributions over a two-element set
• Higher-order root-finding algorithms and their basins of attraction
• scientific article; zbMATH DE number 3133919 (Why is no real title available?)
• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 1284420 (Why is no real title available?)
• scientific article; zbMATH DE number 1944479 (Why is no real title available?)
• scientific article; zbMATH DE number 2061729 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• Iterative Solution of Nonlinear Equations in Several Variables
• Numerical methods for roots of polynomials. Part I
• Numerical treatment of partial differential equations. Revised translation of the 3rd German edition of `Numerische Behandlung partieller Differentialgleichungen' by Martin Stynes.
• On K nig's root-finding algorithms*
• Rectified approximations for the solution of nonlinear equations
• The intractability of computing the minimum distance of a code

This page was built for publication: Higher-order root-finding algorithm and its applications

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