- p, lambda, lower.tail, log.p
qpois()
standard
argument, see its help page.
- yLarge
a positive number; in R up to 2021, was internally
hardwired to yLarge = 1e5
: Uses more careful search for
\(y \ge y_L\), where \(y\) is the initial approximate result,
derived from a Cornish-Fisher expansiion.
- incF
a positive “increment factor” (originally hardwired to
0.001), used only when y >= yLarge
; defines the initial increment in
the search algorithm as incr <- floor(incF * y)
.
- iShrink
a positive increment shrinking factor, used only when
y >= yLarge
to define the new increment from the old one as
incr <- max(1, floor(incr/iShrink))
where the LHS was hardired
original to (incr/100)
.
- relTol
originally hard wired to 1e-15, defines the convergence
tolerance for the search iterations when y >= yLarge
; the
iterations stop when (new) incr <= y * relTol
.
- pfEps.n, pfEps.L
positive factors defining “fuzz to ensure
left continuity”, both originally hardwired to 64
, the fuzz adjustment was
p <- p * (1 - 64 *.Machine$double.eps)
Now, pfEps.L
is used if(log.p)
is true and pfEps.n
is used otherwise ("n"ormal case), and the adjustments also depend on
lower.tail
, and also on fpf
:
- fpf
a number larger than 1
, together with pfEps.n
determines the fuzz-adjustment to p
in the case
(lower=tail=FALSE, log.p=FALSE)
:
with e <- pfEps.n * .Machine$double.eps
, the adjustment
p <- p * (1 + e)
is made iff 1 - p > fpf*e
.
- trace
logical (or integer) specifying if (and how much) output
should be produced from the algorithm.