-
sijielonggekutafa
四阶龙格库塔法 数值计算 C++源码 可直接运行(Fourth-order Runge-Kutta numerical method C++ source code can be run directly)
- 2015-10-28 19:59:24下载
- 积分：1
-
Q1_code
三角网格以及矩形网格剖分. 实现等参单元以及误差L H 范数收敛阶估计.(Triangular meshes and rectangular meshes are subdivided to achieve convergence order estimation of error L H norm.)
- 2020-06-25 01:40:02下载
- 积分：1
-
code_ista
ista算法，用于最优化求解,迭代收敛，实用小程序(ista algorithm, for the most optimtical problem)
- 2017-12-13 10:12:21下载
- 积分：1
-
grey
说明： 灰色预测模型，对未来数据进行预测，同时还有误差检测(GM(1,1),Grey prediction model, which can forecast future data and detect errors at the same time)
- 2020-06-18 18:00:01下载
- 积分：1
-
NumericalCalEField
书籍工程电磁场数值计算，包括有限差分法、有限元法、矩量法和边界元法以及电磁场的逆问题(Engineering books electromagnetic field numerical calculation, including the inverse problem of the finite difference method, finite element method, the method of moments and the boundary element method, and electromagnetic fields)
- 2012-12-04 21:34:03下载
- 积分：1
-
C-means
说明： C-means in 2 types. C=2
- 2020-06-16 02:00:01下载
- 积分：1
-
UEL_XFEM
用fortran编写的计算水凝胶变形的UEL(Written using fortran calculated deformation of the hydrogel UEL)
- 2011-09-05 11:06:25下载
- 积分：1
-
back-forward-power-flow
对简单开式网前推回代法计算潮流方便，已通过编译，有运行结果(back forward power flow)
- 2013-09-26 10:12:32下载
- 积分：1
-
Crank-Nicolson_
C-N解偏微分方程的程序。解的是定步长的抛物型偏微分方程：
du/dx - a * d2u/dx2 = 0
在程序中可以更改 a 的值以实现不同系数的解。在循环中改变 a 的值以实现变系数. 该说明在压缩包是也有(CN solution of partial differential equations procedures. Solution is scheduled to step parabolic partial differential equation: du/dx- a* d2u/dx2 = 0 in the procedure can be changed in order to realize the value of a different coefficient of the solution. Change in the cycle in order to realize the value of a variable coefficient. The note in the compressed packet is also)
- 2020-11-07 23:09:48下载
- 积分：1
-
An-efficient-augmented-
基于经典的增广拉格朗日乘子法, 对求解一类带有特定结构（主要是针对凸规划）的非光滑等式约束优化问题, 我们提出、分析并测试了一个新算法. 在极小化增广拉格朗日函数的每一步迭代中, 该算法有效结合了带有非单调线性搜索的交替方向技术, 我们建立了算法的收敛性, 并用它来求解在带有全变差正则化的图像恢复问题.(Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of equality-constrained nonsmooth optimization problems (chiefly but not necessarily convex programs) with
a particular structure. The algorithm effectively combines an alternating direction
technique with a nonmonotone line search to minimize the augmented Lagrangian
function at each iteration. We establish convergence for this algorithm, and apply it
to solving problems in image reconstruction with total variation regularization.)
- 2017-01-05 15:54:19下载
- 积分：1
