Assessing fast Fourier transform algorithms.

DOI10.1016/S0167-9473(97)00052-2zbMath1042.65555OpenAlexW4253696482MaRDI QIDQ1128616

Karim F. Hirji

Publication date: 13 August 1998

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9473(97)00052-2

zbMATH Keywords

Discrete dataFast Fourier transformEfficient algorithmExact inference

Mathematics Subject Classification ID

Generalized linear models (logistic models) (62J12) Numerical methods for discrete and fast Fourier transforms (65T50) Contingency tables (62H17)

Related Items (1)

Time-series reconstruction from natural archive data with the Averaging effect taken into account

Uses Software

• SAS/STAT

Cites Work

• Unnamed Item
• Unnamed Item
• A comparison of algorithms for exact analysis of unordered \(2\times K\) contingency tables
• Fast Fourier transform and convolution algorithms
• Analysis of discrete data: Rerandomization methods and complexity
• A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data
• A survey of exact inference for contingency tables. With comments and a rejoinder by the author
• An Algorithm for Exact Logistic Regression
• On Obtaining Permutation Distributions in Polynomial Time
• Algorithms for the Analysis of Several $2 \times 2$ Contingency Tables
• Computing Distributions for Exact Logistic Regression
• Methods for Exact Goodness-of-Fit Tests
• A Note on Exact Analysis of Several 2 x 2 Tables
• A comparison of algorithms for exact goodness-of-fit tests for multinomial data

This page was built for publication: Assessing fast Fourier transform algorithms.