0
|
1 |
#======================================================================
|
|
2 |
# A M O E B A . P L
|
|
3 |
# doc: Wed Aug 23 05:11:48 2006
|
|
4 |
# dlm: Wed Aug 23 23:52:12 2006
|
|
5 |
# (c) 2006 A.M. Thurnherr
|
|
6 |
# uE-Info: 88 0 NIL 0 0 72 2 2 4 NIL ofnI
|
|
7 |
#======================================================================
|
|
8 |
|
|
9 |
# perlified amoeba implementation of NR code
|
|
10 |
|
|
11 |
# NOTES:
|
|
12 |
# - 0-based arrays
|
|
13 |
# - amoeba returns undef if NMAX is exceeded and # of evals otherwise
|
|
14 |
|
|
15 |
use strict;
|
|
16 |
|
|
17 |
sub amotry($$$$$$)
|
|
18 |
{
|
|
19 |
my($pR,$yR,$psumR,$funR,$ihi,$fac) = @_;
|
|
20 |
my(@ptry);
|
|
21 |
|
|
22 |
my($ndim) = scalar(@{$pR->[0]});
|
|
23 |
my($fac1) = (1-$fac) / $ndim;
|
|
24 |
my($fac2) = $fac1 - $fac;
|
|
25 |
|
|
26 |
for (my($j)=0; $j<$ndim; $j++) {
|
|
27 |
$ptry[$j] = $psumR->[$j]*$fac1 - $pR->[$ihi][$j]*$fac2;
|
|
28 |
}
|
|
29 |
my($ytry) = &$funR(@ptry);
|
|
30 |
if ($ytry < $yR->[$ihi]) {
|
|
31 |
$yR->[$ihi] = $ytry;
|
|
32 |
for (my($j)=0; $j<$ndim; $j++) {
|
|
33 |
$psumR->[$j] += $ptry[$j] - $pR->[$ihi][$j];
|
|
34 |
$pR->[$ihi][$j] = $ptry[$j];
|
|
35 |
}
|
|
36 |
}
|
|
37 |
return $ytry;
|
|
38 |
}
|
|
39 |
|
|
40 |
sub get_psum($$)
|
|
41 |
{
|
|
42 |
my($pR,$psumR) = @_;
|
|
43 |
|
|
44 |
for (my($j)=0; $j<@{$pR->[0]}; $j++) {
|
|
45 |
my($sum);
|
|
46 |
for ($sum=my($i)=0; $i<=@{$pR->[0]}; $i++) {
|
|
47 |
$sum += $pR->[$i][$j];
|
|
48 |
}
|
|
49 |
$psumR->[$j] = $sum;
|
|
50 |
}
|
|
51 |
}
|
|
52 |
|
|
53 |
sub amoeba($$$$)
|
|
54 |
{
|
|
55 |
my($pR,$yR,$ftol,$funR,$NMAX) = @_;
|
|
56 |
my($nfunk) = 0;
|
|
57 |
my($ndim) = scalar(@{$pR->[0]});
|
|
58 |
my(@psum);
|
|
59 |
|
|
60 |
&get_psum($pR,\@psum);
|
|
61 |
|
|
62 |
while (1) {
|
|
63 |
my($i,$ihi,$inhi,$j);
|
|
64 |
my($sum);
|
|
65 |
|
|
66 |
my($ilo) = 0;
|
|
67 |
if ($yR->[0] > $yR->[1]) {
|
|
68 |
$ihi = 0; $inhi = 1;
|
|
69 |
} else {
|
|
70 |
$ihi = 1; $inhi = 0;
|
|
71 |
}
|
|
72 |
|
|
73 |
for ($i=0; $i<$ndim+1; $i++) {
|
|
74 |
if ($yR->[$i] <= $yR->[$ilo]) {
|
|
75 |
$ilo = $i;
|
|
76 |
}
|
|
77 |
if ($yR->[$i] > $yR->[$ihi]) {
|
|
78 |
$inhi = $ihi;
|
|
79 |
$ihi = $i;
|
|
80 |
} elsif ($yR->[$i] > $yR->[$inhi] && $i != $ihi) {
|
|
81 |
$inhi = $i;
|
|
82 |
}
|
|
83 |
}
|
|
84 |
print(STDERR "best = $yR->[$ilo]\n");
|
|
85 |
|
|
86 |
my($rtol) = 2 * abs($yR->[$ihi] - $yR->[$ilo]) /
|
|
87 |
(abs($yR->[$ihi]) + abs($yR->[$ilo]));
|
|
88 |
if ($rtol < $ftol) {
|
|
89 |
my($tmp) = $yR->[0]; $yR->[0] = $yR->[$ilo]; $yR->[$ilo] = $tmp;
|
|
90 |
for ($i=0; $i<$ndim; $i++) {
|
|
91 |
my($tmp) = $pR->[1][$i]; $pR->[1][$i] = $pR->[$ilo][$i];
|
|
92 |
$pR->[$ilo][$i] = $tmp;
|
|
93 |
}
|
|
94 |
return $nfunk;
|
|
95 |
}
|
|
96 |
|
|
97 |
return undef if ($nfunk >= $NMAX);
|
|
98 |
$nfunk += 2;
|
|
99 |
|
|
100 |
my($ytry) = amotry($pR,$yR,\@psum,$funR,$ihi,-1);
|
|
101 |
if ($ytry <= $yR->[$ilo]) {
|
|
102 |
$ytry = amotry($pR,$yR,\@psum,$funR,$ihi,2);
|
|
103 |
} elsif ($ytry >= $yR->[$inhi]) {
|
|
104 |
my($ysave) = $yR->[$ihi];
|
|
105 |
$ytry = amotry($pR,$yR,\@psum,$funR,$ihi,0.5);
|
|
106 |
if ($ytry >= $ysave) {
|
|
107 |
for ($i=0; $i<$ndim+1; $i++) {
|
|
108 |
if ($i != $ilo) {
|
|
109 |
for ($j=0; $j<$ndim; $j++) {
|
|
110 |
$pR->[$i][$j] = $psum[$j] =
|
|
111 |
0.5 * ($pR->[$i][$j] + $pR->[$ilo][$j]);
|
|
112 |
}
|
|
113 |
$yR->[$i] = &$funR(@psum);
|
|
114 |
}
|
|
115 |
}
|
|
116 |
$nfunk += $ndim;
|
|
117 |
&get_psum($pR,\@psum);
|
|
118 |
}
|
|
119 |
} else {
|
|
120 |
--$nfunk;
|
|
121 |
}
|
|
122 |
}
|
|
123 |
}
|
|
124 |
|
|
125 |
1;
|