2012
DOI: 10.1007/s00180-012-0371-8
|View full text |Cite
|
Sign up to set email alerts
|

Computing the noncentral gamma distribution, its inverse and the noncentrality parameter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 7 publications
0
7
0
Order By: Relevance
“…-Under-and overflow problems were reported by Benton and Krishnamoorthy (2003), Ding (1997), Helstrom and Ritcey (1985) independently of us; -we also reveal in Baharev and Kemény 2008 that the algorithms of Norton (1983) and Lenth (1987) are exposed to over-and underflow issues, and that the Appendix 12 of Lorenzen and Anderson (1993, p. 374) is most likely bogus due to overflow; -catastrophic round-off errors were reported by Frick (1990); -drastically increasing computation time and hang-ups were observed by Chattamvelli (1995), Benton and Krishnamoorthy (2003); -other noncentral distributions are similarly challenging, see for example Oliveira and Ferreira (2012). If some of the intermediate computations suffer catastrophic loss of precision, the root-finding method can still succeed, and the final result presented to the user may nevertheless seem plausible.…”
Section: Introductionmentioning
confidence: 75%
“…-Under-and overflow problems were reported by Benton and Krishnamoorthy (2003), Ding (1997), Helstrom and Ritcey (1985) independently of us; -we also reveal in Baharev and Kemény 2008 that the algorithms of Norton (1983) and Lenth (1987) are exposed to over-and underflow issues, and that the Appendix 12 of Lorenzen and Anderson (1993, p. 374) is most likely bogus due to overflow; -catastrophic round-off errors were reported by Frick (1990); -drastically increasing computation time and hang-ups were observed by Chattamvelli (1995), Benton and Krishnamoorthy (2003); -other noncentral distributions are similarly challenging, see for example Oliveira and Ferreira (2012). If some of the intermediate computations suffer catastrophic loss of precision, the root-finding method can still succeed, and the final result presented to the user may nevertheless seem plausible.…”
Section: Introductionmentioning
confidence: 75%
“…The difference between our approximation and R function qchisq for the (central) chi-square quantiles was similarly small as for the non-central chi-square quantiles. A referee brought the R package “ncg” (Oliveira and Ferreira, 2013; Ferreira, Oliveira and Toledo, 2015) for computing the noncentral gamma distribution-related quantities to our attention. Non-central chi-square variable (X) is a scaled non-central gamma variable (Z) through a transformation Z = X/ 2.…”
Section: Numerical Examplesmentioning
confidence: 99%
“…which is called the reflection formula. This formula is important for range reduction and it is easily proved by using (19). For computing the gamma function, we use recursion for small values of x and the relation given in (22) for larger values.…”
Section: Gamma Functionmentioning
confidence: 99%
“…which is called the reflection formula. This formula is important for range reduction and it is easily proved by using (19).…”
Section: Gamma Functionmentioning
confidence: 99%
See 1 more Smart Citation