Решение обратной задачи вихретокового контроля
Uer[ i ]:=ur; {we need it for dU}
Uei[ i ]:=ui;
Fh[1,i] := SQR( ur-Umr[i] ) + SQR( ui-Umi[i] );
end;
{Right:U'(i)= (U(i+1)-U(i))/h}
1 : for i:=1 to mCur do {get dF/dSI[i] value}
begin
Rgt:=Rg[i]*( 1+incVal ); {si[i]=si[i]+dsi[i]}
setApproximationItem( Rgt, i ); {set new si[i] value}
for j:=1 to nFreqs do
begin {get dUr/dSI,dUi/dSI}
getVoltage( freqs[ j ], ur, ui );
dur:=( ur-Uer[j] )/( Rg[i]*incVal );
dui:=( ui-Uei[j] )/( Rg[i]*incVal );
Fh[i,j]:=2*(dur*(Uer[j]-Umr[j])+dui*(Uei[j]-Umi[j]));
end;
setApproximationItem( Rg[i], i ); {restore si[i] value}
end;
{Central:U'(i)= (U(i+1)-U(i-1))/2h}
2 : for i:=1 to mCur do {get dF/dSI[i] value}
begin
Rgt:=Rg[i]*( 1+incVal ); {si[i]=si[i]+dsi[i]}
setApproximationItem( Rgt, i ); {set new si[i] value}
for j:=1 to nFreqs do getVoltage( freqs[j],ur2[j],ui2[j] );
Rgt:=Rg[i]*( 1-incVal ); {si[i]=si[i]-dsi[i]}
setApproximationItem( Rgt, i ); {set new si[i] value}
for j:=1 to nFreqs do
begin {get dUr/dSI,dUi/dSI}
getVoltage( freqs[ j ], ur, ui );
dur:=( ur2[j]-ur )/( 2*Rg[i]*incVal );
dui:=( ui2[j]-ui )/( 2*Rg[i]*incVal );
Fh[i,j]:=2*(dur*(Uer[j]-Umr[j])+dui*(Uei[j]-Umi[j]));
end;
setApproximationItem( Rg[i], i ); {restore si[i] value}
end;
end;
setApproximationData( si , k );
end;
procedure doMinimization;
const
mp1Max = maxPAR + 1;
mp2Max = maxPAR + 2;
m2Max = 2*( maxPAR + maxFUN );
m21Max = m2Max + 1;
n2Max = 2*maxFUN;
m1Max = maxPAR + n2Max;
n1Max = n2Max + 1;
mm1Max = maxPAR + n1Max;
minDh : real = 0.001; {criterion of an exit from golden section method}
var
A : array [ 1 .. m1Max , 1 .. m21Max ] of real;
B : array [ 1 .. m1Max] of real;
Sx: array [ 1 .. m21Max] of real;
Zt: array [ 1 .. maxPAR] of real;
Nb: array [ 1 .. m1Max] of integer;
N0: array [ 1 .. m21Max] of integer;
a1, a2, dh, r, tt, tp, tl, cv, cv1, cl, cp : real;
n2, n1, mp1, mp2, mm1, m1, m2, m21 : integer;
ain : real;
apn : real;
iq : integer;
k1 : integer;
n11 : integer;
ip : integer;
iterI : integer;
i,j,k : integer;
label
102 ,103 ,104 ,105 ,106 ,107 ,108;
begin
n2:=2*nFreqs; n1:=n2+1; m1:=mCur+n2;
mp1:=mCur+1; mp2:=mCur+2; mm1:=mCur+n1;
m2:=2*( mCur+nFreqs ); m21:=m2+1;
for k:=1 to m1Max do
for i:=1 to m21Max do
A[k,i]:=0;
iterI:=0;
102:
iterI:=iterI+1;
getFunctional( 0 );
for i:=1 to nFreqs do b[i]:= -Fh[1,i];
getFunctional( derivType );
for k:=1 to mCur do
begin
Zt[k]:=Rg[k];
for i:=1 to nFreqs do
begin
A[i,k+1]:=Fh[k,i];
A[i+nFreqs,k+1]:=-A[i,k+1];
end;
for i:=1 to nFreqs do B[i]:=B[i]+Rg[k]*A[i,k+1];
end;
for i:=1 to nFreqs do B[i+nFreqs]:=-B[i];
for i:=n1 to m1 do B[i]:=Gr[1,i-n2]-Gr[2,i-n2];
for i:=1 to m1 do
begin
if i<=n2 then
for k:=2 to mp1 do B[i]:=B[i]-A[i,k]*Gr[2,k-1];
A[i,1]:=-1;
if i>n2 then
begin
A[i,1]:=0;
for k:=2 to mp1 do
if i-n2=k-1 then A[i,k]:=1
else A[i,k]:=0;
end;
for k:=mp2 to m21 do
if k-mp1=i then A[i,k]:=1
else A[i,k]:=0;
end;
k1:=1;
for k:=1 to n2 do
if B[k1]>B[k] then k1:=k;
for k:=1 to mp1 do A[k1,k]:=-A[k1,k];
A[k1,mCur+1+k1]:=0;
B[k1]:=-B[k1];
for i:=1 to n2 do
if i<>k1 then
begin
B[i]:=B[i]+B[k1];
for k:=1 to mm1 do A[i,k]:=A[i,k]+A[k1,k];
end;
for i:=mp2 to m21 do
begin
Sx[i]:=B[i-mp1];
Nb[i-mp1]:=i;
end;
for i:=1 to mp1 do Sx[i]:=0;
Sx[1]:=B[k1];
Sx[mp1+k1]:=0;
Nb[k1]:=1;
103:
for i:=2 to m21 do N0[i]:=0;