代码搜索：相差法
找到约 10,000 项符合「相差法」的源代码
代码结果 10,000
www.eeworm.com/read/138305/13241753
doc svpwm(硬件法)程序.doc
www.eeworm.com/read/138304/13241763
doc svpwm（软件法）程序.doc
www.eeworm.com/read/323538/13337024
doc 付格尔法.doc
www.eeworm.com/read/323486/13339003
exe 线性单纯型法.exe
www.eeworm.com/read/323401/13341247
dst 词根记忆法.dst
agriculture['9grik3lt62]n.农业，农艺；农学
agricultural[9gri'k3lt62r2l]a. 农业的
agriculturist[]n.农学家
agrimotor['9grimout2]n. 农耕用拖拉机
agronomy[2'gr0n2mi]n. 农艺学,农学
agronomic[9gr2'n0mik]a. 农艺学的,农事的
agrology[2
www.eeworm.com/read/322875/13362726
cpp seidel迭代法.cpp
#include
#include
double d(double *x,double *x0,int n) //求范数
{
double m=0;
for(int i=0;i
www.eeworm.com/read/311771/13626533
c 排列数(冒泡法).c
#include /*此头函数请不要删除 */
#include
main()
{ int a[10],i,j,t;
printf("Please enter data:\n");
for(i=0;i
www.eeworm.com/read/305001/13780593
txt steffensen迭代法.txt
Steffensen迭代法：
#include
#include
#include
double Steffensen(double);
int main()
{
cout
www.eeworm.com/read/304457/13793873
txt meller-幂法.txt
#include
#include
#include
using namespace std;
#define N 3
//矩阵与向量相乘
/*void fun(float a[N][N],float u[N])
{
for(int i=0;i
www.eeworm.com/read/303462/13815821
cpp lagrange插值法.cpp
#include
#include
void main( )
{
int n,i,j;
float * x, * y, xWant, LI, PN = 0;
printf("请输入结点个数\nN="); //输入结点个数
scanf("%d", &n);
x = (float *)malloc(n * sizeof