Sciweavers

72 search results - page 2 / 15
» A Modular Method for Computing the Splitting Field of a Poly...
Sort
View
CPHYSICS
2006
109views more  CPHYSICS 2006»
13 years 4 months ago
Comparison of time splitting and backsubstitution methods for integrating Vlasov's equation with magnetic fields
The standard approach for integrating the multidimensional Vlasov equation using grid based, conservative schemes is based on a time splitting approach. Here, we show that althoug...
H. Schmitz, R. Grauer
ARITH
2009
IEEE
13 years 11 months ago
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation a...
Murat Cenk, Çetin Kaya Koç, Ferruh &...
FOCM
2008
77views more  FOCM 2008»
13 years 5 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan
ANTS
2010
Springer
263views Algorithms» more  ANTS 2010»
13 years 8 months ago
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
John Voight
COMPGEOM
1997
ACM
13 years 9 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...