Searches , social queries for ROOT FINDING-ALGORITHM
Search references for ROOT FINDING-ALGORITHM. Phrases containing ROOT FINDING-ALGORITHM
See searches and references containing ROOT FINDING-ALGORITHM!
Search references for ROOT FINDING-ALGORITHM. Phrases containing ROOT FINDING-ALGORITHM
See searches and references containing ROOT FINDING-ALGORITHM!ROOT FINDING-ALGORITHM
Algorithms for zeros of functions
In numerical analysis, a root-finding algorithm is an algorithm for finding zeros, also called roots, of a function. A root of the function f is a number
Root-finding_algorithm
have at least one root. Therefore, root-finding algorithms consists of finding numerical solutions in most cases. Root-finding algorithms can be broadly
Polynomial_root-finding
Root-finding algorithm
Fast inverse square root, sometimes referred to as Fast InvSqrt() or by the hexadecimal constant 0x5F3759DF, is an algorithm that estimates 1 / x {\textstyle
Fast_inverse_square_root
root finding algorithm Cipolla's algorithm Tonelli–Shanks algorithm Multiplication algorithms: fast multiplication of two numbers Karatsuba algorithm
List_of_algorithms
Algorithms for calculating square roots
Square root algorithms compute the non-negative square root S {\displaystyle {\sqrt {S}}} of a positive real number S {\displaystyle S} . Since all square
Square_root_algorithms
Method in number theory
number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over
Berlekamp–Rabin_algorithm
Algorithm for finding zeros of functions
Newton's method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or
Newton's_method
Root-finding algorithm
In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. Edmond
Halley's_method
Root-finding method
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
Secant_method
Root-finding algorithm for polynomials
Wilf's global bisection algorithm is a root-finding algorithm extending the idea of enclosing roots, as in the one-dimensional bisection method, to find
Wilf's global bisection algorithm
Wilf's_global_bisection_algorithm
Algorithm for finding a zero of a function
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
Bisection_method
Polynomial root-finding algorithm
Bernoulli's method, named after Daniel Bernoulli, is a root-finding algorithm which calculates the root of largest absolute value of a univariate polynomial
Bernoulli's_method
Greatest integer less than or equal to square root
example. The Karatsuba square root algorithm applies the same divide-and-conquer principle as the Karatsuba multiplication algorithm to compute integer square
Integer_square_root
Root-finding algorithm
In numerical analysis, Brent's method is a hybrid root-finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation
Brent's_method
Computing the fixed point of a function
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
Fixed-point_computation
Root-finding algorithm
formalizations of iterative methods. Newton's method is a root-finding algorithm for finding roots of a given differentiable function f ( x ) {\displaystyle
Fixed-point_iteration
Polynomial equation, generally univariate
real or complex solutions of a univariate algebraic equation (see Root-finding algorithm) and of the common solutions of several multivariate polynomial
Algebraic_equation
Point where function's value is zero
the best being Newton's method, see Root-finding algorithm. For polynomials, there are specialized algorithms that are more efficient and may provide
Zero_of_a_function
Root-finding algorithm for polynomials
needed] The algorithm finds the roots in complex conjugate pairs using only real arithmetic. See root-finding algorithm for other algorithms. Bairstow's
Bairstow's_method
Root-finding algorithm
mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm for complex polynomials, extending
Lehmer–Schur_algorithm
Method of solving equations
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
Inverse quadratic interpolation
Inverse_quadratic_interpolation
Root-finding algorithm for polynomials
rediscovered independently by Durand in 1960 and Kerner in 1966, is a root-finding algorithm for solving polynomial equations. In other words, the method can
Durand–Kerner_method
Topics referred to by the same term
geometry, dividing something into two equal parts Bisection method, a root-finding algorithm Equidistant set Bisect (philately), the use of postage stamp halves
Bisect
Algorithm for computing greatest common divisors
In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers
Euclidean_algorithm
Type of mathematical expression
most efficient algorithms allow solving easily (on a computer) polynomial equations of degree higher than 1,000 (see Root-finding algorithm). For polynomials
Polynomial
Root-finding algorithm for polynomials
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
Aberth_method
Polynomial division computation method
{\displaystyle R(x)=b_{n-1}x^{n-1}+b_{n-2}x^{n-2}+\cdots +b_{1}x+b_{0}.} The algorithm is in fact the long division of P(x) by Q(x). To divide P(x) by Q(x):
Ruffini's_rule
High-speed approximation of the square root of the sum of two squares
alpha max plus beta min algorithm is a high-speed approximation of the square root of the sum of two squares. The square root of the sum of two squares
Alpha max plus beta min algorithm
Alpha_max_plus_beta_min_algorithm
Topics referred to by the same term
brant Brent International School, the Philippines Brent's method, a root-finding algorithm Brent railway station, South Devon, England Brent sidings, railway
Brent
Numerical method used to approximate solutions of univariate equations
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
Regula_falsi
(Mathematical) decomposition into a product
theorem of algebra. In this case, the factorization can be done with root-finding algorithms. The case of polynomials with integer coefficients is fundamental
Factorization
Algorithm for the directed version of the minimum spanning tree problem
In graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes called
Edmonds'_algorithm
Geometry of the location of polynomial roots
the distance between two roots. Such bounds are widely used for root-finding algorithms for polynomials, either for tuning them, or for computing their
Geometrical properties of polynomial roots
Geometrical_properties_of_polynomial_roots
Class of mathematical root-finding algorithm
specifically in numerical analysis, Householder's methods are a class of root-finding algorithms that are used for functions of one real variable with continuous
Householder's_method
Sidi's generalized secant method is a root-finding algorithm, that is, a numerical method for solving equations of the form f(x)=0 . The method was published
Sidi's generalized secant method
Sidi's_generalized_secant_method
Polynomial root-finding algorithm
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
Laguerre's_method
Australian mathematician and computer scientist
computer architecture, and analysis of algorithms. In 1973, he published a root-finding algorithm (an algorithm for solving equations numerically) which
Richard_P._Brent
Greatest common divisor of polynomials
of f (see Yun's algorithm). Thus the square-free factorization reduces root-finding of a polynomial with multiple roots to root-finding of several square-free
Polynomial greatest common divisor
Polynomial_greatest_common_divisor
Methods for locating real roots of a polynomial
all the real roots of the polynomial. Real-root isolation is useful because usual root-finding algorithms for computing the real roots of a polynomial
Real-root_isolation
Graph algorithm
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph
Tarjan's strongly connected components algorithm
Tarjan's_strongly_connected_components_algorithm
Signal processing filter
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
Elliptic_filter
Counting polynomial roots in an interval
containing exactly one root. This yields the oldest real-root isolation algorithm, and arbitrary-precision root-finding algorithm for univariate polynomials
Sturm's_theorem
Algorithm for computing trigonometric, hyperbolic, logarithmic and exponential functions
short for coordinate rotation digital computer, is a simple and efficient algorithm to calculate trigonometric functions, hyperbolic functions, square roots
CORDIC
French mathematician (1834–1886)
the notion of genus of an entire function. Laguerre's method is a root-finding algorithm tailored to polynomials. He laid the foundations of a geometry of
Edmond_Laguerre
Type of analog linear filter in electronics
using a root-finding algorithm. Of the set of roots from above, select the positive imaginary root for odd order filters, and positive real root for even
Bessel_filter
Algorithm for finding roots of a function
Muller's method is a root-finding algorithm, a numerical method for solving equations of the form f(x) = 0. It was first presented by David E. Muller in
Muller's_method
Classification of algorithm
great reason for finding such algorithms. For example, if tomorrow there were a discovery that showed there is a factoring algorithm with a huge but provably
Galactic_algorithm
Algorithm used for frequency estimation and radio direction finding
MUSIC (MUltiple SIgnal Classification) is an algorithm used for frequency estimation and radio direction finding. In many practical signal processing problems
MUSIC_(algorithm)
Root-finding algorithm
ITP method (Interpolate Truncate and Project method) is the first root-finding algorithm that achieves the superlinear convergence of the secant method while
ITP_method
Nonlinear measure of a ship's overall internal volume
inverse cannot be expressed in terms of elementary functions. A root-finding algorithm may be used for obtaining an approximation to a ship's volume given
Gross_tonnage
Topics referred to by the same term
reciprocal) trigonometric function of the cosine the secant method, a root-finding algorithm in numerical analysis, based on secant lines to graphs of functions
Secant
Algorithm for finding max graph matchings
In graph theory, the blossom algorithm is an algorithm for constructing maximum matchings on graphs. The algorithm was developed by Jack Edmonds in 1961
Blossom_algorithm
Bulgarian open source math software
(2026). "Improvements to the Modified Anderson–Björck (modAB) Root-Finding Algorithm". Algorithms. 19 (5) 332. MDPI. doi:10.3390/a19050332. Ganchovski, N;
Calcpad
Algorithm to search the nodes of a graph
search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all
Breadth-first_search
Speed of convergence of a mathematical sequence
instance once a target precision has been reached with an iterative root-finding algorithm, but pre-asymptotic behavior is often crucial for determining whether
Rate_of_convergence
Root-finding algorithm in numerical analysis
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
Ridders'_method
Any algorithm which solves the search problem
search algorithm. Tree search algorithms are local graph search algorithms designed to work efficiently on directed acyclic graphs with a single root or starting
Search_algorithm
System where changes of output are not proportional to changes of input
general root-finding algorithms apply to polynomial roots, but, generally they do not find all the roots, and when they fail to find a root, this does
Nonlinear_system
Polynomial equation of degree 3
trigonometrically numerical approximations of the roots can be found using root-finding algorithms such as Newton's method. The coefficients do not need to be real
Cubic_equation
Algorithm used in modular arithmetic
prime: that is, to find a square root of n modulo p. The Tonelli–Shanks algorithm cannot be used for composite moduli: finding square roots modulo composite
Tonelli–Shanks_algorithm
Arithmetic operation, inverse of nth power
higher requirements for precision, a more rapid algorithm than Newton's method for finding the nth root is to use a truncated Taylor series with a Padé
Nth_root
Technique to compress data
for lossless data compression. The process of finding or using such a code is Huffman coding, an algorithm developed by David A. Huffman while he was a
Huffman_coding
Number whose cube is a given number
used to calculate the cube root. For real floating-point numbers this method reduces to the following iterative algorithm to produce successively better
Cube_root
Theorem on triangulation graph colorings
computation of fixed points and in root-finding algorithms, and are applied in fair division (cake cutting) algorithms. According to the Soviet Mathematical
Sperner's_lemma
Integer factorization algorithm
is proportional to the square root of the smallest prime factor of the composite number being factorized. The algorithm is used to factorize a number
Pollard's_rho_algorithm
Algorithm for pseudo-random number sampling
f(0), then the initial estimate x1 was too high. Given this, use a root-finding algorithm (such as the bisection method) to find the value x1 which produces
Ziggurat_algorithm
Method for finding kth smallest value
In computer science, a selection algorithm is an algorithm for finding the k {\displaystyle k} th smallest value in a collection of orderable values,
Selection_algorithm
Numerical approximation algorithm
refinement Kaczmarz method Non-linear least squares Numerical analysis Root-finding algorithm Amritkar, Amit; de Sturler, Eric; Świrydowicz, Katarzyna; Tafti
Iterative_method
Dimensionless quantity in fluid dynamic
appears on both sides of the equation, and for practical purposes a root-finding algorithm must be used for a numerical solution (the equation is a septic
Mach_number
Probability distribution
distribution function Φ(x) can be used with Newton's method (or another root-finding algorithm such as Halley's method) to find the value of x for which Φ(x)=q
Normal_distribution
Numeric value with an unclear meaning
Enumerated type – Named set of data type values Fast inverse square root – Root-finding algorithm Magic number – Structure of information stored on a computer
Magic_number_(programming)
Statistical function that defines the quantiles of a probability distribution
itself has a closed-form expression, one can always use a numerical root-finding algorithm such as the bisection method to invert the cdf. Other methods rely
Quantile_function
American mathematician (born 1958)
McMullen, C. T. (1987), "Families of rational maps and iterative root-finding algorithms", Annals of Mathematics, 125 (3): 467–493, doi:10.2307/1971408
Curtis_T._McMullen
Method for finding loopless paths
graph theory, Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. The algorithm was published by Jin
Yen's_algorithm
Topics referred to by the same term
a motion picture visual effects company Durand–Kerner method, root-finding algorithm for solving polynomial equations in numerical analysis Kerning,
Kerner
Algorithm for division of polynomials
thus an algorithm for Euclidean division. Sometimes one or more roots of a polynomial are known, perhaps having been found using the rational root theorem
Polynomial_long_division
Topics referred to by the same term
decreases its degree by one in multiple root-finding algorithms, as done for example in the Jenkins–Traub algorithm In philosophy, the use of a deflationary
Deflation_(disambiguation)
Tree node with two other nodes as descendants
determined by finding the first intersection of the paths from v and w to the root. In general, the computational time required for this algorithm is O(h) where
Lowest_common_ancestor
Algorithm to search the nodes of a graph
algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root
Depth-first_search
Method of finding a directed graph's strongly connected components
In computer science, Kosaraju-Sharir's algorithm (also known as Kosaraju's algorithm) is a linear time algorithm to find the strongly connected components
Kosaraju's_algorithm
Continuous probability distribution
estimate of k ^ {\displaystyle {\hat {k}}} can be found using a root finding algorithm to solve Γ ( 1 + 2 k ) − ( Γ ( 1 + 1 k ) ) 2 ( Γ ( 1 + 1 k ) ) 2
Weibull_distribution
Analysis in fluid dynamics
Kirchhoff laws (junctions and head-loss criteria). Then, use a Root-finding algorithm to find Q values that satisfy all the equations. The literal friction
Pipe_network_analysis
Approaches for approximating solutions to differential equations
quadratic equation, and no analytical solution exists. Then one uses root-finding algorithms, such as Newton's method, to find the numerical solution. Crank-Nicolson
Explicit_and_implicit_methods
Used to determine the periodic payment amount due on a loan
to solve for any one term, except for i, for which one can use a root-finding algorithm. The annuity formula is: A = P i ( 1 + i ) n ( 1 + i ) n − 1 = P
Amortization_calculator
degree, for problems including polynomial multiplication, division, root-finding algorithms, and polynomial greatest common divisors. Sparse polynomials have
Sparse_polynomial
Root-finding algorithm for polynomials
The Jenkins–Traub algorithm for polynomial zeros is a fast globally convergent iterative polynomial root-finding method published in 1970 by Michael A
Jenkins–Traub_algorithm
Number whose square is a given number
method for calculating the square root is the shifting nth root algorithm, applied for n = 2. The name of the square root function varies from programming
Square_root
Algorithm that arranges lists in order
In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order
Sorting_algorithm
Search algorithm used in sorted arrays
half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary
Binary_search
Newton-like root-finding algorithm that does not use derivatives
iterative method named after Johan Frederik Steffensen for numerical root-finding that is similar to the secant method and to Newton's method. Steffensen's
Steffensen's_method
Algorithm to be run on quantum computers
In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the
Quantum_algorithm
Factorisation algorithm
|x_{0}|<M^{1/n}} . Coppersmith’s algorithm can be used to find this integer solution x 0 {\displaystyle x_{0}} . Finding roots over the rationals Q is easy
Coppersmith_method
Swiss mathematician and physicist (1700–1782)
translation and motion of rotation. In 1729, he published a polynomial root-finding algorithm which became known as Bernoulli's method. His chief work is Hydrodynamica
Daniel_Bernoulli
Study of polynomial equations
century. They have led to the development of algebraic geometry. Root-finding algorithm Properties of polynomial roots Quintic function https://www.britannica
Theory_of_equations
Finding values for variables that make an equation true
complex numbers, simple methods to solve equations can fail. Often, root-finding algorithms like the Newton–Raphson method can be used to find a numerical
Equation_solving
Algorithms which recursively solve subproblems
algorithm for finding a record in a sorted list (or its analogue in numerical computing, the bisection algorithm for root finding). These algorithms can
Divide-and-conquer_algorithm
Appearing random but actually being generated by a deterministic, causal process
generator – Type of functions designed for being unsolvable by root-finding algorithms List of random number generators Pseudorandom binary sequence –
Pseudorandomness
Modular arithmetic concept
is a primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. In symbols, g is a primitive root modulo n if for
Primitive_root_modulo_n
graphics) See #Numerical linear algebra for linear equations Root-finding algorithm — algorithms for solving the equation f(x) = 0 General methods: Bisection
List of numerical analysis topics
List_of_numerical_analysis_topics
Filter in electronics and signal processing
Absorbing a {\displaystyle a} into the coefficients, factoring using a root finding algorithm, and building the polynomials using only the left half plane poles
Gaussian_filter
travel, tourism, insurance
ROOT FINDING-ALGORITHM
ROOT FINDING-ALGORITHM
ROOT FINDING-ALGORITHM
ROOT FINDING-ALGORITHM
ROOT FINDING-ALGORITHM
ROOT FINDING-ALGORITHM
ROOT FINDING-ALGORITHM
ROOT FINDING-ALGORITHM
ROOT FINDING-ALGORITHM
travel, tourism, insurance