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分别表示缩放、旋转和平移的矩阵。
And if we could use the GPU for processing, then we could spawn a bunch of threads and really chew through the matrix multiplication we talked about earlier (or whatever).
如果我们可以利用GPU进行处理，然后我们可以产生一系列线程，真正咀嚼通过矩阵乘法，我们谈到早期(或任何)。
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).
虽然二维数组与线性代数中的矩阵类似，但是对它们的操作(比如乘)与线性代数中的操作(比如矩阵乘)是完全不同的。
The load-balanced multiplication of a large sparse matrix with vector on workstation cluster is considered.
考虑在工作站机群上实现大型稀疏矩阵和向量乘的负载平衡。
The most important advantage of using matrices is that any number of color transformations can be composed using standard matrix multiplication.
利用矩阵的最重要的好处是任何数量的颜色转换，可以使用标准的组成矩阵乘法。
A parallel algorithm for matrix multiplication based on optical transpose interconnection system (OTIS) network is proposed, and the time complexity is analyzed.
提出基于光交换互连系统(otis)网络结构的矩阵乘并行算法，分析它的时间复杂性。
This code solves the problem of complex matrix multiplication, I hope all of you to help!
此代码解决了复矩阵相乘的问题，希望对大家有所帮助！
Though I can do matrix multiplication in parallel, I have to be careful about how I break up the problem and I can't exploit all the parallelism possible because of the tools I normally work with.
虽然我可以做矩阵乘法并行，我必须要小心，我怎么打破这个问题，我不能利用一切可能的并行，因为我通常的工具工作。
Since the formulas do not involve the multiplication and inverse of matrix, the calculations are reduced.
由于公式不涉及矩阵乘法和求逆运算，因而计算量较小。
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.
为了便于计算机处理，将有向图用矩阵表示，通过有向图矩阵的乘法运算搜索最长的有向路径。
From this point of view, we can concisely and intuitively introduce the multiplication principles of elementary matrix and block 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.
若直接采用最小二乘估计的公式，因计算过程需要求矩阵的逆及乘积，计算量非常大。
This paper introduces the basic idea and algorithm of sparse Matrix multiplication by using incompact storage method.
介绍了对稀疏矩阵进行压缩存储时，稀疏矩阵相乘运算的基本思想和算法。
The following matrix multiplication will perform the pair of transformations in the order listed.
下列矩阵乘法将会依照列出来的顺序执行成对的转换。
Objective To observe the effect of bradykinin(BK) on kidney mesangial cell multiplication and extracellular matrix secretion under high glucose environment.
目的观察缓激肽（BK）对高糖浓度下肾小球系膜细胞增殖和细胞外基质分泌的影响。
Compute shortest paths with matrix multiplication and the Floyd-Warshall algorithm for the following graph.
计算最短路径与矩阵乘法和弗洛伊德·沃肖尔算法对以下图。
Optimization techniques for the sparse matrix vector multiplication are adopted in programming.
编程中采用了稀疏矩阵向量相乘的优化技术。
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.
设计了一种新的分组密码算法，该算法利用矩阵乘法的扩散作用与专门设计的一种矩阵运算的混乱作用实现对信息的加密。
Then, large sequence and sequential patterns are all out pass the vector of matrix multiplication operator corresponding to the elements and simple addition operations have been.
接下来的大序列、序列模式等都是通过矩阵的列向量对应元素的相乘运算和简单的加法运算而得到。
Then the definition of boundary value matrix for multi-multiplication interval linear systems is proposed.
对于多乘性区间线性系统，给出边界值矩阵的定义。
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矩阵的计算涉及到矩阵的乘法和求逆，当粒子尺寸很大时，这两种矩阵运算特别是求逆将消耗大量的时间。
It reduces greatly the computational complexity of matrix-vector multiplication in conjugate gradient iteration improves the efficiency of MLFMA while the reasonable accuracy is maintained.
该方法在保证合理计算精度的同时大大降低了迭代过程中矩阵矢量相乘的计算复杂度，提高了多层快速多极子方法计算效率。
First summarizes the differences on principle between two kinds of parallel algorithm of matrix-vector multiplication, namely, divided by row and divided by column.
文中首先总结按行划分和按列划分的并行矩阵向量乘法在原理上的异同。
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 ） ，提出并行矩阵乘法和并行高斯约当消元法。
The simplification matter of matrix multiplication is settled thoroughly in the way given in the paper.
彻底解决了矩阵乘法计算的简化问题。
The algorithm calculated the wave front slope by a reusing core module manner and complemented the wave front reconstruction with the decomposition of matrix-vector multiplication.
该算法基于重复利用核心模块的方式完成波前斜率计算，利用矩阵与向量相乘的可分解性完成波前复原计算。
In this algorithm, which is matrix multiplication and perspective through the perspective divide step completed.
在算法中它是通过透视矩阵乘法和透视除法两步完成的。
First, the 2-d IDCT is transformed into two cascaded 1-d IDCT. Then 1-d IDCT can be implemented by multiplication and addition of matrix according to butterfly computation.
首先将二维idct转换为两个一维idct变换，根据蝶形算法进一步转换为矩阵的乘加运算。
First, the 2-d IDCT is transformed into two cascaded 1-d IDCT. Then 1-d IDCT can be implemented by multiplication and addition of matrix according to butterfly computation.
首先将二维idct转换为两个一维idct变换，根据蝶形算法进一步转换为矩阵的乘加运算。
应用推荐