Skip to content
Vinony
Category

Root-finding algorithms

page 1
Newton's method
algorithm for finding a zero of a function
bisection method
The method of finding a root in mathematics, based on repeated division of a segment in half and the subsequent selection of a subinterval in which the root is thought to be located.
false position method
root-finding algorithm
root-finding algorithm
type of algorithms for finding zeros of functions
Ruffini's rule
Polynomial division computation method
methods of computing square roots
algorithms for calculating square roots
CORDIC
CORDIC, short for coordinate rotation digital computer, is a simple and efficient algorithm to calculate trigonometric functions, hyperbolic functions, square roots, multiplications, divisions, exponentials, and logarithms with arbitrary base, typically converging with one digit (or bit) per iteration. CORDIC is therefore an example of a digit-by-digit algorithm. The original system is sometimes referred to as '''Volder's algorithm'''.
fast inverse square root
root-finding algorithm
Muller's method
root-finding algorithm
fixed-point iteration
root-finding algorithm
Brent's method
root-finding algorithm
Ridders' method
root-finding algorithm in numerical analysis
integer square root
number-theoretic function: floor of the square root
Halley's method
method of numerically finding roots of a function
inverse quadratic interpolation
method of solving equations