{"id":"W3207260507","doi":"10.22215/etd/2019-13428","title":"Scalable Domain Decomposition Algorithms for Uncertainty Quantification in High Performance Computing","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Solver; Sparse grid; Uncertainty quantification; Computer science; Domain decomposition methods; Scalability; Finite element method; Grid; Polynomial chaos; Curse of dimensionality; Partial differential equation; Algorithm; Mathematical optimization; Computational science; Mathematics; Monte Carlo 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003074929,0.0002759552,0.0005326028,0.0005011247,0.0001586669,0.0002141433,0.0006186073,0.000341725,0.00006965864],"category_scores_gemma":[0.0005030806,0.0002189481,0.0001114727,0.0006542243,0.00002389918,0.0002262047,0.00002395466,0.0002381684,0.0002146246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001880681,"about_ca_system_score_gemma":0.0001739399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001014929,"about_ca_topic_score_gemma":0.00007683251,"domain_scores_codex":[0.9970097,0.00008942271,0.001018249,0.00076918,0.0007555081,0.000357939],"domain_scores_gemma":[0.9971865,0.001357306,0.000395865,0.0005275502,0.0004726474,0.00006007565],"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.0003239612,0.0001616915,0.0008171381,0.0004054488,0.00003077414,0.000001522474,0.0009343222,0.8541095,0.001340027,0.02281391,0.003314637,0.115747],"study_design_scores_gemma":[0.0006666777,0.0001030875,0.01355148,0.0002578592,0.00001593669,0.000001900759,0.001003098,0.9724587,0.0007846513,0.01009079,0.000661112,0.0004046671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3984982,0.00009144888,0.5956334,0.00007285497,0.002322253,0.001116352,0.00002677238,0.00008288533,0.002155831],"genre_scores_gemma":[0.9307401,0.00001458306,0.0573322,0.00002797198,0.0001168613,0.00006521781,0.001207868,0.00003461435,0.01046061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5383012,"threshold_uncertainty_score":0.8928444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05826894164298011,"score_gpt":0.3561739951555501,"score_spread":0.29790505351257,"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."}}