登录
首页 » Java » Spline3

Spline3

于 2020-12-02 发布 文件大小:3KB
0 336
下载积分: 1 下载次数: 55

代码说明:

  三次样条插值函数实现 运行后画出曲线图,并得到插值函数表达式。(spline3)

文件列表:

readme.txt
Spline.java

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

发表评论

0 个回复

  • CCS
    求解转子系统前三个临界转速和主振型的传递矩阵法 (Calculation of critical speed)
    2009-03-23 15:39:59下载
    积分:1
  • jisuanqi
    一个计算器,实现加减乘除等,适合初学者学习,代码很全,自己写的。(A calculator to realize, Math, etc., suitable for beginners to learn, the code is all that he wrote.)
    2011-07-10 12:38:30下载
    积分:1
  • 最小二乘法拟合程序
    最小二乘拟合的matlab程序,用于数据处理。简单,易懂(The least squares fitting matlab program for data processing.Simple, easy to understand)
    2018-04-10 16:52:13下载
    积分:1
  • quadrotorsimplesuper
    一个自己弄的四旋翼的非线性动力学模型的m文件(nonliner model for quadrotor)
    2014-12-26 23:15:18下载
    积分:1
  • FFbp
    Training a 3 layers feed forward neural network using back propagation algorithm
    2011-11-24 02:38:11下载
    积分:1
  • convection and diffusion-allscheme_fortran
    二维对流扩散问题的各种求解方法结果的比较,采用有限体积法(Two-dimensional unsteady heat diffusion and convection equation and finite volume fortran program)
    2018-06-19 09:06:10下载
    积分:1
  • zichengxu001
    复合材料破坏失效vumat子程序,使用hsshin准则判断失效,具有刚度缩减,(The VUMAT subroutine for failure of composite materials is judged by hsshin criterion, and stiffness is reduced.)
    2018-05-20 11:52:14下载
    积分:1
  • ABAQUS计算多相材料的前处理器 voronoi
    有关ABAQUS计算多相材料的前处理器,包括网格划分及区域划分(ABAQUS calculation of multiphase material about previous processors, including mesh and zoning)
    2017-03-11 22:13:58下载
    积分:1
  • chazhi
    各种插值算法,高斯插值算法,线性插值算法,牛顿插值法,哈米特矩阵插值算法(Various interpolation algorithm, the Gaussian interpolation algorithm, linear interpolation algorithm, Newton interpolation, Hammett matrix interpolation algorithm)
    2012-09-03 18:37:48下载
    积分:1
  • 单纯形法Matlab程序-2016-11-17
    一般线性规划问题具有线性方程组的变量数大于方程个数,这时会有不定的解。当决策变量个数n和约束条件个数m较大时,单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形,每一个单纯形可以求得一组解,然后再判断该解使目标函数值是增大还是变小了,决定下一步选择的单纯形。通过优化迭代,直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
    2018-03-27 17:22:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载