{"id":"W2038729234","doi":"10.1117/12.434870","title":"<title>Parallel FFT approach for derivative pricing</title>","year":2001,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fast Fourier transform; Computer science; Computation; Algorithm; Binomial options pricing model; Split-radix FFT algorithm; Parallel computing; Prime-factor FFT algorithm; Focus (optics); Fourier transform; Valuation of options; Mathematics; Fourier analysis","routes":{"ca_aff":true,"ca_fund":false,"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.0003899446,0.0004494568,0.0005991366,0.0005213373,0.0003714007,0.0008812534,0.0006035385,0.0005525282,0.01755753],"category_scores_gemma":[0.001735713,0.0001376115,0.0004226599,0.00106045,0.000437349,0.001314795,0.0003906534,0.0009713702,0.00558589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004848447,"about_ca_system_score_gemma":0.0004139391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002752186,"about_ca_topic_score_gemma":0.002154343,"domain_scores_codex":[0.9997479,0.00005665359,0.00001278369,0.00004020449,0.0001183052,0.00002411479],"domain_scores_gemma":[0.9996069,0.0001558877,0.00002181597,0.00006991522,0.0001263413,0.00001922122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003243536,0.0001019014,0.001100016,0.0002408473,0.00004913326,0.0003305211,0.0000893324,0.1471953,0.01284769,0.2196876,0.05230682,0.5657266],"study_design_scores_gemma":[0.00002463423,0.00003211632,0.0003191813,0.00001932803,0.000008168839,0.0001117847,0.00001198559,0.9074231,0.00445267,0.06442428,0.02315881,0.00001400745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008787951,0.001227811,0.9695064,0.0008536408,0.0007317467,0.00005600353,0.0002205112,0.001257064,0.01735878],"genre_scores_gemma":[0.2386309,0.002875148,0.705147,0.0002908218,0.000923646,0.0001870002,0.00103156,0.000918337,0.04999556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01755753,"threshold_uncertainty_score":0.05873579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01931984315342529,"score_gpt":0.2194326873497652,"score_spread":0.2001128441963399,"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."}}