Article View: sci.math.num-analysis
Article #507A series of overflow and underflow
From: Ping Chou
Date: Sat, 12 Sep 1992 09:06
Date: Sat, 12 Sep 1992 09:06
23 lines
1325 bytes
1325 bytes
I'm trying to evaluate the following series, and wondering if
it can be reduced further (toward some kind of special function).
sum[k=0 to +inf] of [b^k * e^(-b) * P(k+1,a) / K!]
where k is integer, a and b are positive real, e=2.718281828..., and
P() is the incomplete gamma function.
The only problem is that both a and b can be (and most of the
time in my applications) as large as 5000. Because of this, I have to
put e^(-b) in each term even it has nothing to do with k, and evaluate
log of each term first and then take its exponential,
exp( k*LN(b) - b + LN(P(k+1,a)) - LN(k!) )
otherwise e^(-5000) is effectively zero, and 5000^k will overflow, on
most computers.
Please let me know if there is better algorithm to evaluate
this series, or if it has an analytical solution. Thanks for your time
and effort.
Ping
Technical Details
Message-ID:
<BuGJzn.HH6@news.orst.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!umn.edu!news.orst.edu!usenetShow Full Headers
Complete Article Headers
Newsgroups: sci.math.num-analysis Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!umn.edu!news.orst.edu!usenet From: choup@bionette.cgrb.orst.edu (Ping Chou) Subject: A series of overflow and underflow Message-ID: <BuGJzn.HH6@news.orst.edu> Sender: usenet@news.orst.edu (Usenet News admin) Nntp-Posting-Host: cgrb.orst.edu Organization: Biological Computing Consortium, OSU, Corvallis, OR. Distribution: usa Date: Sat, 12 Sep 1992 09:06:56 GMT Lines: 23