High order algorithms for approximating<i>n</i>th roots (Q4828667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(n\)th root extraction: Double iteration process and Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Halley's Iteration Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Convergence in Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of Chebyshev-Halley type methods in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculus of \(n\)th roots and third order iterative methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indices of convexity and concavity. Application to Halley method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Babylonian Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several new methods for solving equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic and numerical comparison between iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Historical Development of the Newton–Raphson Method / rank
 
Normal rank

Latest revision as of 16:28, 7 June 2024

scientific article; zbMATH DE number 2119198
Language Label Description Also known as
English
High order algorithms for approximating<i>n</i>th roots
scientific article; zbMATH DE number 2119198

    Statements