Pages that link to "Item:Q2519695"

The following pages link to Newton's method and high-order algorithms for the \(n\)th root computation (Q2519695):

Displaying 9 items.

• Iteration functions for \(p\)th roots of complex numbers (Q634180) (← links)
• Fast computation of the Nth root (Q1263248) (← links)
• \(n\)th root extraction: Double iteration process and Newton's method (Q1298613) (← links)
• On the semigroup property for some structured iterations (Q2306403) (← links)
• Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369) (← links)
• Algorithms for \(n\)-th root approximation. (Q2564995) (← links)
• Inverse function, Taylor's expansion and extended Schröder's processes (Q2921929) (← links)
• (Q3716215) (← links)
• A simple algorithm for high order Newton iteration formulae and some new variants (Q5159558) (← links)