Changeset 786 for trunk/source/service.cpp

Timestamp:

01/16/07 10:31:41 (2 years ago)

Author:

peter

Message:

source/service.cpp

• Bug-fix. Fix problem in e2() with negative return values for very large tau.
  

source/thirdparty_bevington.cpp
source/conv_eden_ioniz.cpp
source/thirdparty.cpp
source/thirdparty.h

• Replace Bevington linfit routine with open source version.
  
• Bug-fix. Replace call to y0() -> bessel_y0(), y1() -> bessel_y1() in bessel_yn().
  

Files:

• trunk/source/service.cpp (modified) (3 diffs)

trunk/source/service.cpp

@@ -302 +302 @@
 {
         /* use recurrence relation */
-        return exp_mt - t*ee1(t);
+        /* ignore exp_mt, it is *very* unreliable */
+        /* guard against negative results, this can happen for very large t */
+        return max(sexp(t) - t*ee1(t),0.);
 }
 
@@ -336 +338 @@
         {
                 /* abs. accuracy better than 2e-7 */
-/*              ans = a[0] + a[1]*x + a[2]*x*x + a[3]*powi(x,3) + a[4]*powi(x,4) +  */
-/*                a[5]*powi(x,5) - log(x); */
                 ans = ((((a[5]*x + a[4])*x + a[3])*x + a[2])*x + a[1])*x + a[0] - log(x);
         }
@@ -345 +345 @@
         {
                 /* abs. accuracy better than 2e-8 */
-/*              top = powi(x,4) + b[0]*powi(x,3) + b[1]*x*x + b[2]*x + b[3]; */
                 top = (((x + b[0])*x + b[1])*x + b[2])*x + b[3];
-/*              bot = powi(x,4) + c[0]*powi(x,3) + c[1]*x*x + c[2]*x + c[3]; */
                 bot = (((x + c[0])*x + c[1])*x + c[2])*x + c[3];
-                /* 
-                 *>>>chng 98 dec 17
+                /*>>>chng 98 dec 17
                  * Jason's original implementation did not require the exp since
-                 * the routines that used this knew if was not present.  
-                 * put in for safely.
-                 
-                ans = top/bot/x;*/
+                 * the routines that used this knew it was not present.  
+                 * put in for safety. */
                 ans = top/bot/x*sexp(x);
         }