登录
首页 » 算法 » ! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonline...

! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonline...

于 2022-07-21 发布 文件大小:128.67 kB
0 66
下载积分: 2 下载次数: 1

代码说明:

! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonlinear 3 ! systems of equations by homotopy methods. There are subroutines for 4 ! fixed point, zero finding, and general homotopy curve tracking problems, 5 ! utilizing both dense and sparse Jacobian matrices, and implementing 6 ! three different algorithms: ODE-based, normal flow, and augmented 7 ! Jacobian. The (driver) subroutines called by the user are given in the 8 ! table below, and are well documented internally. The user need not 9 ! be concerned with any other subroutines in HOMPACK90. -! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonlinear 3 ! systems of equations by homotopy methods. There are subroutines for 4 ! fixed point, zero finding, and general homotopy curve tracking problems, 5 ! utilizing both dense and sparse Jacobian matrices, and implementing 6 ! three different algorithms: ODE-based, normal flow, and augmented 7 ! Jac

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

发表评论

0 个回复

  • 卡尔曼跟踪
    kalman tracking a ba
    2022-08-08 11:21:35下载
    积分:1
  • 8puzzle程序的人工智能
    此代码程序解决当然人工智者。用C++编程语言,并采用广度优先搜索方法遍历所有图形,并找到可能的路径此代码。
    2022-08-06 13:35:31下载
    积分:1
  • OPENTLD C++ source code
    TLD is an algorithm for tracking of unknown objects in unconstrained video streams. The object of interest is defined by a bounding box in a single frame. TLD simultaneously tracks the object, learns its appearance and detects it whenever it appears in the video. You are allowed to use TLD under the terms of the GPL version 3.0. It means that any distributed project that includes or links any portion of TLD source code has to be released with the source code under the GPL version 3.0 license or later. The details of the license can be found in file LICENSE. If you wish to use this code or any of its part for com
    2022-06-17 10:16:04下载
    积分:1
  • CROUT REDUTION ALGORITHM
    &求解N乘N线性系统
    2022-02-06 19:18:05下载
    积分:1
  • C6713实验实例
    用于C6713开发版的实验实例 
    2022-08-03 19:46:17下载
    积分:1
  • 数据挖掘ID3的实现
    数据挖掘决策树的实现,使用ID3算法编写,本程序是对数据挖掘概念与技术(第三版)中分类算法的实现。主要采用C++ STL(标准模版库)进行编写,运行时需要把samples.txt文件拷贝到C盘根目录下。
    2022-03-10 21:08:35下载
    积分:1
  • 基本矩阵运 : +
    基本矩阵运算 : + - *, power, transpose, trace, determinant, minor, matrix of minor, cofactor, matrix of cofactor, adjoint, inverse, gauss, gaussjordan, linear transformation, LU decomposition , Gram-Schmidt process, similarity. b) Basic vectors functions : norm, distance, innerproduct,coldim, rowdim, rank, nullity. *-basic matrix calculation :-*, power, transpose, trace, determinant, minor, matrix of minor, cofactor, the matrix of cofactor, adjoint, inverse, Gauss, gaussjordan, linear transformation, LU decomposition, Gram-Schmidt process, the similarity. B ) Basic vectors functions : norm, distance, innerproduct, coldim, rowdim, rank, nullity.*
    2022-07-09 08:21:12下载
    积分:1
  • 自定义一些x,y坐标,可以模拟出一些光滑的曲线
    自定义一些x,y坐标,可以模拟出一些光滑的曲线-x, y coordinates, and can simulate some smooth curve
    2022-03-16 00:11:45下载
    积分:1
  • 98年全国大学生数学建模竞赛B题"水灾巡视问题"模拟退火。...
    98年全国大学生数学建模竞赛B题"水灾巡视问题"模拟退火算法。-98 National Mathematical Contest in Modeling B and that the "flood inspections" simulated annealing.
    2022-07-05 03:34:32下载
    积分:1
  • 独立钻石棋问题描述: 有一棋盘, 上有44个钻石棋子,有一位置空缺, 棋盘初始状态如下:    111    111    111 111111111 1111...
    独立钻石棋问题描述: 有一棋盘, 上有44个钻石棋子,有一位置空缺, 棋盘初始状态如下:    111    111    111 111111111 111101111 111111111    111    111    111 其中,0表示没有放置棋子, 1表示放置。 规定走法如下: a. 任一棋子可越过一相邻棋子(紧相邻)跳到一空缺位置, 并吃掉越过的棋子(从棋盘移处) 如, 走一步后棋盘状态:    111    111    111 111111111 111110011 111111111    111    111    111 b. 最后只留下一个棋子在棋盘上, 并且位置在正中央。 要求: 用程序得出正确走法。 输入: 无 输出: 每一步移动后的棋盘状态, 格式如上。-independent diamond chess Problem description : a chessboard, there are 44 pieces of diamonds, a position vacant chessboard initial state as follows : 111111111 111101111 111111111 which, 0 no place pawn, a place said. Provisions in law are as follows : a. as a pawn to be crossed an adjacent piece (bear adjacent) jumped to a vacant position, and eaten across the pawn (shift from the chessboard) If, after the chessboard go one step further state : 111111111 111111111 111110011 111111111 111111111 b. leaving only a game son on the chessboard, and in the middle position. Requirements : getting the correct procedures in law. Input : None output : e
    2023-01-15 08:55:03下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载