{"id":"W70371667","doi":"","title":"On domain decomposition with space filling curves for the parallel solution of the coupled Maxwell/Vlasov equations","year":2008,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Metis; Domain decomposition methods; Solver; Maxwell's equations; Decomposition method (queueing theory); Computer science; Context (archaeology); Mathematical optimization; Finite element method; Scalability; Vlasov equation; Graph partition; Applied mathematics; Constraint satisfaction problem; Domain (mathematical analysis); Mathematics; Graph; Algorithm; Theoretical computer science; Physics; Mathematical analysis; Discrete mathematics; Probabilistic logic","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002074669,0.0001373678,0.0001440588,0.00006698335,0.0009783529,0.00008008905,0.001116783,0.0000527823,0.000005742407],"category_scores_gemma":[0.0004967308,0.00009167611,0.0001060084,0.0005101344,0.0002067583,0.0001412453,0.0001863538,0.0001435569,0.000002346341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004408209,"about_ca_system_score_gemma":0.0001237782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001252677,"about_ca_topic_score_gemma":0.0001196791,"domain_scores_codex":[0.997765,0.001134974,0.0002728122,0.0003002013,0.0003308569,0.0001961725],"domain_scores_gemma":[0.9948547,0.002701354,0.0003454268,0.001156925,0.0008955192,0.0000460267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003860262,0.0005173734,0.0004057885,0.00007500652,0.00006702259,8.877539e-7,0.005775318,0.04376841,0.00184804,0.937949,0.006587538,0.002966994],"study_design_scores_gemma":[0.0004724092,0.000002918918,0.001112711,0.0007139681,0.00001451971,0.00001125648,0.00002177375,0.9778357,0.01372329,0.004846413,0.001085898,0.0001591898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003903776,0.0003567152,0.9740871,0.01879615,0.00005738018,0.0005318229,0.000005429993,0.0002230832,0.002038548],"genre_scores_gemma":[0.6088098,0.0002703728,0.3899182,0.0002167756,0.000006518861,0.00004719232,0.00003191089,0.00001082486,0.0006883487],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9340672,"threshold_uncertainty_score":0.7524798,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01606300918458973,"score_gpt":0.233986368477337,"score_spread":0.2179233592927473,"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."}}