qromo.txt

来自「1.梯形求积法 2.辛普森求积法 3.龙贝格求积法 4.反常积分 5.高」· 文本 代码 · 共 26 行

procedure QROMO(A, B:real;var SS:real; PICK:string);
const
    EPS = 0.00003;    JMAX = 14;
    K = 7;
var
    S, H:array[0..15] of real;
    JMAXP,J:integer;
    DSS:real;
begin
    H[1]:=1;
    For J:=1 To JMAX do
    begin
        If PICK = 'MIDPNT' Then  MIDPNT(A, B, S[J], J);
        If PICK = 'MIDINF' Then  MIDINF(A, B, S[J], J);
        If PICK = 'MIDSQL' Then  MIDSQL(A, B, S[J], J);
        If PICK = 'MIDSQU' Then  MIDSQU(A, B, 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]:=H[J] / 9;
    end;
    ShowMessage('Too many steps.');
end;