Search Results for ""

A root-finding algorithm also known as the tangent hyperbolas method or Halley's rational formula. As in Halley's irrational formula, take the second-order Taylor series ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...

The sequence produced by starting with a_1=1 and applying the greedy algorithm in the following way: for each k>=2, let a_k be the least integer exceeding a_(k-1) for which ...

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

A principal ideal domain is an integral domain in which every proper ideal can be generated by a single element. The term "principal ideal domain" is often abbreviated P.I.D. ...

The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...