Sciweavers

MOC
2000
77views more  MOC 2000»
13 years 5 months ago
Isomorphisms between Artin-Schreier towers
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over ...
Jean Marc Couveignes
MOC
2000
132views more  MOC 2000»
13 years 5 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
MOC
2000
145views more  MOC 2000»
13 years 5 months ago
Approximating the exponential from a Lie algebra to a Lie group
Consider a differential equation y = A(t, y)y, y(0) = y0 with y0 G and A : R+
Elena Celledoni, Arieh Iserles
MOC
2000
73views more  MOC 2000»
13 years 5 months ago
Korovkin tests, approximation, and ergodic theory
We consider sequences of s
Stefano Serra Capizzano
MOC
2000
173views more  MOC 2000»
13 years 5 months ago
Computation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
Daniela Calvetti, Gene H. Golub, William B. Gragg,...
MOC
2000
126views more  MOC 2000»
13 years 5 months ago
Adaptive multilevel methods in space and time for parabolic problems-the periodic case
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
J. B. Burie, M. Marion
MOC
2000
72views more  MOC 2000»
13 years 5 months ago
On the convergence of certain Gauss-type quadrature formulas for unbounded intervals
Adhemar Bultheel, C. Díaz-Mendoza, Pablo Go...
MOC
2000
74views more  MOC 2000»
13 years 5 months ago
Computing the tame kernel of quadratic imaginary fields
J. Tate has determined the group K2OF (called the tame kernel) for six quadratic imaginary number fields F = Q( d), where d = -3, -4, -7, -8, -11, -15. Modifying the method of Tat...
Jerzy Browkin, Karim Belabas, Herbert Gangl
MOC
2000
82views more  MOC 2000»
13 years 5 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
69views more  MOC 2000»
13 years 5 months ago
Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions
Lower bounds for the condition numbers of the preconditioned systems are obtained for the Bramble-Pasciak-Schatz substructuring preconditioner and the Neumann-Neumann preconditione...
Susanne C. Brenner, Li-Yeng Sung