登录
首页 » Fortran » jacobi

jacobi

于 2013-10-26 发布 文件大小:1KB
0 178
下载积分: 1 下载次数: 4

代码说明:

  对于方程组AX=b,当系数矩阵非奇异时,对原方程进行改写,利用公式X^k=BX^(k+1)+g进行迭代求解。(For equations AX = b, when the coefficient matrix is ​ ​ nonsingular, rewriting the original equation, using the formula X ^ k = BX ^ (k+1)+g for iterative solution.)

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

发表评论

0 个回复

  • uniFiber
    说明:  Abaqus复合材料Hashin失效子程序(Failure subroutine of Hashin for ABAQUS composite)
    2020-02-22 15:29:35下载
    积分:1
  • InToPost
    INfix to postfix implementation in java
    2010-10-10 15:36:06下载
    积分:1
  • bchcode
    实现了bch编码,基于有限域多项式除法,自己动手写的,大家可以看下(Based on division in galois field,relize the BCH code )
    2013-07-25 10:27:37下载
    积分:1
  • graphAnalysis
    该文件是用matlab开发的图论分析工具箱, 里面有使用时的详细说明,pdf说明文档。 绝对实用对于图论的研究者(The document was developed with matlab graph theory analysis toolbox, which are used when a detailed explanation, pdf documentation. Absolutely useful for researchers in graph theory)
    2008-12-31 13:20:25下载
    积分:1
  • Count
    说明:  输入任意数学四则运算表达式可以得出结果,很方便很实用的一个程序的源代码。(you can get the answer.)
    2010-04-23 19:51:08下载
    积分:1
  • 1DSIMPLE
    一维SIMPLE算法,fortran语言交错网格算例,包含主程序和用户程序。(2D SIMPLE algorithm example Picks)
    2021-01-26 10:58:36下载
    积分:1
  • MMA
    说明:  拓扑优化MMA算法从空间的一个初始设计点出发,沿着某个搜索方向以适当步长的迭代格式 ,实现对设计变量的修改,以获得的值。(Starting from an initial design point in space, the topology optimization MMA algorithm modifies the design variables in an appropriate iterative format along a certain search direction to obtain the optimal value)
    2021-02-04 12:14:39下载
    积分:1
  • allan
    通过matlab计算allan variance,较为复杂,注释详细(Matlab Allan variance, more complex, detailed notes)
    2020-10-16 19:17:28下载
    积分:1
  • CUDAMatrixMul
    说明:  cuda矩阵乘法 通过GPU并行运算实现乘法的加速(cuda GPU parallel matrix multiplication operation by the accelerated realization of multiplication)
    2020-12-13 21:49:14下载
    积分:1
  • Soct
    假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品,能否从n件物品中挑选若干件恰好装满背包,即使w1 +w2 + … + wn=T,要求找出所有满足上述条件的解。例如:当T=10,各件物品的体积{1,8,4,3,5,2}时,可找到下列4组解:(1,4,3,2),(1,4,5),(8,2),(3,5,2)。 [需求分析](Suppose there are a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+w2+ ...+ wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])
    2012-06-14 16:25:10下载
    积分:1
  • 696518资源总数
  • 105549会员总数
  • 12今日下载