代码搜索:相差法

找到约 10,000 项符合「相差法」的源代码

代码结果 10,000
www.eeworm.com/read/277684/10612588

plg 逐次超松弛法.plg

Build Log --------------------Configuration: 逐次超松弛法 - Win32 Debug-------------------- Command Lines Creating temporary file "C:\DOCUME~1\LINGLI
www.eeworm.com/read/348857/10863182

frm 对分区间法.frm

VERSION 5.00 Begin VB.Form Form24 BackColor = &H00FFFFFF& Caption = "对分区间法" ClientHeight = 8535 ClientLeft = 60 ClientTop = 345 ClientWi
www.eeworm.com/read/348857/10863231

frm 抛物线法.frm

VERSION 5.00 Begin VB.Form Form23 BackColor = &H00FFFFFF& Caption = "抛物线法" ClientHeight = 7605 ClientLeft = 60 ClientTop = 345 ClientWid
www.eeworm.com/read/273924/10894675

cpp dfp变尺度法.cpp

//拟牛顿法(变尺度法)DFP算法的c/c++源码 //问题 minf(x)=100*( x1-x0*x0 )^2 + (1-x0)^2 #include "iostream.h" #include "math.h" #define pi 3.1415926/4 //计算梯度 void comput_grad(double (*pf)(double *x), int n,
www.eeworm.com/read/273924/10894687

obj dfp变尺度法.obj

www.eeworm.com/read/416704/11017522

cpp 牛顿迭代法.cpp

#include #include #define N 100 #define EPS 1e-6 #define ETA 1e-8 void main() { float f(float); float f1(float); float x0,y0; float Newton(float (*)(float),float (*
www.eeworm.com/read/416704/11017528

cpp 改进欧拉法.cpp

#include #define N 20 void ModEuler(float (*f1)(float,float),float x0,float y0,float xn,int n) { int i; float yp,yc,x=x0,y=y0,h=(xn-x0)/n; cout
www.eeworm.com/read/270593/11032276

cpp 回溯法—迷宫问题.cpp

//可解带厅的(8,8)迷宫:刘子杨 //迷宫初始化:无任何要求 //从(1,1)出发,走出迷宫 #include //迷宫图 #define LENGTH 8 int length=0; ///** int maze[8][8] = { {0,0,22,0,22,0,22,22}, {22,0,0,0,0,22,0,22},