AbstractMultivariate polynomial multiplication is a fundamental operation which is used in many scientific domains, for example in the optics code for particle accelerator design at CERN. We present a novel and efficient multivariate polynomial multiplication algorithm for GPUs using floating-point double precision coefficients implemented using the CUDA parallel programming platform. We obtain very good speedups over another multivariate polynomial multiplication library for GPUs (up to 548x), and over the implementation of our algorithm for multi-core machines using OpenMP (up to 7.46x)
AbstractWe observe that polynomial evaluation and interpolation can be performed fast over a multidi...
Multiple precision (MP) arithmetic is a core building block of a wide variety of algorithms in compu...
In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multipl...
Evaluating non-linear multivariate polynomial systems over finite fields is an important subroutine ...
With the advent of hardware accelerator technologies, multi-core processors and GPUs, much effort fo...
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently us...
Multiphysics systems are used to simulate various physics phenomena given byPartial Differential Equ...
International audienceWe propose a new algorithm for multiplying dense polynomials with integer coef...
With the advent of hardware accelerator technologies, multi-core processors and GPUs, much effort fo...
Modulo polynomial multiplication is an essential mathematical operation in the area of finite field ...
The number theoretic transform (NTT) permits a very efficient method to perform multiplication of ve...
The Fast Multipole Method allows the rapid evaluation of sums of radial basis functions centered at ...
Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is...
Abstract. We analyze how fast we can solve general systems of multivariate equations of various low ...
International audienceFinding the roots of polynomials is a very important part of solving real-life...
AbstractWe observe that polynomial evaluation and interpolation can be performed fast over a multidi...
Multiple precision (MP) arithmetic is a core building block of a wide variety of algorithms in compu...
In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multipl...
Evaluating non-linear multivariate polynomial systems over finite fields is an important subroutine ...
With the advent of hardware accelerator technologies, multi-core processors and GPUs, much effort fo...
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently us...
Multiphysics systems are used to simulate various physics phenomena given byPartial Differential Equ...
International audienceWe propose a new algorithm for multiplying dense polynomials with integer coef...
With the advent of hardware accelerator technologies, multi-core processors and GPUs, much effort fo...
Modulo polynomial multiplication is an essential mathematical operation in the area of finite field ...
The number theoretic transform (NTT) permits a very efficient method to perform multiplication of ve...
The Fast Multipole Method allows the rapid evaluation of sums of radial basis functions centered at ...
Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is...
Abstract. We analyze how fast we can solve general systems of multivariate equations of various low ...
International audienceFinding the roots of polynomials is a very important part of solving real-life...
AbstractWe observe that polynomial evaluation and interpolation can be performed fast over a multidi...
Multiple precision (MP) arithmetic is a core building block of a wide variety of algorithms in compu...
In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multipl...