{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007685994,0.0006965725,0.0005520094,0.0007349405,0.0004985024,0.000666634,0.0005463312,0.00069025,0.002083003],"category_scores_gemma":[0.00199177,0.0002886345,0.0005837838,0.0008153497,0.0008733041,0.0007444233,0.0008743003,0.001069126,0.0005795239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004562846,"about_ca_system_score_gemma":0.000845743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002324544,"about_ca_topic_score_gemma":0.001273874,"domain_scores_codex":[0.9996603,0.0001272164,0.00001232578,0.00002458165,0.0001468689,0.00002888691],"domain_scores_gemma":[0.9992939,0.0004417645,0.00004169388,0.00008015856,0.0001133247,0.00002909964],"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.0001437808,0.0000587962,0.0004860671,0.0002392507,0.00002911947,0.0001334737,0.0003310887,0.5855688,0.02082619,0.1601176,0.003981214,0.2280848],"study_design_scores_gemma":[0.00001361832,0.00002097269,0.00007576161,0.00001294094,0.000002755771,0.00004682482,0.00001655858,0.9703672,0.003217081,0.02008816,0.006127966,0.00001019927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01088205,0.0002787822,0.9852439,0.0001004073,0.00003823297,0.00004200492,0.00001918928,0.0002553603,0.003140124],"genre_scores_gemma":[0.1410151,0.0005903156,0.8546831,0.0000602719,0.00004858944,0.0002198285,0.0001264077,0.000368456,0.002887967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002324544,"threshold_uncertainty_score":0.006968319,"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."}}