High order iterative methods for approximating square roots

DOI10.1007/BF01731991zbMath0870.65039MaRDI QIDQ1914878

Bahman Kalantari, Iraj Kalantari

Publication date: 17 September 1997

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

convergencefixed-point iterationiteration functionsquare rootsNewton's and Halley's iteration functions

Mathematics Subject Classification ID

Related Items (13)

New methods for approximating square roots ⋮ On general convergence in extracting radicals via a fundamental family of iteration functions ⋮ A basic family of iteration functions for polynomial root finding and its characterizations ⋮ Inverse function, Taylor's expansion and extended Schröder's processes ⋮ High order iterative methods for approximating square roots ⋮ Newton's method and generation of a determinantal family of iteration functions ⋮ Symmetries of the Julia sets of König's methods for polynomials ⋮ An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound ⋮ Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications ⋮ A computational comparison of the first nine members of a determinantal family of root-finding methods ⋮ Newton's method and high-order algorithms for the \(n\)th root computation ⋮ \(n\)th root extraction: Double iteration process and Newton's method ⋮ On rediscovered iteration methods for solving equations

Cites Work

• A basic family of iteration functions for polynomial root finding and its characterizations
• High order iterative methods for approximating square roots
• A Type of Variation on Newton's Method
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: High order iterative methods for approximating square roots