登录
首页 » Fortran » gus

gus

于 2017-04-21 发布 文件大小:1KB
0 145
下载积分: 1 下载次数: 2

代码说明:

  用全选主元法高斯消去法求解线性方程组AX B(A guauss solver for linear system AX B)

文件列表:

gus
...\ABAND.FOR,1167,2012-09-23

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 347013
    说明:  OPNET 无线仿真 PPT + 源码 好好学习吧(OPNET wireless simulation PPT source code)
    2019-01-04 05:14:51下载
    积分:1
  • control2
    这是一个在控制面板中增加自己软件所需配置属性的源程序。(This is an increase in the control panel software required for their configuration properties of the source.)
    2013-07-01 20:28:56下载
    积分:1
  • Camera_EXG50_GigE
    Initialise and acquisition of Camera EXG50 GigE
    2011-12-20 17:32:53下载
    积分:1
  • DirecteryOption
    模拟终端,和几种目录文件操作的系统命令,dir,cd,md,del等(analog terminal, and several catalog operation of the system commands, dir, cd, md, del etc.)
    2005-05-10 21:37:39下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • Queue
    队列的顺序定义,队列的调用算法等,队列的模板类及其实现(Defined in the order queue, queue calls algorithm, queue template class and its implementation)
    2013-07-17 15:42:54下载
    积分:1
  • versinfo
    class for retrival of executable file and product version information from VERSIONINFO resource in C++
    2012-10-19 00:30:05下载
    积分:1
  • travelingsalesman
    用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正(dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction)
    2005-06-09 15:40:17下载
    积分:1
  • 674569
    PPC开发的代码, 希望我们大家共同努力共同分享,请大家多多指教,互相帮助(PPC development code, I hope we all work together to share, please advise and help each othe)
    2019-01-04 05:55:53下载
    积分:1
  • template
    template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)
    2013-07-15 17:33:53下载
    积分:1
  • 696518资源总数
  • 104313会员总数
  • 30今日下载