Sentence examples for multiplication algorithm for from inspiring English sources

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.

In order to improve the efficiency of modular multiplication algorithm for FPGA implementation on the prime field modular, an efficient scheme is proposed to accomplish 256 × 256 bits modular multiplication algorithm.

In order to obtain efficient multiplication in R q, we implemented the Montgomery reduction algorithm for all parameters, and the Karatsuba multiplication algorithm for only the parameter (i), and the multiplication algorithm using the FFT Fast Fourier Transformmethodhod for (ii - iv).

They in turn are applied in digital filters and as a rapid multiplication algorithm for polynomials and large integers (Schönhage-Strassen algorithm).

In addition, there is a matrix multiplication algorithm for this multiplication variant, which running time M n) over two n × n matrices satisfies M n) = o(n).

In addition, there is a matrix multiplication algorithm for this multiplication variant, whose running time M n) over two n × n matrices satisfies M n) = o(n).

In the beginning of his book, he gives recommendations for the study of mathematics: start from the multiplication table, called "9 9 81" in the Chinese tradition, then study the positions for layout of numerals and the multiplication algorithms for higher numbers.

For an n-digit multiplication algorithm of time complexity O(nα), with 1<α≤2, there is a truncated multiplication algorithm, which is constant times faster when computing a short enough truncated product.

Using the matrix multiplication algorithm of Chan [ 12], this algorithm runs in O | Σ | n 3 log 3 log n log 2 n time (Section "A matrix multiplication based algorithm for EDDC").

This acceleration is based on our efficient matrix-vector min-plus multiplication algorithm, intended for matrices and vectors for which differences between adjacent entries are from a finite integer interval D. Choosing a constant 1 log | D | n < λ < 1, the algorithm preprocesses an n ×  n matrix in O n 2 + λ | D | time and O n 2 + λ | D | λ 2 log | D | 2 n space.

An iterative modular multiplication algorithm designed for efficient implementation on a processor with limited capacity such as an 8-bit microcontroller is proposed.