Sciweavers

157 search results - page 22 / 32
» moc 2000
Sort
View
MOC
2000
82views more  MOC 2000»
13 years 9 months ago
Three new factors of Fermat numbers
We report the discovery of a new factor for each of the Fermat numbers F13, F15, F16. These new factors have 27, 33 and 27 decimal digits respectively. Each factor was found by the...
Richard P. Brent, Richard E. Crandall, Karl Dilche...
MOC
2000
87views more  MOC 2000»
13 years 9 months ago
Improving the parallelized Pollard lambda search on anomalous binary curves
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
Robert P. Gallant, Robert J. Lambert, Scott A. Van...
MOC
1998
109views more  MOC 1998»
13 years 9 months ago
A comparison of regularizations for an ill-posed problem
Abstract. We consider numerical methods for a “quasi-boundary value” regularization of the backward parabolic problem given by ut + Au = 0 , 0 < t < T u(T ) = f, where A ...
Karen A. Ames, Gordon W. Clark, James F. Epperson,...
MOC
1998
102views more  MOC 1998»
13 years 9 months ago
New results in equal sums of like powers
This paper reports on new results for the equation m i=1 ak i = n j=1 bk j , i.e., equal sums of like powers. Since the 1967 Lander, Parkin and Selfridge survey paper [4], few othe...
Randy L. Ekl
MOC
1998
64views more  MOC 1998»
13 years 9 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...