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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
program slegtrte;
uses
typ,
iom,
sle;
const
m1 = -10;
m2 = 10;
type
array1dr = array[m1..m2] of ArbFloat;
var
k, nex, ex, i, n, term: ArbInt;
ca: ArbFloat;
l, d, u, b, x: array1dr;
begin
Write('program results slegtrte ');
case SizeOf(ArbFloat) of
4: writeln('(single)');
8: writeln('(double)');
6: writeln('(real)');
end;
Read(nex);
writeln;
writeln(' number of examples : ', nex: 2);
for ex := 1 to nex do
begin
writeln;
writeln(' example number :', ex: 2);
writeln;
Read(n, k);
iomrev(input, l[k + 1], n - 1);
iomrev(input, d[k], n);
iomrev(input, u[k], n - 1);
iomrev(input, b[k], n);
slegtr(n, l[k + 1], d[k], u[k], b[k], x[k], ca, term);
writeln;
writeln(' l (lower diagonal of A) = ');
iomwrv(output, l[k + 1], n - 1, numdig);
writeln;
writeln(' d (main diagonal of A) =');
iomwrv(output, d[k], n, numdig);
writeln;
writeln(' u (upper diagonal of A) =');
iomwrv(output, u[k], n - 1, numdig);
writeln;
writeln(' A =');
for i := 1 to n do
begin
if i > 1 then
Write('': (i - 2) * (numdig + 2), l[k + i - 1]: numdig, '': 2);
Write(d[k + i - 1]: numdig, '': 2);
if i < n then
Write(u[k + i - 1]: numdig);
writeln;
end;
writeln;
writeln(' b =');
iomwrv(output, b[k], n, numdig);
writeln;
writeln('term=', term: 2);
case term of
1:
begin
writeln('x=');
iomwrv(output, x[k], n, numdig);
writeln;
writeln(' ca = ', ca: 12);
end;
2: writeln('solution not possible');
3: writeln(' wrong value of n');
end;
writeln('-----------------------------------------------');
end; {example}
Close(input);
Close(output);
end.
program slegtrte;
uses
typ,
iom,
sle;
const
m1 = -10;
m2 = 10;
type
array1dr = array[m1..m2] of ArbFloat;
var
k, nex, ex, i, n, term: ArbInt;
ca: ArbFloat;
l, d, u, b, x: array1dr;
begin
Write('program results slegtrte ');
case SizeOf(ArbFloat) of
4: writeln('(single)');
8: writeln('(double)');
6: writeln('(real)');
end;
Read(nex);
writeln;
writeln(' number of examples : ', nex: 2);
for ex := 1 to nex do
begin
writeln;
writeln(' example number :', ex: 2);
writeln;
Read(n, k);
iomrev(input, l[k + 1], n - 1);
iomrev(input, d[k], n);
iomrev(input, u[k], n - 1);
iomrev(input, b[k], n);
slegtr(n, l[k + 1], d[k], u[k], b[k], x[k], ca, term);
writeln;
writeln(' l (lower diagonal of A) = ');
iomwrv(output, l[k + 1], n - 1, numdig);
writeln;
writeln(' d (main diagonal of A) =');
iomwrv(output, d[k], n, numdig);
writeln;
writeln(' u (upper diagonal of A) =');
iomwrv(output, u[k], n - 1, numdig);
writeln;
writeln(' A =');
for i := 1 to n do
begin
if i > 1 then
Write('': (i - 2) * (numdig + 2), l[k + i - 1]: numdig, '': 2);
Write(d[k + i - 1]: numdig, '': 2);
if i < n then
Write(u[k + i - 1]: numdig);
writeln;
end;
writeln;
writeln(' b =');
iomwrv(output, b[k], n, numdig);
writeln;
writeln('term=', term: 2);
case term of
1:
begin
writeln('x=');
iomwrv(output, x[k], n, numdig);
writeln;
writeln(' ca = ', ca: 12);
end;
2: writeln('solution not possible');
3: writeln(' wrong value of n');
end;
writeln('-----------------------------------------------');
end; {example}
Close(input);
Close(output);
end.
|
