High order algorithms for approximatingnth roots
From MaRDI portal
Publication:4828667
Recommendations
Cites work
- nth root extraction: Double iteration process and Newton's method
- A family of Chebyshev-Halley type methods in Banach spaces
- A Modified Babylonian Algorithm
- Accelerated Convergence in Newton’s Method
- Calculus of \(n\)th roots and third order iterative methods.
- Graphic and numerical comparison between iterative methods
- Historical Development of the Newton–Raphson Method
- Indices of convexity and concavity. Application to Halley method
- On Halley's Iteration Method
- Several new methods for solving equations
Cited in
(12)- Fast computation of the Nth root
- nth root: a Monte Carlo approximation
- Newton-type methods of high order and domains of semilocal and global convergence
- Dynamics of a higher-order family of iterative methods
- Newton's method and high-order algorithms for the \(n\)th root computation
- Algorithms for \(n\)-th root approximation.
- Inverse function, Taylor's expansion and extended Schröder's processes
- A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
- scientific article; zbMATH DE number 3945258 (Why is no real title available?)
- scientific article; zbMATH DE number 2053005 (Why is no real title available?)
- scientific article; zbMATH DE number 2077526 (Why is no real title available?)
- High order algorithms for calculating roots
This page was built for publication: High order algorithms for approximatingnth roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828667)