Description: 这是算法程序中用求矩阵连乘问题的c++实现，利用了动态规划的算法-This is the procedure used for algorithm continually multiply matrices of c, using a dynamic programming algorithm Platform: |
Size: 43841 |
Author:阳林 |
Hits:
Description: 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least. Platform: |
Size: 1024 |
Author:韩希先 |
Hits:
Description: 由于矩阵连乘不同结合方式的运算工作量很不一样. 工作量相差也非常大；所以要寻找一种最佳的结合方式, 然后再执行矩阵乘法运算-continually multiply matrices combining different ways of computing workload very different. The workload is also very big difference; So to find the best combination of a way, and then the implementation of matrix multiplication Platform: |
Size: 1024 |
Author:小康 |
Hits:
Description: 这是算法程序中用求矩阵连乘问题的c++实现，利用了动态规划的算法-This is the procedure used for algorithm continually multiply matrices of c, using a dynamic programming algorithm Platform: |
Size: 44032 |
Author:阳林 |
Hits:
Description: MFC 視窗程式設計,視窗作業環境經多年試鍊，視窗應用程式於架構上已然出現了明顯的分類；
即便是架構不同，其間也存在著諸多共同點，例如：它們通常的都需要有功能表、
工具列等控制元件的設計，需要有用來動態管理資料的矩陣（arrays）、表列（lists）
等物件類別。-Windows MFC Programming, Windows operating environment after years of test chain, window applications already in the framework, there is a clear classification even different structure, during which there are many points in common, for example: they usually have to be Menus, toolbars and other control components of the design, the need for dynamic management of data matrices (arrays), shown in the table (lists), such as object types. Platform: |
Size: 386048 |
Author:Poodle Lww |
Hits:
Description: 学习扩展卡尔曼滤波气的基本文件，可以随便下载并讨论-This is a tutorial on nonlinear extended Kalman filter (EKF). It uses the standard EKF fomulation to achieve nonlinear state estimation. Inside, it uses the complex step Jacobian to linearize the nonlinear dynamic system. The linearized matrices are then used in the Kalman filter calculation. Platform: |
Size: 55296 |
Author:tongliang |
Hits:
Description: 动态规划方法是求解最优解的一种方法。用动态规划方法求解矩阵相乘。-Solving the dynamic programming method is a method of the optimal solution. Method using dynamic programming matrices. Platform: |
Size: 1024 |
Author:workfuture |
Hits:
Description: 2、 矩阵（二）
编写C++程序完成以下功能：
（1） 假定矩阵大小为4×5（整型）；
（2） 矩阵空间采用new动态申请，保存在指针中；
（3） 定义矩阵初始化函数，可以从cin中输入矩阵元素；
（4） 定义矩阵输出函数，将矩阵格式化输出到cout；
（5） 定义矩阵相加的函数，实现两个矩阵相加的功能,结果保存在另一个矩阵中；
（6） 定义矩阵相减的函数，实现两个矩阵相减的功能,结果保存在另一个矩阵中；
（7） 动态申请三个矩阵：A1、A2、A3；
（8） 初始化A1、A2；
（9） 计算并输出A3 = A1加A2，A3 = A1减A2；
（10） 释放矩阵空间。-2, matrix (2)
The preparation of C++ program to accomplish the following functions:
(1) assumes that matrix size of 4 × 5 (integer)
(2) matrix space with new dynamic applications, stored in the pointer
(3) defines the matrix initialization function, you can enter the matrix elements from the cin
(4) defines the matrix of output function, the matrix format the output to cout
(5) defines the matrix, the sum of the function, the sum of two matrices to achieve the functions of a matrix stored in another
(6) defines a function of matrix subtraction, subtract two matrices to achieve the function, the results stored in another matrix
(7) dynamic applications for three matrices: A1, A2, A3
(8) to initialize A1, A2
(9) to calculate and output of A3 = A1 plus A2, A3 = A1 by A2
(10) release matrix space. Platform: |
Size: 1024 |
Author:bedding |
Hits:
Description: 问题一：设a[0:n-1]是已排好序的数组。请改写二分搜索算法，使得当搜索元素x不在数组中时，返回小于x的最大元素位置i和大于x的最小元素位置j，当搜索元素在数组中时，i和j相同，均为x在数组中的位置。
问题二：采用分治策略实现对n个元素进行排序的合并排序算法，其基本思想是：将待排序元素分成大小大致相同的2个子集合，分别对2个子集合进行排序，最终将排好序的子集合合并成为所要求的排好序的集合。
问题三：给定n个矩阵{A1，A2，A3，……，An}，其中，Ai与Ai+1是可乘的，i=1，2，…,n-1。要求用动态规划解矩阵连乘积的最优计算次序问题。
该三题的算法设计思想及源码，调试结果-Question one: Let a [0: n-1] is already sorted array. Please rewrite the binary search algorithm so that when the search element of x is not an array, the return is less than x, is larger than the largest element in position i and position x, the smallest element of j, when the search elements in the array when, i and j the same, both x in the array position.
Problem 2: The strategy for achieving the partition of n elements to sort of merge sort algorithm, whose basic idea is: sort elements are to be divided into roughly the same size of the two sub-sets, respectively, of the two sub-sort the collection will eventually sorted The merged to form the required subset sorted collection.
Question 3: Given n matrices (A1, A2, A3, ... ..., An), where, Ai and Ai+1 is a mere a, i = 1,2, ..., n-1. Required to use dynamic programming solution matrix with the optimal product sequence calculation of the problem.
The three questions of the algorithm design ideas and source code, debu Platform: |
Size: 9216 |
Author:土咩豆 |
Hits:
Description: Multiplication of matrices of size and MxK HxM.
ALL shipment must be made without blocking!
Managing the process:
1. Asks for the dimensions of matrices M, K, N.
2. Produces dynamic formation and filling of matrix operands.
3. Prepares and distributes tasks (calculation of value of 1 cell of the resulting matrix) among the child processes.
4. Accepts the results and record the resulting matrix.
5. Prints the matrix operands and the resultant matrix to the screen.
6. Inform the child processes to complete work.
Child processes:
1. Is the job to calculate
2. Calculates the elements of the resulting matrix
3. Transmit the result of controlled processes.
4. Managing the process takes responses from all.
5. Managing the process sends a message of completion of
6. all processes are finalizing Platform: |
Size: 2161664 |
Author:anyman |
Hits:
Description: 矩阵连乘：矩阵的连乘，利用动态规划算法解决次序问题-Multiplicative matrix: matrices with multiplication, the order of the dynamic programming algorithm to solve the problem Platform: |
Size: 167936 |
Author:赵莉 |
Hits:
Description: Matrix Chain Multiplication is perhaps the quintessential example of dynamic programming. The problem can be stated as follows: given a chain <A1, A2,..., An> of n matrices, where for i = 1, 2,...,n, matrix Ai has dimension pi-1 x pi, fully parenthesize the product A1A2...An in a way that minimizes the number of scalar multiplications. Platform: |
Size: 1024 |
Author:Justas |
Hits:
Description: 给定n个矩阵{A1,A2,…,An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。考察这n个矩阵的连乘积A1A2…An。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以有许多不同的计算次序，这种计算次序可以用加括号的方式来确定。-Given n matrices {A1, A2, ..., An}, where Ai and Ai+1 is a mere of, i = 1,2, ..., n-1. Study the n matrix with the product A1A2 ... An. Since matrix multiplication to meet with law, so the calculation of the matrix with the product can have many different ways to calculate the order, the order of this calculation can be used to determine the way in parentheses. Platform: |
Size: 1024 |
Author:庞存岐 |
Hits:
Description: 给定n个矩阵{A1,A2,…,An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。要算出这n个矩阵的连乘积A1A2…An。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。若一个矩阵连乘积的计算次序完全确定，也就是说该连乘积已完全加括号，则可以依此次序反复调用2个矩阵相乘的标准算法计算出矩阵连乘积。本文的功能是采用动态规划算法，给出矩阵的一种最优的加括号方式，是计算量最小。-Given n matrices {A1, A2, ..., An}, where Ai and Ai+1 is a mere of, i = 1,2, ..., n-1. To calculate the n matrix with the product A1A2 ... An. Since matrix multiplication to meet with law, so the calculation of the matrix with the product can have many different calculation order. This calculation can be bracketed in order to determine ways. Even if the product of a matrix calculation to determine the complete sequence, that the product is fully bracketed with, so you can call the order of 2 repeated the standard matrix multiplication algorithm to calculate the matrix with the product. This feature is the use of dynamic programming algorithm, a matrix is given in parentheses best way is to calculate the minimum amount. Platform: |
Size: 13312 |
Author:阿四 |
Hits:
Description: 计算两个任意矩阵的乘积，包括了动态分配内存，指针等知识点-Calculation of two arbitrary matrices, including the knowledge of the dynamic allocation of memory, the pointer points Platform: |
Size: 1024 |
Author:zhanglinwei |
Hits:
Description: 3、 矩阵（三）
编写C++程序完成以下功能：
（1） 用类来实现矩阵，定义一个矩阵的类，属性包括：
矩阵大小，用 lines, rows（行、列来表示）；
存贮矩阵的数组指针，根据矩阵大小动态申请（new）。
（2） 矩阵类的方法包括：
构造函数，参数是矩阵大小，需要动态申请存贮矩阵的数组；
析构函数，需要释放矩阵的数组指针；
拷贝构造函数，需要申请和复制数组；
输入，可以从cin中输入矩阵元素；
输出，将矩阵格式化输出到cout；
矩阵相加的函数，实现两个矩阵相加的功能,结果保存在另一个矩阵类，但必须矩阵大小相同；
矩阵相减的函数，实现两个矩阵相减的功能,结果保存在另一个矩阵类，但必须矩阵大小相同。
（3） 定义三个矩阵：A1、A2、A3；
（4） 初始化A1、A2；
（5） 计算并输出A3 = A1加A2，A3=A1减A2；
（6） 用new动态创建三个矩阵类的对象：pA1、pA1、pA3；
（7） 初始化pA1、pA2；
（8） 计算并输出pA3=pA1加pA2，pA3=pA1减pA2；
（9） 释放pA1、pA1、pA3。-3, matrix, (c)
Write a C++ program to perform the following functions:
(1) matrix class, define a matrix of class attributes include:
matrix size, lines, rows (rows and columns to represent)
storage matrix array pointer, dynamic application (new) according to the size of the matrix.
(2) matrix class method comprising:
constructor parameter is the size of the matrix, dynamic application memory matrix array
destructor release matrix array pointer
copy constructor, and the need to apply for and copy an array
The input from cin input matrix elements
output, the the matrix formatted output to cout
Function matrix sum, the sum of two matrices, and the results are stored in another matrix class, but must be the same as the size of the matrix
matrix function subtraction, subtract two matrices, and save the results in another matrix class, but it must be the same as the size of the matrix.
(3) d Platform: |
Size: 1024 |
Author:珊 |
Hits:
Description: 非线性扩展卡尔曼滤波算法的matlab程序-Description:This is a tutorial on nonlinear extended Kalman filter (EKF).
It uses the standard EKF fomulation to achieve nonlinear state estimation.
Inside, it uses the complex step Jacobian to linearize the nonlinear dynamic system.
The linearized matrices are then used in the Kalman filter calculation.
The complex step differentiation seems improving the EKF performance particularly in accuracy
such that the optimization and NN training through the EKF are better than through the UKF Platform: |
Size: 5120 |
Author:窦贤明 |
Hits:
Description: 矩阵（二）
编写C++程序完成以下功能：
（1）假定矩阵大小为4×5（整型）；
（2）矩阵空间采用new动态申请，保存在指针中；
（3）定义矩阵初始化函数，可以从cin中输入矩阵元素；
（4）定义矩阵输出函数，将矩阵格式化输出到cout；
（5）定义矩阵相加的函数，实现两个矩阵相加的功能,结果保存在另一个矩阵中；
（6）定义矩阵相减的函数，实现两个矩阵相减的功能,结果保存在另一个矩阵中；
（7）动态申请三个矩阵：A1、A2、A3；
（8）初始化A1、A2；
（9）计算并输出A3 = A1加A2，A3 = A1减A2；
（10）释放矩阵空间。-Matrix (two) write C++ program performs the following functions: (1) assuming matrix size of 45 (integer) (2) matrix spaces using new dynamic applications, stored in the pointer (3) define the matrix initialization function, you can Enter the matrix elements from cin (4) defines the output function matrix, the matrix format the output to cout (5) defines a function of matrix addition, to achieve the function of two matrices and stores the result in another matrix (6) Define the matrix subtraction function, the realization of the function of two matrices subtraction result is stored in another matrix (7) for the three matrices Dynamic: A1, A2, A3 (8) initialization A1, A2 (9) calculate and output A3 = A1 plus A2, A3 = A1 minus A2 (10) release matrix space. Platform: |
Size: 1024 |
Author:熊炜伟 |
Hits:
Description: 动态数组的实现
设矩阵A,B,C都是3*3矩阵，矩阵元素为整数类型，要求：
1.3个矩阵都采用动态数组进行存储；
2.编写实现C=A+B的函数；
3.编写实现C=A*B的函数。-Set up to implement dynamic arrays matrices A, B, C are 3* 3 matrix, the matrix elements of type integer requirements: 1.3 matrices are used to store dynamic arrays 2. Prepared to achieve C = A+B function 3. Prepared to achieve C = A* B of the function. Platform: |
Size: 1024 |
Author:权东 |
Hits:
Description: 矩阵连乘问题 -算法分析之动态规划
动态规划方法解决矩阵连乘问题，即寻求多个矩阵连乘时的最好的加括号方式使得总的乘法两最小； 可以设定矩阵个数，手动输入矩阵的阶，显示动态规划算法的表格，即乘法量和括号信息； 多文档，C++6.0- - Matrix continually multiply problems of dynamic programming algorithm for dynamic programming method to analyze and solve problems matrix continually multiply that seek multiple matrices even the best way to take the brackets so that the total time of the two smallest multiplication you can set the number of matrix, Order manual input matrix display table dynamic programming algorithm that multiplying the amount of information and brackets multi-document, C++6.0 Platform: |
Size: 4634624 |
Author:忘了 |
Hits:
Search - dynamic matrices