Примеры использования Multiplications на Английском языке и их переводы на Русский язык
{-}
-
Official
-
Colloquial
This operation needs 6 multiplications and 4 sums.
Or to four multiplications, one addition and one subtraction for real numbers.
Like the first method, this requires O(e) multiplications to complete.
Moreover, several multiplications can be performed in parallel.
The apparent power results from the summation of current and voltage multiplications.
Math\frac{n{ n 2-n}{ 2}[/ math] multiplications and the same number of additions subtractions.
I see you are good with people, Miss Sabina,because I have no equal in multiplications.
The idea comes from the associativity of matrix multiplications, and the errors are used to provide the security.
I prayed to the Holy Child of Atocha for help, and then I had an idea to invent a game with additions,extractions and multiplications.
The inversion of the current pivot, multiplications in the current column, and operations of the type[math]a b+ c[/math] in the other columns are depicted in yellow, brown, and purple.
The computational kernel of the backward elimination path contains only multiplications and additions sequences.
The element-by-element recursive multiplications of the transformed vectors can be performed using a negacyclic convolution, which is faster than an acyclic convolution and already has"for free" the effect of reducing its result mod 2n+ 1.
Instructions transfer data to or from the host,perform matrix multiplications or convolutions.
Andersson, Miltersen& Thorup(1999)showed that in some cases the multiplications or table lookups required by some integer sorting algorithms could be replaced by customized operations that would be more easily implemented in hardware but that are not typically available on general-purpose computers.
The kernel of the forward path consists of two independent sequences of divisions, multiplications, and additions/subtractions.
Notably, Jarkko Kari gave an aperiodic set of Wang tiles based on multiplications by 2 or 2/3 of real numbers encoded by lines of tiles(the encoding is related to Sturmian sequences made as the differences of consecutive elements of Beatty sequences), with the aperiodicity mainly relying on the fact that 2n/3m is never equal to 1 for any positive integers n and m.
The computational kernel of the forward elimination path consists of sequences of divisions, multiplications, and additions/subtractions.
This is called a similarity. This is a big advantage of complex numbers:they allow us to describe very simply similarities as multiplications.
Thus, the height of the parallel form is equal to[math]n[/math] multiplications plus[math]n[/math] additions.
In view of the use of auxiliary variables, the calculation of each new pair requires one addition, one subtraction,one division, and two multiplications.
In any implementation of the dot product for arrays consisting of[math]n[/math]elements the number of scalar multiplications is invariably equal to[math]n[/math], while the number of additions is[math]n- 1/math.
This means that raising m to an arbitrary power can be accomplished with at most n shifts and n multiplications.
This means that if an element x is multiplied by itself several times,it doesn't matter in which order the multiplications are carried out, so for instance x(x(xx))(x(xx))x(xx)xx.
The variants of quasi-phase bilines realization considered above are the optimum structures by quantity of used real operations(particularly, multiplications) by sample.
Consequently, by a rough estimate(with terms of lower order dropped),the critical path of the Householder method goes through[math]n 2[/math] multiplications and[math]n 2[/math] additions/subtractions.
If this interpretation is correct, the driver has- in order to ascertain whether 1.1.3.6 is applicable ornot- to perform several multiplications and additions.
Altogether, this yields a critical path passing through[math]2n-3[/math]square root extractions,[math]4n-6[/math] divisions,[math]5n-7[/math] multiplications, and the same number of additions/subtractions.
At the first stages, hence, it is necessary to optimize not a block algorithm but the subroutines used on individual processors,such as the dot Cholesky decomposition, matrix multiplications, etc.
At the same time, a large jackpot could be broken even at a small bet,thanks to card divination and high multiplications on bonuses.
On the other hand, in the worst case, a macrovertex for calculating rotation parameters has the critical path consisting of asingle square root calculation, two divisions, two multiplications, and two additions/subtractions.