📄 testcholeskysolveunit.pas
字号:
unit testcholeskysolveunit;
interface
uses Math, Ap, Sysutils, cholesky, spdsolve;
function TestCholeskySolve(Silent : Boolean):Boolean;
function testcholeskysolveunit_test_silent():Boolean;
function testcholeskysolveunit_test():Boolean;
implementation
function TestCholeskySolve(Silent : Boolean):Boolean;
var
XE : TReal1DArray;
X : TReal1DArray;
X2 : TReal1DArray;
B : TReal1DArray;
L : TReal2DArray;
A : TReal2DArray;
N : Integer;
Pass : Integer;
I : Integer;
J : Integer;
K : Integer;
MinIJ : Integer;
UpperIn : Boolean;
V : Double;
Err : Double;
Fails : Boolean;
WasErrors : Boolean;
PassCount : Integer;
MaxN : Integer;
HTask : Integer;
Threshold : Double;
i_ : Integer;
begin
Err := 0;
PassCount := 10;
MaxN := 20;
Threshold := 100000*MachineEpsilon;
WasErrors := False;
Fails := False;
//
// Test
//
N:=1;
while N<=MaxN do
begin
SetLength(A, N-1+1, N-1+1);
SetLength(L, N-1+1, N-1+1);
SetLength(X, N-1+1);
SetLength(X2, N-1+1);
SetLength(XE, N-1+1);
SetLength(B, N-1+1);
HTask:=0;
while HTask<=1 do
begin
Pass:=1;
while Pass<=PassCount do
begin
UpperIn := HTask=0;
//
// init L
//
I:=0;
while I<=N-1 do
begin
J:=I+1;
while J<=N-1 do
begin
L[I,J] := RandomReal;
L[J,I] := L[I,J];
Inc(J);
end;
L[I,I] := 1.1+RandomReal;
Inc(I);
end;
//
// init A, B, XE
//
I:=0;
while I<=N-1 do
begin
J:=0;
while J<=N-1 do
begin
MinIJ := Min(I, J);
V := 0.0;
for i_ := 0 to MinIJ do
begin
V := V + L[I,i_]*L[i_,J];
end;
A[I,J] := V;
A[J,I] := V;
Inc(J);
end;
Inc(I);
end;
I:=0;
while I<=N-1 do
begin
XE[I] := 2*RandomReal-1;
Inc(I);
end;
I:=0;
while I<=N-1 do
begin
V := APVDotProduct(@A[I][0], 0, N-1, @XE[0], 0, N-1);
B[I] := V;
Inc(I);
end;
I:=0;
while I<=N-1 do
begin
J:=0;
while J<=N-1 do
begin
if UpperIn then
begin
if J<I then
begin
L[I,J] := 0;
A[I,J] := 0;
end;
end
else
begin
if I<J then
begin
L[I,J] := 0;
A[I,J] := 0;
end;
end;
Inc(J);
end;
Inc(I);
end;
//
// solution
//
if not SPDMatrixCholeskySolve(L, B, N, UpperIn, X) then
begin
Fails := True;
Inc(Pass);
Continue;
end;
if not SPDMatrixSolve(A, B, N, UpperIn, X2) then
begin
Fails := True;
Inc(Pass);
Continue;
end;
//
// test
//
I:=0;
while I<=N-1 do
begin
err := Max(err, AbsReal(X[I]-XE[I]));
Inc(I);
end;
I:=0;
while I<=N-1 do
begin
err := Max(err, AbsReal(X2[I]-XE[I]));
Inc(I);
end;
Inc(Pass);
end;
Inc(HTask);
end;
Inc(N);
end;
//
// report
//
WasErrors := Fails or (Err>Threshold);
if not Silent then
begin
Write(Format('TESTING CHOLESKY SOLVER'#13#10'',[]));
Write(Format('ERROR: %5.4e'#13#10'',[
Err]));
Write(Format('UNEXPECTED FAIL OR SUCCESS: ',[]));
if Fails then
begin
Write(Format('OCCURED'#13#10'',[]));
end
else
begin
Write(Format('NONE'#13#10'',[]));
end;
if WasErrors then
begin
Write(Format('TEST FAILED'#13#10'',[]));
end
else
begin
Write(Format('TEST PASSED'#13#10'',[]));
end;
Write(Format(''#13#10''#13#10'',[]));
end;
Result := not WasErrors;
end;
(*************************************************************************
Silent unit test
*************************************************************************)
function testcholeskysolveunit_test_silent():Boolean;
begin
Result := TestCholeskySolve(True);
end;
(*************************************************************************
Unit test
*************************************************************************)
function testcholeskysolveunit_test():Boolean;
begin
Result := TestCholeskySolve(False);
end;
end.
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -