Finding aiming points by optimization
Solution #1

10e0 xstep f!  ok

10e0 45e0 0e0 mintheta .vec
x_min: 29.3234
f(x_min): 2.04311
number of iterations needed: 14  ok
2000.00 -1.42937 99.9991  ok

0e0 1e0 29.3234e0 minphi .vec
x_min: .040942
f(x_min): .000002
number of iterations needed: 7  ok
2000.00 .000000 99.9988  ok


1e0 xstep f!  ok

29e0 31e0 0.040942e0 mintheta .vec
x_min: 29.2993
f(x_min): 1.00000
number of iterations needed: 14
1999.00 .001172 100.000  ok

0e0 0.06e0 29.2993e0 minphi .vec
x_min: .040931
f(x_min): .349404
number of iterations needed: 5
2000.00 -.000000 99.4089  ok


.1e0 xstep f!  ok

29.2e0 29.4e0 0.040931e0 mintheta .vec
x_min: 29.3233
f(x_min): .000000
number of iterations needed: 9
2000.00 -.000369 100.000  ok

0.0408e0 0.0410e0 29.3233e0 minphi .vec
x_min: .040942
f(x_min): .000000
number of iterations needed: 4
2000.00 .000000 100.000  ok


.05e0 xstep f!  ok

29.3e0 29.35e0 0.040942e0 mintheta .vec
x_min: 29.3233
f(x_min): .000000
number of iterations needed: 6
2000.05 -.000025 99.9704  ok

0.040940e0 0.040945e0 29.3233e0 minphi .vec
x_min: .040942
f(x_min): .000000
number of iterations needed: 4
2000.00 -.000000 100.000  ok


0.1e0 xstep f!
29.3233e0 .040942e0 f1 cr fsqrt f.  .vec  t f@  f.
.000039
2000.00 .000015 100.000 15.2789  ok