代码搜索:相差法
找到约 10,000 项符合「相差法」的源代码
代码结果 10,000
www.eeworm.com/read/132991/14063816
pdf 分群法.pdf
www.eeworm.com/read/132916/14066251
cpp dfp法.cpp
#include
#include
#include
int const n=2;//正定二次函数的自变量个数
double fun(double x[n],double f_xs[n+n+1+(n-1)*n/2]);//输入变量为函数自变量初值
void Q_fun(double f_xs[n+n+1+(n-1)*n/2],
www.eeworm.com/read/113606/15452386
dsw 追赶法.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/113606/15452387
cpp 追赶法.cpp
#include
#include
#include
void main()
{
int N,i;
coutN;
double *a= new double[N-1];
double *b=new double[N];
doubl
www.eeworm.com/read/107030/15614575
c 排序法.c
#include
#include
struct node
{
int key;
}r[20];
struct rnode
{
int key;
int point;
};
main()
{
void print(struct node a[20],int n);
int creat();
void shell
www.eeworm.com/read/105048/15679431
cpp newton法.cpp
//*************************************
//程序功能:Newton法 求线性方程的解
//
//作 者:杭永东
//
//日 期: 2002.03.28
//*************************************
#include
#include
#incl
www.eeworm.com/read/101253/15839349
c 排序法.c
#include
#include
struct node
{
int key;
}r[20];
struct rnode
{
int key;
int point;
};
main()
{
void print(struct node a[20],int n);
int creat();
void shell
www.eeworm.com/read/100753/15865297
c 排序法.c
#include
#include
struct node
{
int key;
}r[20];
struct rnode
{
int key;
int point;
};
main()
{
void print(struct node a[20],int n);
int creat();
void shell
www.eeworm.com/read/293415/8295261
doc 高斯列主元法消去法.doc
www.eeworm.com/read/373458/9455005
m fun.m
function [f]=fun(x)
f=(x^2-exp(x)+2)/3; %迭代法 斯蒂芬森迭代法
%f=x^2-exp(x)+2-3*x; %牛顿迭代法