Some high-order zero-finding methods using almost orthogonal polynomials

DOI10.1017/S0334270000000916MaRDI QIDQ4099139zbMATH OpenWikidataFDO

Authors Richard P. Brent

Publication date 1975

Published in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0334270000000916

zbMATH Keywords

almost orthogonal polynomialsapproximation of simple zeros of functions of one variableexplicit nonlinear, Runge-Kutta methodsmultipoint iterative methods without memoryorder of convergenceorthogonal polynomialssolution of special class of ordinary differential equations

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations
• High-order nonlinear solver for multiple roots
• Multipoint methods for solving nonlinear equations
• scientific article; zbMATH DE number 3947532
• Fourth order methods for finding multiple as well as distinct zeros of nonlinear equations

Cited in

(6)

• Zero-finder methods derived from Obreshkov's techniques
• A modified Newton method with cubic convergence: the multivariate case
• An accelerated version of Newton's method with convergence order \(\sqrt{3}+1\)
• scientific article; zbMATH DE number 4018245 (Why is no real title available?)
• scientific article; zbMATH DE number 3947532 (Why is no real title available?)
• Zero-finder methods derived using Runge-Kutta techniques

This page was built for publication: Some high-order zero-finding methods using almost orthogonal polynomials

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