summaryrefslogtreecommitdiffstats
path: root/man/lossdistrib.fft.Rd
diff options
context:
space:
mode:
authorGuillaume Horel <guillaume.horel@serenitascapital.com>2015-07-30 15:17:00 -0400
committerGuillaume Horel <guillaume.horel@serenitascapital.com>2015-07-30 15:17:00 -0400
commitd2e3b9cb9758b22887dfaf0118c9e3e1085e28d8 (patch)
treee38df0cd40d2aaa982c3836d392ff86c6275e1aa /man/lossdistrib.fft.Rd
parent3cab7807e4d31a1cda940b9b3e160a1a7cf10a09 (diff)
downloadlossdistrib-d2e3b9cb9758b22887dfaf0118c9e3e1085e28d8.tar.gz
add generated docs
Diffstat (limited to 'man/lossdistrib.fft.Rd')
-rw-r--r--man/lossdistrib.fft.Rd26
1 files changed, 26 insertions, 0 deletions
diff --git a/man/lossdistrib.fft.Rd b/man/lossdistrib.fft.Rd
new file mode 100644
index 0000000..7f86f10
--- /dev/null
+++ b/man/lossdistrib.fft.Rd
@@ -0,0 +1,26 @@
+% Generated by roxygen2 (4.1.1): do not edit by hand
+% Please edit documentation in R/distrib.R
+\name{lossdistrib.fft}
+\alias{lossdistrib.fft}
+\title{Loss distribution of a portfolio}
+\usage{
+lossdistrib.fft(p)
+}
+\arguments{
+\item{p}{Numeric vector, the vector of success probabilities}
+}
+\value{
+A vector such that q[k]=P(S=k)
+}
+\description{
+\code{lossdistrib.fft} computes the probability distribution of a sum
+of independent Bernouilli variables with unequal probabilities.
+}
+\details{
+This uses the fft. Complexity is of order O(n m) + O(m\log{m})
+where m is the size of the grid and n, the number of probabilities.
+It is slower than the recursive algorithm in practice.
+We compute the probability distribution of S = \sum_{i=1}^n X_i
+where X_i is Bernouilli(p_i)
+}
+