Description: C语言路由距离向量路由算法演示程序，采用TC2.0的图形方式编程模式，主要演示路由算法-C language routing Distance Vector routing algorithm demo program using the graphical TC2.0 programming model, the main demonstration of routing algorithm Platform: |
Size: 43008 |
Author:刘军 |
Hits:
Description: 该文档为利用C语言编程实现小型矢量汉字库的创建及调用的实现方法，有源代码。该文档在网上不是免费的，需要的朋友抓紧时间-The document for the use of C language programming of small vector汉字库the creation and call the method source code. The document is not free online, the need to seize the time to friend Platform: |
Size: 139264 |
Author:chengyu |
Hits:
Description: 原始单纯形法（大M法，无需给出初始基变量）
Programmed by Liyang(faruto s Studio~!) BNU MATH
Email:liyangbnu@mail.bnu.edu.cn QQ:516667408
last modified 2008.4.27
求解标准型线性规划:max C*X s.t. A*X=b (b>=0) X>=0
输入：C是n维行向量，A是m*n的系数矩阵，b是m维列向量- Of the original simplex method (big M method, without giving the initial basic variable) Programmed by Liyang (faruto' s Studio ~!) BNU MATH Email: liyangbnu@mail.bnu.edu.cn QQ: 516667408 last modified 2008.4.27 solving standard linear programming: max C* X st A* X = b (b> = 0) X> = 0 input: C is the n-dimensional row vector, A is the coefficient matrix of m* n, b is the m-dimensional column vector Platform: |
Size: 1024 |
Author:hongye |
Hits:
Description: 原始单纯形法（需直接给出初始的基变量）
求解标准型线性规划:max C*X s.t. A*X=b (b>=0) X>=0 输入：C是n维行向量，A是m*n的系数矩阵，b是m维列向量，XB承装初始基变量的下标。输出：x最优解（如果有的话），fval最优值，flag解的状态说明，interation求解时的循环次数。-Original simplex method (to be given directly to the initial base variable)
Solving the standard linear programming: max C* X st A* x = b (b> = 0) X> = 0
Input: C is an n-dimensional row vector, A is a coefficient matrix of m* n, b is the m-dimensional column vector, XB Holds initial base variable subscript
Output: x optimal solution (if any) fval optimal value of the state flag solution illustrates the interation solution cycles. Platform: |
Size: 1024 |
Author:kangkankan |
Hits:
Description: 功能：用拉格朗日方法求解等式约束二次规划：min f(x)=0.5*x Hx+c x,s.t.Ax=b
输入：H,c分别是目标函数的矩阵和向量，A,b分别是约束条件中的矩阵和向量
输出：（x,lam)是KT点，fval是最优值。-Function: Lagrangian method for solving equality constrained quadratic programming: min f (x) = 0.5* x Hx+ c x, s.t.Ax = b
Input: H, c are the matrix and vector objective function, A, b are the constraints in the matrices and vectors
Output: (x, lam) is KT point, fval optimal value. Platform: |
Size: 2048 |
Author:Aira.W |
Hits:
Description: 《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的，主要介绍用C语言，并结合使用MPI和OpenMP进行并行程序设计，内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-" MPI and OpenMP parallel programming (C language version)" is Michael J.Quinn Professor Oregon State University in the years written in a lecture on " parallel programming" course, based on the C language introduces, and in conjunction with MPI and OpenMP parallel programming, including parallel architectures, parallel algorithm design, message passing programming, Eratosthenes sieve method, Floyd algorithm, performance analysis, matrix-vector multiplication, document classification, Monte Carlo method, matrix multiplication, linear equations solving finite difference method, sorting, fast Fourier transform, a combination of search, shared memory programming, integration OpenMP and MPI and five appendices. Platform: |
Size: 48901120 |
Author:艾艾 |
Hits:
Search - c programming vector method