Searched +refs:math +refs:newton +refs:search +refs:root (Results 1 - 1 of 1) sorted by relevance

/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/
H A Dtommath.tex183 The most prevalent need for multiple precision arithmetic, often referred to as ``bignum'' math, is within the implementation
271 package. As a case study the ``LibTomMath''\footnote{Available at \url{http://math.libtomcrypt.com}} package is used
495 effect a math error (i.e. invalid input, heap error, etc) can cause a program to stop functioning which is definitely
4877 approach is to brute force search amongst the values $k = 2, 3, \ldots, 8$ for the lowest result. Table~\ref{fig:OPTK} lists optimal values of $k$
5670 Finding the $n$'th root of an integer is fairly easy as far as numerical analysis is concerned. Algorithms such as the Newton-Raphson approximation
5671 (\ref{eqn:newton}) series will converge very quickly to a root for any continuous function $f(x)$.
5675 \label{eqn:newton}
5678 In this case the $n$'th root is desired and $f(x) = x^n - a$ where $a$ is the integer of which the root i
[all...]

Completed in 275 milliseconds