//龙贝格积分
procedure QROMB(A, B,miu,xi:real; var SS:real);
CONST
EPS = 0.000001; JMAX = 20;
VAR
S,H:ARRAY[0..21] of real;
JMAXP,J,K,KM:integer; DSS:real;
begin
JMAXP:=JMAX + 1;//何用??????????
K:=5;
KM:=K - 1;//何用??????????????
H[1]:=1;
For J:=1 To JMAX do
begin
TRAPZD(A, B,miu,xi, S[J], J);
If J >= K Then
begin
POLINT(H, S, K, 0, SS, DSS);
If (AbS(DSS) < (EPS * Abs(SS))) Then Exit;
end;
S[J + 1]:=S[J];
H[J + 1]:=0.25 * H[J];
end;
ShowMessage('Too many steps.');//没有规定循环次数啊,这个干吗的????
end;
delphi常用数值算法集中133页的龙贝格积分是不是有问题啊?
- 写回答
- 好问题 0 提建议
- 追加酬金
- 关注问题
- 邀请回答
-