So that's matrix multiplication.
,好，这就是矩阵乘法。
Matrix multiplication by it's transpose returning zeros matrix?
矩阵乘法，矩阵转置返回零？
And we can reformulate this in terms of matrix multiplication or matrix product.
我们可以用，矩阵乘法或矩阵乘积的形式来表述这些式子。
How to use thread pool and message queues in Multithreaded Matrix Multiplication?
如何使用线程池和多线程矩阵乘法的消息队列？
This code solves the problem of complex matrix multiplication, I hope all of you to help!
此代码解决了复矩阵相乘的问题，希望对大家有所帮助！
In this paper, we implement an efficient matrix multiplication on GPU using NVIDIA's CUDA.
本文使用NVIDIA的CUDA在GPU上实现了一个高效的矩阵乘法。
Multiple multi-value context variables would result in a matrix multiplication and are not supported.
多个多值上下文变量将产生矩阵乘法，并且不受支持。
The following matrix multiplication will perform the pair of transformations in the order listed.
下列矩阵乘法将会依照列出来的顺序执行成对的转换。
The simplification matter of matrix multiplication is settled thoroughly in the way given in the paper.
彻底解决了矩阵乘法计算的简化问题。
Compute shortest paths with matrix multiplication and the Floyd-Warshall algorithm for the following graph.
计算最短路径与矩阵乘法和弗洛伊德·沃肖尔算法对以下图。
This paper introduces the basic idea and algorithm of sparse Matrix multiplication by using incompact storage method.
介绍了对稀疏矩阵进行压缩存储时，稀疏矩阵相乘运算的基本思想和算法。
The matrix multiplication is done in the order SRT, where s, r, and t are the matrices for scale, rotate, and translate, respectively.
矩阵是按照SRT顺序进行相乘的，其中S、r和t分别表示缩放、旋转和平移的矩阵。
The most important advantage of using matrices is that any number of color transformations can be composed using standard matrix multiplication.
利用矩阵的最重要的好处是任何数量的颜色转换，可以使用标准的组成矩阵乘法。
Matrix multiplication is a basic operation in scientific computing. Efficient implementation of matrix multiplication can speed up many applications.
矩阵乘法是科学计算中最基本的操作，高效实现矩阵乘法可以加速许多应用。
A parallel algorithm for matrix multiplication based on optical transpose interconnection system (OTIS) network is proposed, and the time complexity is analyzed.
提出基于光交换互连系统(otis)网络结构的矩阵乘并行算法，分析它的时间复杂性。
A new block cipher is designed where the diffusion of matrix multiplication is combined with the confusion of specially designed matrix operation to encrypt information.
设计了一种新的分组密码算法，该算法利用矩阵乘法的扩散作用与专门设计的一种矩阵运算的混乱作用实现对信息的加密。
On the basis of the multiprocessor platform, TMS320C80's programmable structure, the parallel matrix multiplication and parallel Gauss Jordan elimination algorithms are introduced.
基于多处理机平台TMS32 0C80 （C80 ） ，提出并行矩阵乘法和并行高斯约当消元法。
In computing the scattering fields, the determination of the T-matrix involves matrix multiplication and inversion, which consumes considerable time when the size of the particle is large.
在散射场的计算中，T矩阵的计算涉及到矩阵的乘法和求逆，当粒子尺寸很大时，这两种矩阵运算特别是求逆将消耗大量的时间。
Even though two-dimensional arrays are similar to matrices from linear algebra, operations (such as multiply) have nothing to do with the operations in linear algebra (such as matrix multiplication).
虽然二维数组与线性代数中的矩阵类似，但是对它们的操作(比如乘)与线性代数中的操作(比如矩阵乘)是完全不同的。
Dynamic programming is also used in matrix-chain multiplication, assembly-line scheduling, and computer chess programs.
动态编程还可用于矩阵链相乘、装配线规划和计算机象棋程序。
Scilab provides simple matrix operations like multiplication, plus a library of high-level operations like complex multi-dimensional arithmetic and correlation.
Scilab提供了简单的矩阵运算（比如乘法），也提供了高级运算库（比如复数多维算法和相关）。
The load-balanced multiplication of a large sparse matrix with vector on workstation cluster is considered.
考虑在工作站机群上实现大型稀疏矩阵和向量乘的负载平衡。
Since the formulas do not involve the multiplication and inverse of matrix, the calculations are reduced.
由于公式不涉及矩阵乘法和求逆运算，因而计算量较小。
From this point of view, we can concisely and intuitively introduce the multiplication principles of elementary matrix and block matrix.
用变量的线性替换解释矩阵乘法，由此可以简洁而且直观地导出初等矩阵和分块矩阵的乘法原理。
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.
我们提出了“指标分布图”的新概念，从而构造出一个估计任意维数矩阵乘法的新算法。
Yacobi method belongs to iteration methods, and is widely used. It has simple formula, which needs only time multiplication of matrix and rector for one iteration.
迭代法中的雅克比迭代法是一种比较常用的方法，它公式简单，每迭代一次只需计算一次矩阵和向量乘法。
For computer processing of the directed digraph, it is expressed by a matrix, and then the longest directed paths can be obtained through matrices multiplication.
为了便于计算机处理，将有向图用矩阵表示，通过有向图矩阵的乘法运算搜索最长的有向路径。
If we use the equation of least square estimator directly, computing amount is often very great because course of computing need calculate the inverse of matrix and multiplication of matrix.
若直接采用最小二乘估计的公式，因计算过程需要求矩阵的逆及乘积，计算量非常大。
If we use the equation of least square estimator directly, computing amount is often very great because course of computing need calculate the inverse of matrix and multiplication of matrix.
若直接采用最小二乘估计的公式，因计算过程需要求矩阵的逆及乘积，计算量非常大。
应用推荐