summaryrefslogtreecommitdiffstats
path: root/man/lossdistrib2.truncated.Rd
diff options
context:
space:
mode:
Diffstat (limited to 'man/lossdistrib2.truncated.Rd')
-rw-r--r--man/lossdistrib2.truncated.Rd19
1 files changed, 9 insertions, 10 deletions
diff --git a/man/lossdistrib2.truncated.Rd b/man/lossdistrib2.truncated.Rd
index 2a488e9..9c4854e 100644
--- a/man/lossdistrib2.truncated.Rd
+++ b/man/lossdistrib2.truncated.Rd
@@ -2,11 +2,7 @@
% Please edit documentation in R/distrib.R
\name{lossdistrib2.truncated}
\alias{lossdistrib2.truncated}
-\title{recursive algorithm with first order correction truncated version
-this is actually slower than lossdistrib2. But in C this is
-twice as fast.
-For high severities, M can become bigger than N, and there is
-some probability mass escaping.}
+\title{Loss distribution truncated version}
\usage{
lossdistrib2.truncated(p, w, S, N, cutoff = N)
}
@@ -25,10 +21,13 @@ lossdistrib2.truncated(p, w, S, N, cutoff = N)
a Numeric vector of size \code{N} computing the loss distribution
}
\description{
-recursive algorithm with first order correction truncated version
-this is actually slower than lossdistrib2. But in C this is
-twice as fast.
-For high severities, M can become bigger than N, and there is
-some probability mass escaping.
+\code{lossdistrib2.truncated} computes the probability distribution of a sum
+of independent Bernouilli variables with unequal probabilities up
+to a cutoff N.
+}
+\details{
+This is actually slower than \code{lossdistrib2}, but in C this is
+twice as fast. For high severities, M can become bigger than the cutoff, and
+there is some probability mass escaping.
}