5,202 research outputs found
Faster polynomial multiplication over finite fields
Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two
polynomials in F_p[X] of degree less than n. For n large compared to p, we
establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the
iterated logarithm. This is the first known F\"urer-type complexity bound for
F_p[X], and improves on the previously best known bound M_p(n) = O(n log n log
log n log p)
Distributed-memory parallelization of an explicit time-domain volume integral equation solver on Blue Gene/P
Two distributed-memory schemes for efficiently parallelizing the explicit marching-on in-time based solution of the time domain volume integral equation on the IBM Blue Gene/P platform are presented. In the first scheme, each processor stores the time history of all source fields and only the computationally dominant step of the tested field computations is distributed among processors. This scheme requires all-to-all global communications to update the time history of the source fields from the tested fields. In the second scheme, the source fields as well as all steps of the tested field computations are distributed among processors. This scheme requires sequential global communications to update the time history of the distributed source fields from the tested fields. Numerical results demonstrate that both schemes scale well on the IBM Blue Gene/P platform and the memory efficient second scheme allows for the characterization of transient wave interactions on composite structures discretized using three million spatial elements without an acceleration algorithm
On a surprising relation between the Marchenko-Pastur law, rectangular and square free convolutions
n this paper, we prove a result linking the square and the rectangular
R-transforms, the consequence of which is a surprising relation between the
square and rectangular versions the free additive convolutions, involving the
Marchenko-Pastur law. Consequences on random matrices, on infinite divisibility
and on the arithmetics of the square versions of the free additive and
multiplicative convolutions are given.Comment: 11 pages, 1 figure. To appear in Ann. Inst. Henri Poincar\'e Probab.
Sta
Nested (inverse) binomial sums and new iterated integrals for massive Feynman diagrams
Nested sums containing binomial coefficients occur in the computation of
massive operator matrix elements. Their associated iterated integrals lead to
alphabets including radicals, for which we determined a suitable basis. We
discuss algorithms for converting between sum and integral representations,
mainly relying on the Mellin transform. To aid the conversion we worked out
dedicated rewrite rules, based on which also some general patterns emerging in
the process can be obtained.Comment: 13 pages LATEX, one style file, Proceedings of Loops and Legs in
Quantum Field Theory -- LL2014,27 April 2014 -- 02 May 2014 Weimar, German
Average coherence approximation for partially coherent optical systems
We introduce an approximation to the Hopkins integral for partially coherent optical systems. The average coherence approximation yields results close to the Hopkins integral for a wide range of coherent transfer functions and illumination functions and is far less computationally demanding than the full Hopkins integral
- âŠ