{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002321237,0.0001013215,0.0001216326,0.00002945116,0.00009383969,0.00002397749,0.0001172122,0.00003117788,0.00005943333],"category_scores_gemma":[0.00003958915,0.00007184046,0.00005779171,0.0001347205,0.00001456683,0.00007983549,0.00001711515,0.0000814522,0.0000193599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004288067,"about_ca_system_score_gemma":0.000001383373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.180315e-7,"about_ca_topic_score_gemma":4.141359e-7,"domain_scores_codex":[0.9994388,0.0000190827,0.0001851229,0.00009996579,0.0001038836,0.0001530976],"domain_scores_gemma":[0.9978051,0.00198047,0.00002788363,0.0001246493,0.00003241918,0.00002948158],"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.000004398826,0.00003256022,0.000003723865,0.000188319,0.00007958627,6.236425e-7,0.0006834294,0.7484053,0.00741773,0.04260869,0.00257493,0.1980007],"study_design_scores_gemma":[0.0001334864,0.00001649829,0.00001334551,0.00001580459,0.00001007485,0.000006572873,0.00006445153,0.8275477,0.001128533,0.1679642,0.003007363,0.00009188921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001893477,0.0001172014,0.9928939,0.0002948203,0.0001343129,0.0004191339,0.000002272422,0.0002125621,0.005736464],"genre_scores_gemma":[0.01005488,0.00001360661,0.9894139,0.0001421039,0.00008514964,0.0001562326,0.000001016019,0.00002749559,0.0001055868],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1979088,"threshold_uncertainty_score":0.2929569,"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."}}