文件名称:juzhenliancheng
介绍说明--下载内容来自于网络,使用问题请自行百度
给定n个矩阵A1,A2,…,An,其中,Ai与Aj+1是可乘的,i=1,2,…,n-l。
你的任务是要确定矩阵连乘的运算次序,使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。
-Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is multiplicative in, i = 1,2, ..., nl. Your task is to determine the matrix multiplication operation with the order to calculate the product of n matrices even when A1A2 ... An element of the total number of multiplications to a minimum.
你的任务是要确定矩阵连乘的运算次序,使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。
-Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is multiplicative in, i = 1,2, ..., nl. Your task is to determine the matrix multiplication operation with the order to calculate the product of n matrices even when A1A2 ... An element of the total number of multiplications to a minimum.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
矩阵连乘问题/111.cpp
矩阵连乘问题/111.msp
矩阵连乘问题/Debug/111.exe
矩阵连乘问题/Debug/111.o
矩阵连乘问题/Debug
矩阵连乘问题
矩阵连乘问题/111.msp
矩阵连乘问题/Debug/111.exe
矩阵连乘问题/Debug/111.o
矩阵连乘问题/Debug
矩阵连乘问题
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.