代码搜索：ADAMS
找到约 3,572 项符合「ADAMS」的源代码
代码结果 3,572
www.eeworm.com/read/297839/7992903
m adams.m
%admas二步外插法求解微分方程的数值解.
%函数的输入变量为：T为x的取值上限，n为把[0，T]区间等份的数目，u0为方程的初始值
function u=adams(T,n,u0)
h=T/n;
u=[];
u(1)=u0;
u(2)=u(1)+h*f(h,u(1));
for i=2:n-1
u(i+1)=u(i)+(h/2)*(3*f(h*i,u(i))-f(h*(
www.eeworm.com/read/264901/11295136
m adams.m
function [x,y]=Adams(ydot_fun, x0, y0, h, N)
% Adams 预报--校正公式，其中
% ydot_fun --- 一阶微分方程的函数
% x0, y0 --- 初始条件
% h --- 区间步长
% N --- 区间的个数
% x --- Xn 构成的向量
www.eeworm.com/read/400422/11577368
m adams.m
function y = adams(ef, y0, h, a, b)
y(1) = y0;
n = (b - a) / h;
x = a : h : b;
for i = 1 : n
y(i+1) = y(i) + h * feval(ef, x(i), y(i));
y(i+1) = y(i) + h / 2 * (feval(ef, x(i), y(i)) + fe
www.eeworm.com/read/262065/11608259
asv adams.asv
%龙格--库塔公式
function R=adams(f,a,b,ya,N)
%y'=f(x,y)
%a,b左右端点
%N为迭代步长
%h为步长
%ya为初值
h=(b-a)/N;
T=zeros(1,N+1);
Y=zeros(1,N+1);
T=a:h:b;
Y(1)=ya;
for j=1:N
k1=h*feval(f,T(j),Y(j));
k2
www.eeworm.com/read/262065/11608287
m adams.m
%龙格--库塔公式
function R=adams(f,a,b,ya,N)
%y'=f(x,y)
%a,b左右端点
%N为迭代步长
%h为步长
%ya为初值
h=(b-a)/N;
T=zeros(1,N+1);
Y=zeros(1,N+1);
T=a:h:b;
Y(1)=ya;
for j=1:N
k1=h*feval(f,T(j),Y(j));
k2
www.eeworm.com/read/129707/14232124
txt adams.txt
Runge-Kutta:
(0.00,0.000000) True = 0 ERR = 0
(0.05,0.000003) True = 3.1224e-006 ERR = 6.51042e-010
(0.10,0.000050) True = 4.98337e-005 ERR = 2.61418e-009
www.eeworm.com/read/129707/14232125
c adams.c
#include
#include
#define n 20//19 20//17 50
double yi =0;//17 1//19 0
double ai =0;
double bi =1;
double (*True) (double) = NULL;
double ERR=0.0;
double x[n+1]={0},p[
www.eeworm.com/read/119194/14837587
doc adams.doc
www.eeworm.com/read/368554/9689624
m adams.m
1.Adams.m
function [x,y]=Adams(fun,x0,y0,h,N)
x=zeros(1,N+1);y=zeros(1,N+1);
x(1)=x0;y(1)=y0;
c3=0;p3=0;
for n=1:N
x(n+1)=x(n)+h;
if(n
www.eeworm.com/read/269091/11109498
m adams.m
%Adams预报-校正算法
function[x,y]=Adams(fun,x0,y0,N)
h=1/N;
x=zeros(1,N+1);
y=zeros(1,N+1);
x(1)=x0;
y(1)=y0;
delta(1)=0;
for n=1:N
x(n+1)=x(n)+h;
if n