Pages that link to "Item:Q1196844"
From MaRDI portal
The following pages link to On two sequences of algorithms for approximating square roots (Q1196844):
Displaying 17 items.
- A tight bound for approximating the square root (Q287183) (← links)
- Dynamic properties of an exact algorithm for square root calculation (Q857188) (← links)
- Methods with prefixed order for approximating square roots with global and general convergence (Q990680) (← links)
- \(n\)th root extraction: Double iteration process and Newton's method (Q1298613) (← links)
- A basic family of iteration functions for polynomial root finding and its characterizations (Q1360168) (← links)
- High order iterative methods for approximating square roots (Q1914878) (← links)
- New methods for approximating square roots (Q2369181) (← links)
- Newton's method and high-order algorithms for the \(n\)th root computation (Q2519695) (← links)
- Algorithms for \(n\)-th root approximation. (Q2564995) (← links)
- On a class of recursive relations for calculating square roots of numbers (Q2700142) (← links)
- Newton's expansion for the square root of an algebraic equation by an equivalent arithmetic method. (Q2720968) (← links)
- On Rational Function Approximations to Square Roots (Q2757334) (← links)
- Approach to square roots applying square matrices (Q2826865) (← links)
- Inverse function, Taylor's expansion and extended Schröder's processes (Q2921929) (← links)
- Faster algorithms for the square root and reciprocal of power series (Q3081289) (← links)
- optimum modified extrapolated jacobi method for some class of matrices (Q4876376) (← links)
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications (Q5928297) (← links)
