{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328838,0.0007775779,0.0007807796,0.0006210977,0.0005006038,0.001321255,0.001084846,0.0009313817,0.002244008],"category_scores_gemma":[0.004609366,0.0004479487,0.0008935061,0.0008499277,0.0009144438,0.001457032,0.002183818,0.002041082,0.0009420422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007898987,"about_ca_system_score_gemma":0.001209881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001791194,"about_ca_topic_score_gemma":0.001846447,"domain_scores_codex":[0.9990978,0.0002368291,0.00004685428,0.00009026525,0.0004748122,0.00005338815],"domain_scores_gemma":[0.9984056,0.0007761972,0.0001090615,0.0002825587,0.0003719127,0.00005468218],"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.00004848845,0.00004196102,0.00055615,0.0002131419,0.0000550682,0.00007853896,0.0001458044,0.7344554,0.006761062,0.1454838,0.004141679,0.108019],"study_design_scores_gemma":[0.000005686136,0.000007744526,0.00005045699,0.00001070807,0.000002640519,0.00001579894,0.00001210889,0.9742476,0.001179468,0.02194667,0.002516493,0.000004651124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002263973,0.0002018806,0.9958406,0.00009270143,0.00002912235,0.00002690992,0.00003038683,0.000248856,0.001265542],"genre_scores_gemma":[0.1316333,0.0008332482,0.86364,0.0001301217,0.00007880647,0.0003069333,0.0003708844,0.0003010897,0.002705605],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002244008,"threshold_uncertainty_score":0.007506907,"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."}}