网站首页

Runge-kutta

于 2020-12-20 发布文件大小:2KB

 0  125

下载积分: 1 下载次数: 151

我要下载

代码说明：

4阶龙格库塔解二阶微分方程，使用matlab软件编程进行渐进计算。(4th order Runge-Kutta solution of second-order equations)

文件列表：

程序
....\fun2jie.m,82,2013-04-15
....\funfcn2jie.m,32,2013-04-15
....\funfcn2jie2.m,33,2013-04-14
....\RK4erjie.m,1588,2013-04-16
....\ruggekutta2jie.m,358,2013-04-16

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

Rayleigh-wave-exploration-
瑞雷波勘探的书籍，比较清晰的PDF文档，里面含有瑞雷波正演代码，一最小二乘反演代码，对学习瑞雷波非常有帮助。(Rayleigh wave exploration books, clear PDF document, which contains the Rayleigh wave forward code, a least squares inversion code, very helpful for learning Rayleigh wave.)

2013-01-09 18:55:39下载

积分：1
multiplication-table
只是一个课堂上做的九九乘法表，可能很多人做过(Just a class to do multiplication table, many people may have done)

2011-10-21 19:43:24下载

积分：1
fdtd
三维的FDTD实现，采用CPML边界，较为详细的注释(Three-dimensional FDTD using CPML border, more detailed notes)

2013-04-18 14:35:55下载

积分：1
基于傅立叶变换FFT的大规模海面的实现方法
基于傅立叶变换FFT的大规模海面的实现方法(Realization of Large-scale Sea Surface Based on Fourier Transform FFT)

2019-02-15 12:53:25下载

积分：1
Test Operator
对于交错网格上的WCNS格式进行精度测试（不带时间方向推进，仅测试空间精度）(test the order of accuracy of the WCNS scheme)

2020-07-12 18:28:53下载

积分：1
union
This program is used to find the union, intersection and exclusive OR for given two sorted arrays.

2009-04-27 00:48:58下载

积分：1
A-solver-for-1-D-RIEMANN-problem
分别采用Roe格式和AUSM格式求解一维黎曼问题，并将计算结果与解析解进行比较，发现这两种计算格式都能获得高的计算精度。(Roe scheme were used in this procedure and AUSM format to solve a 1-D RIEMANN problem, and numerical results were compared with the analytical solution, the results can be seen from these two formats have a solution with high accuracy.)

2011-11-09 21:44:39下载

积分：1
资料
资料中提供了对应的数据和程序，其中程序能够实现对三维数据的拟合。(It can realize data fitting)

2017-07-05 11:26:21下载

积分：1
shaungtuoqiu
用于焊接模拟的fluent的双椭球体热源UDF程序。(For welding simulation fluent double ellipsoid heat source UDF program.)

2016-03-13 14:38:49下载

积分：1
KFFT
计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)

2013-12-18 22:32:50下载

积分：1

696518资源总数
104269会员总数
31今日下载

Runge-kutta

0 个回复

热门标签

热门下载