{"id":"W1985460801","doi":"10.1115/fedsm2002-31368","title":"A Non-Overlapping Domain Decomposition Method for the Stokes Problem","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Lagrange multiplier; FETI; Domain decomposition methods; Mortar methods; Iterative method; Finite element method; Constraint algorithm; Fictitious domain method; Mathematics; Mathematical optimization; Decomposition method (queueing theory); Applied mathematics; Tearing; Domain (mathematical analysis); Decomposition; Reduction (mathematics); Algorithm; Computer science; Mathematical analysis; Geometry; Physics; Discrete mathematics; Structural engineering; Engineering","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.0006121726,0.0008144187,0.001025807,0.0007086925,0.000613044,0.0008130783,0.0009411904,0.001013809,0.006091955],"category_scores_gemma":[0.0009779778,0.0003618792,0.0008942612,0.0007028225,0.0004846929,0.0007305664,0.001117635,0.001560539,0.002768432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003818759,"about_ca_system_score_gemma":0.001150272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008958628,"about_ca_topic_score_gemma":0.0009678169,"domain_scores_codex":[0.9994803,0.0001721116,0.00002298008,0.00005643924,0.0002409964,0.00002718404],"domain_scores_gemma":[0.9996189,0.0001426947,0.0000342647,0.00005144698,0.0001192259,0.00003330148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008601986,0.0001835503,0.0004422517,0.0006377355,0.0000830767,0.000217675,0.0002143135,0.2597402,0.05480061,0.2100488,0.01041848,0.4631273],"study_design_scores_gemma":[0.00002561383,0.00005247913,0.0001115613,0.00003853321,0.00001492455,0.0001878092,0.00002897001,0.9434443,0.004447174,0.01537482,0.03624348,0.00003041274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006361319,0.0001364652,0.9978861,0.00004075476,0.00006024704,0.0000423169,0.00003034274,0.00009756134,0.001070013],"genre_scores_gemma":[0.01427683,0.0003707009,0.9813814,0.00004823919,0.00004817322,0.0003238785,0.000103739,0.0001049464,0.003342073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006091955,"threshold_uncertainty_score":0.0203796,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02919543663781704,"score_gpt":0.3325151043641168,"score_spread":0.3033196677262998,"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."}}