{"id":"W4392005228","doi":"10.1016/j.cpc.2024.109129","title":"Quasi-optimal domain decomposition method for neural network-based computation of the time-dependent Schrödinger equation","year":2024,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Carleton University","funders":"","keywords":"Artificial neural network; Domain decomposition methods; Rate of convergence; Relaxation (psychology); Partial differential equation; Convergence (economics); Applied mathematics; Schwarz alternating method; Computation; Mathematics; Mathematical optimization; Dirichlet distribution; Acceleration; Computer science; Algorithm; Boundary value problem; Mathematical analysis; Key (lock); Finite element method; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002689671,0.0001535183,0.0001792288,0.00003788568,0.0003706874,0.0001141764,0.0004471674,0.00003845095,0.00001511415],"category_scores_gemma":[0.000001047798,0.0001318331,0.0002537275,0.0003196076,0.00007873782,0.0001715524,0.000190041,0.0002335635,0.00001100357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003523141,"about_ca_system_score_gemma":0.0000636562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001585974,"about_ca_topic_score_gemma":8.848789e-7,"domain_scores_codex":[0.998814,0.0003013956,0.0003291187,0.0002235204,0.0001538808,0.0001780915],"domain_scores_gemma":[0.9985459,0.0004598733,0.0001637622,0.000646616,0.0001435068,0.000040339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001058614,0.0002353403,0.00005496872,0.00002077012,0.000060167,2.802878e-8,0.0001513673,0.8541918,0.0007430025,0.07545749,0.001647764,0.06742667],"study_design_scores_gemma":[0.0002558847,0.00006217802,0.00004423405,0.00009814554,0.00005581888,5.834673e-7,0.00001038034,0.9717686,0.0003612783,0.02662092,0.0005960197,0.0001259687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004768888,0.0001207091,0.9923697,0.001405969,0.0004618153,0.0005282097,0.00003576952,0.00008075848,0.0002281621],"genre_scores_gemma":[0.6922868,0.000001609376,0.3065854,0.0000944173,0.0006113538,0.00009035047,0.0002732465,0.00002409727,0.0000327665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6875179,"threshold_uncertainty_score":0.5375999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03746399663729461,"score_gpt":0.3323566542403746,"score_spread":0.29489265760308,"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."}}