A new method for fast computation of cumulative distribution functions by fractional FFT
スポンサーリンク
概要
- 論文の詳細を見る
We consider computation of cumulative distribution functions from their corresponding characteristic functions. We may use some known formulas with singular integrals for the computation. It is, however, difficult to speed up the computation with such formulas, because the fast Fourier transform (FFT) cannot be applied directly to them. Based on existing works for pricing of financial derivatives, we propose a fast method for the computation with fractional FFT and obtain accurate results on the entire real line.
- The Japan Society for Industrial and Applied Mathematicsの論文
The Japan Society for Industrial and Applied Mathematics | 論文
- Computational and Symbolic Anonymity in an Unbounded Network
- Finite element computation for scattering problems of micro-hologram using DtN map
- A new compressible fluid model for traffic flow with density-dependent reaction time of drivers
- A new method for fast computation of cumulative distribution functions by fractional FFT
- Evolution of bivariate copulas in discrete processes