{"id":"W2964558805","doi":"10.1007/978-3-030-56750-7_53","title":"Domain Decomposition for the Closest Point Method","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Discretization; Domain decomposition methods; Mathematics; Domain (mathematical analysis); Laplace transform; Laplace's equation; Elliptic operator; Helmholtz equation; Eigenvalues and eigenvectors; Mathematical analysis; Eigenfunction; Constant (computer programming); Boundary value problem; Pure mathematics; Physics; Computer science; Finite element method","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.001147978,0.0008044503,0.001366356,0.0009870986,0.0004788686,0.001551119,0.001435195,0.001637372,0.007897856],"category_scores_gemma":[0.005849323,0.0004439178,0.001036257,0.0007531899,0.0009183147,0.001615223,0.003178203,0.003619612,0.003200838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004419755,"about_ca_system_score_gemma":0.0009749216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001229012,"about_ca_topic_score_gemma":0.0007166028,"domain_scores_codex":[0.998778,0.0004798474,0.00004355804,0.0001266022,0.0005010906,0.00007076143],"domain_scores_gemma":[0.9985831,0.0007100789,0.0000639404,0.0001529356,0.0004008825,0.00008902526],"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.0001771837,0.0001056063,0.0003160091,0.0005321702,0.00007505885,0.000145677,0.0001289351,0.2411949,0.008431938,0.5229539,0.01219084,0.2137478],"study_design_scores_gemma":[0.000014439,0.00002032409,0.00005481219,0.00003311355,0.000008078901,0.00005872985,0.00002341041,0.8609012,0.0009586156,0.128908,0.009007482,0.00001186631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001068119,0.000250526,0.9958313,0.0001251895,0.00009686754,0.00001969311,0.00003929616,0.00006393652,0.002505088],"genre_scores_gemma":[0.08238125,0.001015262,0.9032973,0.0002282753,0.0002388477,0.0002669272,0.0003531644,0.0004434209,0.0117755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007897856,"threshold_uncertainty_score":0.02642095,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02441710157014513,"score_gpt":0.3401901139027217,"score_spread":0.3157730123325766,"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."}}