显然，这是C. 后乘法的最通用形式。
This is evidently the most general form of C. Postmultiplication.
例如，您期望乘法的优先级比加法高。
You would expect multiplication, for example, to have a higher precedence than addition.
你还是能够做乘法的。
只要输入了表达式，就将在字段的下方显示乘法的结果。
Once the expression has been entered, the result of the multiplication is shown beneath the field.
这个问题甚至容易于描述乘法的运用和如何在将来使用。
It would've been harder to describe what multiplication was and how he'd used it in the past.
如何使用线程池和多线程矩阵乘法的消息队列？
How to use thread pool and message queues in Multithreaded Matrix Multiplication?
我们学过矩阵乘法的，以及用矩阵表示线性方程。
OK, so we've seen how to multiply matrices, and how to write linear systems in matrix form.
它是基于数值积分和矩阵最小二乘法的数值方法。
It is based on the numerical integration and matrix least square method.
其次还建立了交互对比法和最小二乘法的等效性。
Furthermore, the equivalence between the method of cross-contrast and that of least squares is established.
乘法的详细信息会在 乘法辅助函数一节中介绍。
The details of the multiply algorithm will be described in the section headed Multiply as a support function.
给出了加权最小二乘法的迭代计算公式和误差估计公式。
The weighted least square iteration computational equations and error estimate equations are given.
通过将其与一般算法进行比较，体现了最小二乘法的优越性。
The least square method is compared with normal arithmetic to show its superiority.
在移动最小二乘法的基础上，提出了复变量移动最小二乘法。
The moving least-square approximation with complex variables (MLSCV) is developed on the basis of moving least-square approximation.
本文讨论加权最小二乘法的最优权，并得到了它的一般表示式。
This paper discusses the optimal weight of the weighted least squares method and offers its general expression.
椭圆曲线密码体制的实现速度依赖于曲线上标量乘法的运算速度。
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication.
正像是在小学你做除法和乘法的时候，你毫不含糊地从左到右，按顺序做运算。
Just as in grade school when you're doing division and multiplication, you do it from left to right in terms of order of operations.
本章的目的在于向读者介绍用数字技术实现二进制乘法的各种方法。
The purpose of this chapter is to provide the reader with repertoire of digital implementation techniques of binary multiplication.
由于乘法的操作数是两个64位的值，它们的乘积是一个128位的数字。
Since the operands for the multiplication are 64-bit values, the result of their product is a 128-bit number.
基于该理论，本文设计了实现三值加法和三值乘法的电流型CMOS电路。
Based on this theory, the current-mode CMOS circuits realizing ternary addition and ternary multiplication operations are designed.
我们对到a变为1为止所经历的除法、乘法的次数以及总共经历的步数感兴趣。
We are interested in the number of divisions, multiplications, and total number of steps until a reaches 1.
实验应用了基于最小二乘法的数字滤波技术、多通道采样技术、变频率采样技术。
Digital filtering technique based on least square method, multichannel sampling technique and frequency variation sampling technique were used experimentally.
实验应用了基于最小二乘法的数字滤波技术、多通道采样技术、变频率采样技术。
Digital filtering technique based on least square method multichannel sampling technique and frequency variation sampling technique were used experimentally.
求逆是标量乘法中最耗时的运算，求逆运算次数的多少直接决定标量乘法的性能。
A field inversion is the most expensive operation on scalar multiplication, and the number of inversion determines the performance of scalar multiplication.
我们将对矩阵乘法的标准技术稍微进行一下修改，这样就可以使用前面介绍的算法了。
We'll make a slight change to the standard technique for multiplying matrices so that the previous algorithm can be applied here.
我们提出了“指标分布图”的新概念，从而构造出一个估计任意维数矩阵乘法的新算法。
We propose a new conception: Index Distribution Chart, which makes it possible for us to construct a new fast multiplication algorithm for matrix pairs of arbitrary dimensions.
在介绍了基于最小二乘法的多元线性回归建模方法后，建模了机床的热变形实时预测模型。
After expounding the modeling method of multiple linear regression based on least square algorithm, the thermal distortion model is modelled.
用最小区域法求直线度误差，是在最小二乘法的基础上探讨的一种符合最小条件的新方法。
Computing straightness error on the basis of least square method by way of smallest field method is new method in exploring the minimum condition.
安全椭圆曲线的选取和标量乘法的快速计算是有效实现椭圆曲线密码体制的两个主要问题。
The selection of secure elliptic curves and the scalar multiplications of elliptic curves are two important problems in the practice of efficiently implementing an elliptic curve cryptosystems.
安全椭圆曲线的选取和标量乘法的快速计算是有效实现椭圆曲线密码体制的两个主要问题。
The selection of secure elliptic curves and the scalar multiplications of elliptic curves are two important problems in the practice of efficiently implementing an elliptic curve cryptosystems.
应用推荐