矩阵乘法

OpenGL为建立取景体提供了一系列基本的变换函数，它由矩阵乘法来表达，包括模型化操作、视图操作和投影操作。

A series of transformations functions of OpenGL such as matrix multiplication , include modeling , viewing , and projection operations .

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

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

在求解逆变器消谐PWM模型的迭代运算中，需要进行大量的矩阵乘法运算。

A large quantity of matrix multiplier calculations must be executed in the iterative calculation of the inverter harmonic elimination PWM model .

针对MCDCT中的矩阵乘法，本文设计了一种适合硬件实现的快速方法，在整体设计上采用了并行流水和脉动阵列的结构；

Among MC_DCT , computational complexity is reduced based on using approximate matrices . Parallel design and systolic array structure is adopted in the overall design in this paper .

Strassen与Winograd快速矩阵乘法研究

The study of fast matrix multiplication on the Strassen and Winograd

2001年已经开始有人利用GPU来加速矩阵乘法运算，随后，基于GPU加速的应用出现了爆炸式的增长。

People have started using GPU to accelerate the matrix multiplication since 2001 , and from then on , an explosive growth occurred in the applications that use GPU as an accelerator .

算法复杂度分析的结果显示，在TS进行临域搜索时本文提出的启发式算法优于布尔矩阵乘法以及重复调用广度优先算法。

Algorithm analysis reveals that , the heuristic algorithm presented in this paper is better than other two algorithms ( Boolean Matrix Multiplication and repeated calling Breadth First Search Algorithm ) during neighborhood searching of TS.

关于Strassen矩阵乘法的探讨

On Strassen ' Matrix Multiplication

基于多处理机平台TMS320C80（C80），提出并行矩阵乘法和并行高斯约当消元法。

On the basis of the multiprocessor platform , TMS320C80 's programmable structure , the parallel matrix multiplication and parallel Gauss Jordan elimination algorithms are introduced .

首先利用DCT变换的正交特性，推导出了在压缩域实现低通滤波运算的具体算法，在这种算法中，利用压缩域的矩阵乘法运算实现空间域的线性低通滤波运算。

Firstly , the algorithm for accomplishing spatial domain low-pass filtering in the compressed domain is formulated based on the properties of the DCT . In this algorithm , using multiplication of matrix with 8 × 8 dimensions in the DCT domain implements spatial domain linear filtering .

在分析一般矩阵乘法运算对计算方阵高次幂运算局限性基础上，结合实例介绍了矩阵分解法、HamiltonCayley定理法等七种方阵高次幂求解方法。

In this paper , seven methods for calculating square matrix high math power are introduced with examples on the basis of limit of normal multiplication operation for square matrix high math power . These methods are matrix resolve and Hamilton-Cayley theory etc.

在概述了并行处理技术与并行算法的基本概念之后，研究了矩阵乘法在分布式处理机上的并行处理技术，对MIMD上的矩阵乘法的并行算法进行了分析，给出了算法的实现步骤。

After introducing the concept of parallel processing and parallel algorithm , we studied the matrix multiplication parallel processing techniques in distributed environment . We analyzed the parallel algorithm for matrix multiplication in MIMD , and described the implementation of the algorithm .

基于RISC-DSP核微处理器的指令集体系结构特点，研究分析了视频图像处理中8×8的IDCT算法，将其分解为两级矩阵乘法运算的结构，并利用RISC-DSP核微处理器的多媒体指令分两步实现。

The 8 × 8 IDCT algorithm in video image processing was analyzed based on the character of the instruction set architecture and then divided into two stages of matrix multiplication . The multimedia extended instructions of the RISC-DSP processor were applied to realize the IDCT calculation in two steps .

通过矩阵乘法实验表明，静态二进制翻译系统SBTG翻译生成的并行程序不仅能正确执行传统串行程序的功能，而且执行速度比传统串行程序要快。

Through the matrix multiplication results show that the parallel program which is generated by the static binary translation system SBTG not only properly perform the function of traditional serial program , but also its execution speed faster than the implementation of traditional serial procedures .

基于矩阵乘法共享方案的数字水印分存算法

Digital Watermarking Sharing Algorithm Based on Matrix Multiplication Secret Sharing Scheme

矩阵乘法是数值计算中最重要的一类运算。

Matrix-multiplication is the most important kind of operation in numerical-computing .

求解连续投资问题的矩阵乘法

A Matrix Multiplication Method for Solving the Problem with Continuous Investment

那么，矩阵乘法是什么意思？

So , what does it mean to do a matrix product ?

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

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

基于矩阵乘法的网络最短路径算法

Shortest Path Problem Algorithm in Network Based on Matrix Multiplication

矩阵乘法和高斯-约当消元法并行实现的研究

Parallel Achievement Research of Matrix Multiplication and Gauss-Jordan Elimination

半环上的三角矩阵乘法半群的自同构

Multiplicative Semigroup Automorphisms of Upper Triangular Matrices over Semirings

关于矩阵乘法与整数卷积最佳算法运算量的估计

Estimation of time about the optimal algorithms for matrix multiplication and integer convolution

广义初等变换及矩阵乘法的简化

Generalized Primary Transposition and the Simplification of Matrix Multiplications

关于矩阵乘法的一个算法的时间复杂度

On the Complexity of an Algorithm for Matrix Multiplications

一个反对称矩阵乘法的快速算法

A Fast Algorithm of Anti - symmetric Matrix Multiplication

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

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

基于三值逻辑光学处理器实现向量矩阵乘法

Optical vector-matrix multiplication based on ternary optical processor

从矩阵乘法的分行（列）律到分块律

From partition row ( column ) rule to partition Brock rule of matrix multiplication

本文还研究了矩阵乘法的渐近快速算法。

On the other hand , we study asymptotically fast algorithm for rectangular matrix multiplication .