summaryrefslogtreecommitdiff
path: root/fpcsrc/packages/numlib/tests/sleglste.pas
blob: 0eaf43053dd2258c62ef85396f10218c63aa9e70 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
program sleglste;

uses
  typ,
  iom,
  omv,
  sle;

const
  k1  = -20;
  k2  = 20;
  l1  = -10;
  l2  = 10;
  r1  = -10;
  r2  = 18;
  v1  = -8;
  v2  = 18;
  rwa = l2 - l1 + 1;
var
  ex, nv, i, m, n, term, k, l, r, v: ArbInt;
  a:    array[k1..k2, l1..l2] of ArbFloat;
  b, e: array[r1..r2] of ArbFloat;
  x:    array[v1..v2] of ArbFloat;
begin
  Write('program results sleglste ');
  case SizeOf(ArbFloat) of
    4: writeln('(single)');
    8: writeln('(double)');
    6: writeln('(real)');
  end;
  Read(nv);
  writeln;
  writeln(' number of examples: ', nv: 2);
  for ex := 1 to nv do
  begin
    writeln;
    writeln('  example number :', ex: 2);
    Read(k, l, r, v, m, n);
    iomrem(input, a[k, l], m, n, rwa);
    iomrev(input, b[r], m);
    slegls(a[k, l], m, n, rwa, b[r], x[v], term);
    writeln;
    writeln(' A =');
    iomwrm(output, a[k, l], m, n, rwa, numdig);
    writeln;
    writeln(' b =');
    iomwrv(output, b[r], m, numdig);
    writeln;
    writeln(' term=', term: 2);
    case term of
      1:
      begin
        writeln;
        writeln(' x =');
        iomwrv(output, x[v], n, numdig);
        writeln;
        writeln(' Ax - b =');
        omvmmv(a[k, l], m, n, rwa, x[v], e[r]);
        for i := 1 to m do
          e[r - 1 + i] := e[r - 1 + i] - b[r - 1 + i];
        iomwrv(output, e[r], m, numdig);
      end;
      2: writeln(' A is (nearly) singular');
      3: writeln('wrong input (n<1 or m<n)')
    end;
    writeln(' -------------------------------------------');
  end;
end.
program sleglste;

uses
  typ,
  iom,
  omv,
  sle;

const
  k1  = -20;
  k2  = 20;
  l1  = -10;
  l2  = 10;
  r1  = -10;
  r2  = 18;
  v1  = -8;
  v2  = 18;
  rwa = l2 - l1 + 1;
var
  ex, nv, i, m, n, term, k, l, r, v: ArbInt;
  a:    array[k1..k2, l1..l2] of ArbFloat;
  b, e: array[r1..r2] of ArbFloat;
  x:    array[v1..v2] of ArbFloat;
begin
  Write('program results sleglste ');
  case SizeOf(ArbFloat) of
    4: writeln('(single)');
    8: writeln('(double)');
    6: writeln('(real)');
  end;
  Read(nv);
  writeln;
  writeln(' number of examples: ', nv: 2);
  for ex := 1 to nv do
  begin
    writeln;
    writeln('  example number :', ex: 2);
    Read(k, l, r, v, m, n);
    iomrem(input, a[k, l], m, n, rwa);
    iomrev(input, b[r], m);
    slegls(a[k, l], m, n, rwa, b[r], x[v], term);
    writeln;
    writeln(' A =');
    iomwrm(output, a[k, l], m, n, rwa, numdig);
    writeln;
    writeln(' b =');
    iomwrv(output, b[r], m, numdig);
    writeln;
    writeln(' term=', term: 2);
    case term of
      1:
      begin
        writeln;
        writeln(' x =');
        iomwrv(output, x[v], n, numdig);
        writeln;
        writeln(' Ax - b =');
        omvmmv(a[k, l], m, n, rwa, x[v], e[r]);
        for i := 1 to m do
          e[r - 1 + i] := e[r - 1 + i] - b[r - 1 + i];
        iomwrv(output, e[r], m, numdig);
      end;
      2: writeln(' A is (nearly) singular');
      3: writeln('wrong input (n<1 or m<n)')
    end;
    writeln(' -------------------------------------------');
  end;
end.