Fast computation of the Nth root

DOI10.1016/0898-1221(89)90024-2zbMath0687.65052OpenAlexW1971190483MaRDI QIDQ1263248

K. Appert

Publication date: 1989

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(89)90024-2

zbMATH Keywords

Newton's methodPadé approximationiterative methodsdifferentiable functioncomputational costTaylor's seriesNth root

Mathematics Subject Classification ID

Padé approximation (41A21) Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05)

Related Items (2)

Unnamed Item ⋮ Newton's method for the matrix nonsingular square root

Uses Software

• Algorithm 524
• cheney-kincaid

Cites Work

• Optimal starting approximations for Newton's method
• Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast computation of the Nth root