0
|
1 |
#======================================================================
|
|
2 |
# M R Q M I N . P L
|
|
3 |
# doc: Wed Feb 24 15:10:22 1999
|
|
4 |
# dlm: Tue Aug 22 22:05:43 2006
|
|
5 |
# (c) 1999 A.M. Thurnherr
|
|
6 |
# uE-Info: 15 67 NIL 0 0 72 2 2 4 NIL ofnI
|
|
7 |
#======================================================================
|
|
8 |
|
|
9 |
# MRQMIN routine from Numerical Recipes adapted to ANTS
|
|
10 |
# NB: based on 1st edtion of NR!!!!
|
|
11 |
|
|
12 |
# HISTORY:
|
|
13 |
# Mar 11, 1999: - created
|
|
14 |
# Sep 27, 1999: - adapted to allow for new version of covsrt.pl as well
|
|
15 |
# Aug 22, 2006: - changed require from covsrt_old.pl to covsrt.pl
|
|
16 |
|
|
17 |
# Notes:
|
|
18 |
# - x,y,sig are field numbers for data in $ants_
|
|
19 |
# - if sig is a negative number, -sig is used as constant input stddev
|
|
20 |
# - @A, @listA, @alpha, @covar, $chiSq, &funcs, $alamda passed as refs
|
|
21 |
|
|
22 |
require "$ANTS/mrqcof.pl";
|
|
23 |
require "$ANTS/gaussj.pl";
|
|
24 |
require "$ANTS/covsrt.pl";
|
|
25 |
require "$ANTS/nrutil.pl";
|
|
26 |
|
|
27 |
{ # static scope
|
|
28 |
my(@da,@atry,@oneda,@beta,$oChiSq);
|
|
29 |
|
|
30 |
sub mrqmin($$$$$$$$$$)
|
|
31 |
{
|
|
32 |
my($xfnr,$yfnr,$sig,$AR,$listAR,$covarR,
|
|
33 |
$alphaR,$chiSqR,$funcsR,$alamdaR) = @_;
|
|
34 |
|
|
35 |
my($k,$kk,$j,$ihit);
|
|
36 |
|
|
37 |
if ($$alamdaR < 0.0) {
|
|
38 |
&matrix(\@oneda,1,$#{$AR},1,1);
|
|
39 |
&vector(\@atry,1,$#{$AR});
|
|
40 |
&vector(\@da,1,$#{$AR});
|
|
41 |
&vector(\@beta,1,$#{$AR});
|
|
42 |
$kk = $#{$listAR}+1;
|
|
43 |
for ($j=1; $j<=$#{$AR}; $j++) {
|
|
44 |
$ihit = 0;
|
|
45 |
for ($k=1; $k<=$#{$listAR}; $k++) {
|
|
46 |
if ($listAR->[$k] == $j) { $ihit++; }
|
|
47 |
}
|
|
48 |
if ($ihit == 0) {
|
|
49 |
$listAR->[$kk++] = $j;
|
|
50 |
} elsif ($ihit > 1) {
|
|
51 |
croak("Bad listA permutation in MRQMIN-1");
|
|
52 |
}
|
|
53 |
}
|
|
54 |
if ($kk != $#{$AR}+1) {
|
|
55 |
for ($ei=1; $ei<=$#{$listAR}; $ei++) {
|
|
56 |
print(STDERR "listA[$ei] = $listAR->[$ei]\n");
|
|
57 |
}
|
|
58 |
croak("Bad listA permutation in MRQMIN-2 " .
|
|
59 |
"($kk != $#{$AR}+1)");
|
|
60 |
}
|
|
61 |
$$alamdaR = 0.001;
|
|
62 |
&mrqcof($xfnr,$yfnr,$sig,$AR,$listAR,$alphaR,
|
|
63 |
\@beta,$chiSqR,$funcsR);
|
|
64 |
$oChiSq = $$chiSqR;
|
|
65 |
}
|
|
66 |
for ($j=1; $j<=$#{$listAR}; $j++) {
|
|
67 |
for ($k=1; $k<=$#{$listAR}; $k++) {
|
|
68 |
$covarR->[$j][$k] = $alphaR->[$j][$k];
|
|
69 |
# print(STDERR "covar[$j][$k] = $covarR->[$j][$k]\n");
|
|
70 |
}
|
|
71 |
$covarR->[$j][$j] = $alphaR->[$j][$j]*(1.0+$$alamdaR);
|
|
72 |
$oneda[$j][1] = $beta[$j];
|
|
73 |
}
|
|
74 |
&gaussj($covarR,\@oneda);
|
|
75 |
for ($j=1; $j<=$#{$listAR}; $j++) {
|
|
76 |
$da[$j] = $oneda[$j][1];
|
|
77 |
}
|
|
78 |
if ($$alamdaR == 0.0) {
|
|
79 |
&covsrt($covarR,$listAR);
|
|
80 |
return;
|
|
81 |
}
|
|
82 |
for ($j=1; $j<=$#{$AR}; $j++) { $atry[$j] = $AR->[$j]; }
|
|
83 |
for ($j=1; $j<=$#{$listAR}; $j++) {
|
|
84 |
$atry[$listAR->[$j]] = $AR->[$listAR->[$j]]+$da[$j];
|
|
85 |
}
|
|
86 |
&mrqcof($xfnr,$yfnr,$sig,\@atry,$listAR,$covarR,\@da,$chiSqR,$funcsR);
|
|
87 |
if ($$chiSqR < $oChiSq) {
|
|
88 |
$$alamdaR *= 0.1;
|
|
89 |
$oChiSq = $$chiSqR;
|
|
90 |
for ($j=1; $j<=$#{$listAR}; $j++) {
|
|
91 |
for ($k=1; $k<=$#{$listAR}; $k++) {
|
|
92 |
$alphaR->[$j][$k] = $covarR->[$j][$k];
|
|
93 |
}
|
|
94 |
$beta[$j] = $da[$j];
|
|
95 |
$AR->[$listAR->[$j]] = $atry[$listAR->[$j]];
|
|
96 |
}
|
|
97 |
} else {
|
|
98 |
$$alamdaR *= 10.0;
|
|
99 |
$$chiSqR = $oChiSq;
|
|
100 |
}
|
|
101 |
return;
|
|
102 |
}
|
|
103 |
|
|
104 |
} # end of static scope
|
|
105 |
|
|
106 |
1;
|