testldltsolveunit.pas

maths lib with source

unit testldltsolveunit;
interface
uses Math, Ap, Sysutils, ldlt, ssolve;

function TestLDLTSolve(Silent : Boolean):Boolean;
function testldltsolveunit_test_silent():Boolean;
function testldltsolveunit_test():Boolean;

implementation

procedure GenerateMatrix(var A : TReal2DArray;
     N : Integer;
     Task : Integer);forward;


function TestLDLTSolve(Silent : Boolean):Boolean;
var
    A : TReal2DArray;
    A2 : TReal2DArray;
    A3 : TReal2DArray;
    XE : TReal1DArray;
    X : TReal1DArray;
    B : TReal1DArray;
    P : TInteger1DArray;
    N : Integer;
    Pass : Integer;
    MTask : Integer;
    I : Integer;
    J : Integer;
    K : Integer;
    MinIJ : Integer;
    UpperIn : Boolean;
    CR : Boolean;
    V : Double;
    Err : Double;
    Fails : Boolean;
    WasErrors : Boolean;
    PassCount : Integer;
    MaxN : Integer;
    HTask : Integer;
    Threshold : Double;
begin
    Err := 0;
    PassCount := 100;
    MaxN := 20;
    Threshold := 10000000*MachineEpsilon;
    WasErrors := False;
    Fails := False;
    
    //
    // Test
    //
    N:=1;
    while N<=MaxN do
    begin
        SetLength(A, N-1+1, N-1+1);
        SetLength(A2, N-1+1, N-1+1);
        SetLength(A3, N-1+1, N-1+1);
        SetLength(XE, N-1+1);
        SetLength(X, N-1+1);
        SetLength(B, N-1+1);
        MTask:=2;
        while MTask<=2 do
        begin
            HTask:=0;
            while HTask<=1 do
            begin
                Pass:=1;
                while Pass<=PassCount do
                begin
                    UpperIn := HTask=0;
                    
                    //
                    // Prepare task:
                    // * A contains symmetric matrix
                    // * A2, A3 contains its upper (or lower) half
                    //
                    GenerateMatrix(A, N, MTask);
                    I:=0;
                    while I<=N-1 do
                    begin
                        J:=0;
                        while J<=N-1 do
                        begin
                            A2[I,J] := A[I,J];
                            A3[I,J] := A[I,J];
                            Inc(J);
                        end;
                        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
                                    A2[I,J] := 0;
                                    A3[I,J] := 0;
                                end;
                            end
                            else
                            begin
                                if I<J then
                                begin
                                    A2[I,J] := 0;
                                    A3[I,J] := 0;
                                end;
                            end;
                            Inc(J);
                        end;
                        Inc(I);
                    end;
                    
                    //
                    // Prepare XE, B
                    //
                    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;
                    
                    //
                    // solve(A):
                    // 1. MTask=0 means zero matrix, must always fail
                    // 2. MTask=1 means sparse matrix, can fail, can succeed
                    // 3. MTask=2 means dense matrix, must succeed
                    //
                    SetLength(X, 0+1);
                    CR := SMatrixSolve(A2, B, N, UpperIn, X);
                    if MTask=0 then
                    begin
                        Fails := Fails or CR;
                    end;
                    if MTask=1 then
                    begin
                        if CR then
                        begin
                            I:=0;
                            while I<=N-1 do
                            begin
                                Err := Max(Err, AbsReal(X[I]-XE[I]));
                                Inc(I);
                            end;
                        end;
                    end;
                    if MTask=2 then
                    begin
                        if CR then
                        begin
                            I:=0;
                            while I<=N-1 do
                            begin
                                Err := Max(Err, AbsReal(X[I]-XE[I]));
                                Inc(I);
                            end;
                        end
                        else
                        begin
                            Fails := True;
                        end;
                    end;
                    
                    //
                    // solve(LDLT(A)):
                    // 1. MTask=0 means zero matrix, must always fail
                    // 2. MTask=1 means sparse matrix, can fail, can succeed
                    // 3. MTask=2 means dense matrix, must succeed
                    //
                    SetLength(X, 0+1);
                    SMatrixLDLT(A3, N, UpperIn, P);
                    CR := SMatrixLDLTSolve(A3, P, B, N, UpperIn, X);
                    if MTask=0 then
                    begin
                        Fails := Fails or CR;
                    end;
                    if MTask=1 then
                    begin
                        if CR then
                        begin
                            I:=0;
                            while I<=N-1 do
                            begin
                                Err := Max(Err, AbsReal(X[I]-XE[I]));
                                Inc(I);
                            end;
                        end;
                    end;
                    if MTask=2 then
                    begin
                        if CR then
                        begin
                            I:=0;
                            while I<=N-1 do
                            begin
                                Err := Max(Err, AbsReal(X[I]-XE[I]));
                                Inc(I);
                            end;
                        end
                        else
                        begin
                            Fails := True;
                        end;
                    end;
                    Inc(Pass);
                end;
                Inc(HTask);
            end;
            Inc(MTask);
        end;
        Inc(N);
    end;
    
    //
    // report
    //
    WasErrors := Fails or (Err>Threshold);
    if  not Silent then
    begin
        Write(Format('TESTING LDLT 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;


procedure GenerateMatrix(var A : TReal2DArray; N : Integer; Task : Integer);
var
    I : Integer;
    J : Integer;
begin
    if Task=0 then
    begin
        
        //
        // Zero matrix
        //
        I:=0;
        while I<=N-1 do
        begin
            J:=0;
            while J<=N-1 do
            begin
                A[I,J] := 0;
                Inc(J);
            end;
            Inc(I);
        end;
    end;
    if Task=1 then
    begin
        
        //
        // Sparse matrix
        //
        I:=0;
        while I<=N-1 do
        begin
            J:=I+1;
            while J<=N-1 do
            begin
                if RandomReal>0.95 then
                begin
                    A[I,J] := 2*RandomReal-1;
                end
                else
                begin
                    A[I,J] := 0;
                end;
                A[J,I] := A[I,J];
                Inc(J);
            end;
            if RandomReal>0.95 then
            begin
                A[I,I] := (2*RandomInteger(2)-1)*(0.8+RandomReal);
            end
            else
            begin
                A[I,I] := 0;
            end;
            Inc(I);
        end;
    end;
    if Task=2 then
    begin
        
        //
        // Dense matrix
        //
        I:=0;
        while I<=N-1 do
        begin
            J:=I+1;
            while J<=N-1 do
            begin
                A[I,J] := 2*RandomReal-1;
                A[J,I] := A[I,J];
                Inc(J);
            end;
            A[I,I] := (2*RandomInteger(2)-1)*(0.8+RandomReal);
            Inc(I);
        end;
    end;
end;


(*************************************************************************
Silent unit test
*************************************************************************)
function testldltsolveunit_test_silent():Boolean;
begin
    Result := TestLDLTSolve(True);
end;


(*************************************************************************
Unit test
*************************************************************************)
function testldltsolveunit_test():Boolean;
begin
    Result := TestLDLTSolve(False);
end;


end.