In numerical analysis, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f...

Square root algorithms compute the non-negative square root S {\displaystyle {\sqrt {S}}} of a positive real number S {\displaystyle S} . Since all square...

Fast inverse square root, sometimes referred to as Fast InvSqrt() or by the hexadecimal constant 0x5F3759DF, is an algorithm that estimates 1 x {\textstyle...

root finding algorithm Cipolla's algorithm Tonelli–Shanks algorithm Multiplication algorithms: fast multiplication of two numbers Karatsuba algorithm...

have at least one root. Therefore, root-finding algorithms consists of finding numerical solutions in most cases. Root-finding algorithms can be broadly...

Newton's method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or...

the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant...

analysis, inverse quadratic interpolation is a root-finding algorithm, meaning that it is an algorithm for solving equations of the form f(x) = 0. The...

In numerical analysis, Laguerre's method is a root-finding algorithm tailored to polynomials. In other words, Laguerre's method can be used to numerically...

Bernoulli's method, named after Daniel Bernoulli, is a root-finding algorithm which calculates the root of largest absolute value of a univariate polynomial...

mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm for complex polynomials, extending...

function f has a root in the interval (a0, b0). There are many root-finding algorithms that can be used to obtain approximations to such a root. One of the...

In numerical analysis, Brent's method is a hybrid root-finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation...

the best being Newton's method, see Root-finding algorithm. For polynomials, there are specialized algorithms that are more efficient and may provide...

In mathematics, the bisection method is a root-finding method that applies to any continuous function for which one knows two values with opposite signs...

real or complex solutions of a univariate algebraic equation (see Root-finding algorithm) and of the common solutions of several multivariate polynomial...

geometry, dividing something into two equal parts Bisection method, a root-finding algorithm Equidistant set Bisect (philately), the use of postage stamp halves...

most efficient algorithms allow solving easily (on a computer) polynomial equations of degree higher than 1,000 (see Root-finding algorithm). For polynomials...

conclusion is that algorithms which compute isqrt() are computationally equivalent to algorithms which compute sqrt(). The integer square root of a non-negative...

In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. Edmond...

containing exactly one root. This yields the oldest real-root isolation algorithm, and arbitrary-precision root-finding algorithm for univariate polynomials...

number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over...

using a root finding algorithm. Of the set of roots from above, select the positive imaginary root for all order filters, and positive real root for even...

formalizations of iterative methods. Newton's method is a root-finding algorithm for finding roots of a given differentiable function ⁠ f ( x ) {\displaystyle...

method is a root-finding algorithm based on the false position method and the use of an exponential function to successively approximate a root of a continuous...

needed] The algorithm finds the roots in complex conjugate pairs using only real arithmetic. See root-finding algorithm for other algorithms. Bairstow's...

theorem of algebra. In this case, the factorization can be done with root-finding algorithms. The case of polynomials with integer coefficients is fundamental...

MUSIC (multiple sIgnal classification) is an algorithm used for frequency estimation and radio direction finding. In many practical signal processing problems...

of g {\displaystyle g} . Therefore, any root-finding algorithm (an algorithm that computes an approximate root of a function) can be used to find an approximate...

Ehrlich–Aberth method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm developed in 1967 for simultaneous approximation of all the roots...