Matrix Multiplication的例句大全

Comply with rules require matrix multiplication between the matrix multiplication.

符合矩阵乘法规则要求的矩阵间的乘法.

The simplification matter of matrix multiplication is settled thoroughly in the way given in the paper.

彻底解决了矩阵乘法计算的简化问题.

Matrix multiplication with the requirements of the rules of the matrix multiplication.

符合矩阵乘法规则要求的矩阵间的乘法.方阵间的除法,方阵的求逆.

OpenMP for mixed MPI and parallel matrix multiplication to solve the problem.

并行矩阵乘法.用于mpi和openMP混合并行求解矩阵乘法问题.

A parallel algorithm for matrix multiplication is proposed according to the characteristic of matrix multiplication.

本文根据矩阵相乘的特点,提出了矩阵相乘的并行算法.

A block algorithm of 3 ￣ n-th degree matrix multiplication

3~n阶矩阵乘法的分块算法

Using Model and Iterative Compilation to Optimize Matrix Multiplication Applications

结合模型和迭代编译优化矩阵相乘程序

the model contains two of important security protocol modules: shamir secret sharing module and security matrix multiplication module.

模型中包含的最重要的两个安全协议模块为shamir秘密共享模块和安全矩阵积模块。

matrix multiplication's algorithm research in multiprocessing machine

多处理机中矩阵乘法的算法研究

And we can reformulate this in terms of matrix multiplication or matrix product.

我们可以用，矩阵乘法或矩阵乘积的形式来表述这些式子。

similarly, the order of matrix multiplication is important.

同样，矩阵相乘的顺序也是重要的。

In this paper, we implement an efficient matrix multiplication on GPU using NVIDIA's CUDA.

本文使用NVIDIA的CUDA在GPU上实现了一个高效的矩阵乘法。

Multi-particle tracking and matrix multiplication are used to calculate the beam transport. Monte Carlo techniques are adopted to generate randomly the initial particle coordinates in the phase spaces, and Powell nonlinear optimization routines are incorporated in the codes to search the given optical conditions.

程序采用多粒子跟踪与σ矩阵相结合的万式，用Monte Carlo方法随机产生初始相空间中各代表点的坐标，并用Powell非线性最优化方法进行光路系统的最优化计算。

study on the defense matrix meeting commutative law of multiplication

防御矩阵满足乘法交换律的证明

Analysis of Matrix ′ s Multiplication Algorithm Based on List of 3-Tuples

三元组表矩阵相乘的算法分析

The paper expounds the combination of block multiplication and elementary transformation and its wide application in matrix calculation.

该文阐述了分块乘法和初等变换相结合在矩阵计算中的广泛应用。

Besides, some main characters of matrix link multiplication about asymptotic time complexity, space complexity and so on are analysed in detail.

分析和总结了矩阵链乘有关时间复杂度和空间复杂度等重要性质。

Analysis of Algorithm and Time Complexity on the Optimum Order of Matrix Chain Multiplication

矩阵链乘积最优计算次序问题的算法及其复杂性分析

in this paper, by applying elementary combination methods and some properties of trigonometric matrix, a fast algorithm of multiplication for two n-order real symmetry-circulant toeplitz matrices is investigated.

应用初等的组合方法和三角矩阵知识，给出了两n阶实对称循环Toeplitz矩阵相乘的一种快速算法。

Dynamic programming is also used in matrix-chain multiplication, assembly-line scheduling, and computer chess programs.

动态编程还可用于矩阵链相乘、装配线规划和计算机象棋程序。