GeezerVisonThe World Wide Web, restored to 800 pixels of glory. | |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites | |
GeezerVison is showing mathworld.wolfram.com — Ferguson-Forcade Algorithm -- from Wolfram MathWorld Ferguson-Forcade Algorithm
The first practical algorithm for determining if there exist integers
or else establish bounds within which no such integer relation can exist (Ferguson and Forcade 1979). The algorithm therefore became
the first viable generalization of the Euclidean
algorithm to A nonrecursive variant of the original algorithm was subsequently devised by Ferguson (1987). The Ferguson-Forcade algorithm has been shown to be polynomial time in the logarithm in the size of a smallest relation, but has not been shown to be polynomial in dimension (Ferguson et al. 1999). See alsoConstant Problem, Euclidean Algorithm, Integer Relation, PSLQ AlgorithmExplore with Wolfram|AlphaMore things to try: ReferencesBailey, D. H. "Numerical Results on the Transcendence of Constants InvolvingReferenced on Wolfram|AlphaFerguson-Forcade AlgorithmCite this as:Weisstein, Eric W. "Ferguson-Forcade Algorithm." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Ferguson-ForcadeAlgorithm.html Subject classifications | |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |