MétaCan
Menu
Back to cohort
Record W4301343525 · doi:10.48550/arxiv.1001.5272

An in-place truncated Fourier transform and applications to polynomial\n multiplication

2010· preprint· W4301343525 on OpenAlexaff
David J. Harvey, Daniel S. Roche

Bibliographic record

VenuearXiv (Cornell University) · 2010
Typepreprint
Language
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsFast Fourier transformMultiplication (music)Split-radix FFT algorithmSmoothingInversePolynomialArithmeticPrime-factor FFT algorithmFourier transformMathematicsRader's FFT algorithmDiscrete Fourier transform (general)AlgorithmComputer scienceDiscrete mathematicsCombinatoricsMathematical analysisShort-time Fourier transformFourier analysisStatistics

Abstract

fetched live from OpenAlex

The truncated Fourier transform (TFT) was introduced by van der Hoeven in\n2004 as a means of smoothing the "jumps" in running time of the ordinary FFT\nalgorithm that occur at power-of-two input sizes. However, the TFT still\nintroduces these jumps in memory usage. We describe in-place variants of the\nforward and inverse TFT algorithms, achieving time complexity O(n log n) with\nonly O(1) auxiliary space. As an application, we extend the second author's\nresults on space-restricted FFT-based polynomial multiplication to polynomials\nof arbitrary degree.\n

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.637
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.035
GPT teacher head0.205
Teacher spread0.170 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicPolynomial and algebraic computationFrench-language works237,207