How to compute the n-fold convolution power of elementary functions without numerical integration

DOI10.1007/BF02276918MaRDI QIDQ1116272zbMATH OpenOpenAlexFDO

Authors Rupert Lasser, J. Tritschler

Publication date 1988

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02276918

zbMATH Keywords

distribution functionelementary functionsrecursion formulan-fold convolution

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) One-variable calculus (26A06)

Recommendations

• The \(n\)-fold convolution of a finite mixture of densities
• A novel analytical scheme to compute the \(n\)-fold convolution of exponential-sum distribution functions
• Some bounds for the \(n\)-fold convolution of concave and log-concave distribution functions
• Publication:3790377
• Generalized convolution of uniform distributions

Cited in

(4)

• 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
• A general analytical solution for calculating \(n\)-fold convolution power of exponential-sum distribution functions
• Recursive convolutions of unit rectangle function and some applications

This page was built for publication: How to compute the n-fold convolution power of elementary functions without numerical integration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116272)