{"id":"W1555151062","doi":"10.1007/978-3-642-11842-5_8","title":"An Efficient Splitting Domain Decomposition Approach for Parabolic-Type Time-Dependent Problems in Porous Media","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"","keywords":"Domain decomposition methods; Computer science; Block (permutation group theory); Decomposition; Domain (mathematical analysis); Decomposition method (queueing theory); Type (biology); Algorithm; Scheme (mathematics); Computational complexity theory; Porous medium; Interface (matter); Computational science; Mathematical optimization; Applied mathematics; Porosity; Mathematics; Parallel computing; Mathematical analysis; Geometry; Finite element method; Discrete mathematics; Materials science; Physics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001237979,0.0004440648,0.000545458,0.0004936692,0.0001091429,0.0001144652,0.0008017634,0.0003536923,0.000007720397],"category_scores_gemma":[0.0001815819,0.0004359094,0.00006324633,0.0003551819,0.0002617151,0.0001327769,0.0001408575,0.0008886812,0.000008368056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003125072,"about_ca_system_score_gemma":0.00008619215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001648853,"about_ca_topic_score_gemma":0.000006903862,"domain_scores_codex":[0.9974255,0.00003627255,0.0006267713,0.0007968871,0.0005927437,0.0005218003],"domain_scores_gemma":[0.9976349,0.001395681,0.000169757,0.0005116547,0.0001521116,0.0001358875],"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.000006676646,0.00004498487,0.000003751573,0.0001235676,0.000004440585,0.000004430172,0.0006465921,0.906989,0.002470091,0.0008906042,2.877082e-7,0.08881558],"study_design_scores_gemma":[0.0001922732,0.00007840369,0.000016677,0.0001547994,0.000005390801,0.00002729655,3.693756e-7,0.7603871,0.000865348,0.2378788,0.00002136586,0.000372256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001832664,0.0001728365,0.9954557,0.00001791735,0.0009582849,0.0009005843,0.00001110201,0.0002056629,0.0004451798],"genre_scores_gemma":[0.05555337,0.000005961029,0.9438201,0.00007343266,0.0003835747,0.00003806704,0.00003424183,0.00008557763,0.00000574249],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2369882,"threshold_uncertainty_score":0.9998093,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01706618341024611,"score_gpt":0.2862113581433468,"score_spread":0.2691451747331007,"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."}}