Inverse function, Taylor's expansion and extended Schröder's processes

DOI10.1080/00207160.2013.833611zbMath1301.65033OpenAlexW2046275899MaRDI QIDQ2921929

Calvin Gnang, François Dubeau

Publication date: 14 October 2014

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

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

zbMATH Keywords

numerical examplesfixed-point iterationnonlinear equationlogarithmTaylor's expansionhigh-order methodinverse function\(n\)th rootarcsinarctanSchröder's process

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two sequences of algorithms for approximating square roots
• On the order of convergence of a determinantal family of root-finding methods
• Accelerated convergence in Newton's method for approximating square roots
• Calculus of \(n\)th roots and third order iterative methods.
• High order iterative methods for approximating square roots
• New methods for approximating square roots
• Newton's method and high-order algorithms for the \(n\)th root computation
• Algorithms for \(n\)-th root approximation.
• A Modified Babylonian Algorithm
• A Historical Survey of Solution by Functional Iteration
• An Iterative Method for Approximating Square Roots
• Accelerated Convergence in Newton’s Method
• High order algorithms for approximatingnth roots

This page was built for publication: Inverse function, Taylor's expansion and extended Schröder's processes