Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
نویسندگان
چکیده
منابع مشابه
Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
An implementation is described of the continued fraction factoring algorithm on the DAP parallel processor located in Queen Mary College in London. The DAP has 4096 parallel processors each containing 16K bits of memory and the suggested implementation incorporates the early abort strategy and the large prime variation. Introduction. There are several good general factoring methods (i.e., metho...
متن کاملOn Jacobi's Extension of the Continued Fraction Algorithm.
1 Adams, W. S., and Kohlschiitter, A., Mt. Wilson Contr. No. 62, Astroph. J., Chicago, Ill., 36, 1912, (293-321). 2 Campbell, W. W., and Wright, W. H., Lick Obs. Bul. No. 8, Berkeley, Cal., 1901. ' Scheiner, J., Astronomical Spectroscopy (Frost), Boston, Mass., 1894, p. 290. 4Michelson, W., Astroph. J., Chicago, Ill., 13, 1901, (192-198). s Paddock, G. F., Pub. Astr. Soc. Pac., San Francisco, C...
متن کاملA new multidimensional continued fraction algorithm
It has been believed that the continued fraction expansion of (α, β) (1, α, β is a Q-basis of a real cubic field) obtained by the modified JacobiPerron algorithm is periodic. We conducted a numerical experiment (cf. Table B, Figure 1 and Figure 2) from which we conjecture the non-periodicity of the expansion of (⟨ 3 √3⟩, ⟨ 3 √9⟩) (⟨x⟩ denoting the fractional part of x). We present a new algorit...
متن کاملImplementing the Evaluation Transformer Model of Reduction on Parallel Machines
The evaluation transformer model of reduction generalises lazy evaluation in two ways: it can start the evaluation of expressions before their rst use, and it can evaluate expressions further than weak head normal form. Moreover, the amount of evaluation required of an argument to a function may depend on the amount of evaluation required of the function application. It is a suitable candidate ...
متن کاملcontinued fraction ∗
We use a continued fraction expansion of the sign-function in order to obtain a five dimensional formulation of the overlap lattice Dirac operator. Within this formulation the inverse of the overlap operator can be calculated by a single Krylov space method where nested conjugate gradient procedures are avoided. We show that the five dimensional linear system can be made well conditioned using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1985
ISSN: 0025-5718
DOI: 10.2307/2007809