A general analytical solution for calculating n-fold convolution power of exponential-sum distribution functions
From MaRDI portal
(Redirected from Publication:1855868)
A general analytical solution for calculating \(n\)-fold convolution power of exponential-sum distribution functions
A general analytical solution for calculating \(n\)-fold convolution power of exponential-sum distribution functions
The authors find an explicit formula for the \(n\)-fold convolution \(f*f*\cdots *f\) on \((0,\infty)\), where \(f(t)=\sum_{i=1}^m\alpha_ie^{-\lambda_it}\), and \(\alpha_i,\lambda_i\) are constants.
Cites work
- Complete multinomial expansions
- How to compute the n-fold convolution power of elementary functions without numerical integration
- scientific article; zbMATH DE number 3168165 (Why is no real title available?)
- scientific article; zbMATH DE number 52517 (Why is no real title available?)
- scientific article; zbMATH DE number 3222329 (Why is no real title available?)
- Introduction to the Laplace transform
- Numerical Integration Using Sums of Exponential Functions
Cited in
(5)- The \(n\)-fold convolution of generalized exponential-sum distribution functions
- A novel analytical scheme to compute the n-fold convolution of exponential-sum distribution functions
- The \(n\)-fold convolution of a finite mixture of densities
- Generalizations of Two-Sided Power Distributions and Their Convolution
- Discrete distributions based on inter arrival times with application to football data
This page was built for publication: A general analytical solution for calculating \(n\)-fold convolution power of exponential-sum distribution functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855868)