{"id":"W2792934134","doi":"10.1007/s10915-018-0675-0","title":"The Partial Fast Fourier Transform","year":2018,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convolution (computer science); Discrete-time Fourier transform; Fast Fourier transform; Discrete Fourier transform (general); Fourier transform; Fractional Fourier transform; Circular convolution; Cyclotomic fast Fourier transform; Algorithm; Split-radix FFT algorithm; Prime-factor FFT algorithm; Mathematical analysis; Non-uniform discrete Fourier transform; Convolution theorem; Fourier analysis; Hartley transform; Computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009610197,0.0006245712,0.0005309982,0.001081206,0.0003332178,0.001916951,0.0005407938,0.0009221868,0.006218478],"category_scores_gemma":[0.00401459,0.0002922837,0.0004538197,0.001169131,0.001407252,0.002897706,0.001195326,0.002080356,0.00352005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003396235,"about_ca_system_score_gemma":0.0007807014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006129693,"about_ca_topic_score_gemma":0.0003404948,"domain_scores_codex":[0.9994926,0.0001397536,0.0000269548,0.00009921173,0.0002044728,0.00003699755],"domain_scores_gemma":[0.9991503,0.0003287887,0.00005400589,0.0002233096,0.0001962081,0.00004744155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000769328,0.00002152409,0.0002874025,0.0001674395,0.00003462967,0.0001133222,0.0001058042,0.008136565,0.01073659,0.7757763,0.01122925,0.1933142],"study_design_scores_gemma":[0.00002788282,0.00006460989,0.0008604873,0.0000849362,0.00002973828,0.0007381148,0.00007477102,0.1564666,0.01037166,0.6726946,0.1585117,0.00007488763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008433816,0.007932499,0.9377528,0.001767733,0.001638554,0.00004758344,0.0003609331,0.0005630641,0.04150298],"genre_scores_gemma":[0.322171,0.01870177,0.5758448,0.001285882,0.003091209,0.0002309148,0.001380093,0.0006212672,0.07667315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006218478,"threshold_uncertainty_score":0.02080286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01789408518222806,"score_gpt":0.2960035950409459,"score_spread":0.2781095098587179,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}