代码搜索：伏安法
找到约 10,000 项符合「伏安法」的源代码
代码结果 10,000
www.eeworm.com/read/392750/8328190
txt 牛顿法.txt
syms x1 x2 xk xk2 gk gk2 Gk Gk2 g G i ni zhuan n fx
f=x1^2+x2^2+x1*x2;
g=jacobian(f);
G=jacobian(g);
x1=3;x2=-1;
gk=subs(g);
Gk=subs(G);
i=1
ni=inv(Gk);
n=20;
xk=[3,-1]
ni*gk'
while(n>0.0
www.eeworm.com/read/370779/9586034
c 回溯法.c
#include
#define N 4
int c[N][N];
unsigned int mincost=65535;
int task[N],temp[N],worker[N];
void plan(int k, unsigned int cost)
{
int i;
if (k>=N&&cost
www.eeworm.com/read/367982/9721451
txt 冒泡法.txt
void sort(int A[],int n)
{
int i, j;
int t;
for(i=0; i
www.eeworm.com/read/268899/11115095
fig 等距法.fig
www.eeworm.com/read/146711/12616940
cpp 幂法.cpp
#include
#include
#define N 3
#define EPS 1e-6
#define KM 30
void PowerMethod(float *A)
{
float MaxValue(float *,int );
float U[N],V[N],r2,r1;
float temp;
int i,j,
www.eeworm.com/read/134132/14005003
dsw 回溯法.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/134132/14005006
cpp 回溯法.cpp
#include
#include
#include
#include
#include
using namespace std;
inline int good(int x,int y,int s[30][30],int n)
{
if(x>=0&&x
www.eeworm.com/read/134132/14005009
plg 回溯法.plg
Build Log
--------------------Configuration: 回溯法 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\ADMINI~1\
www.eeworm.com/read/134132/14005011
opt 回溯法.opt
www.eeworm.com/read/134132/14005013