{"id":"W2000074722","doi":"10.1023/b:supe.0000026847.75355.69","title":"Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Bottleneck; Parallel computing; Conjugate gradient method; Synchronization (alternating current); Distributed memory; Parallel algorithm; Least-squares function approximation; Product (mathematics); Algorithm; Shared memory; Mathematics; Telecommunications","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.001036877,0.0008692594,0.0008725555,0.0008631324,0.0006827566,0.0009092115,0.00205534,0.001076939,0.009956676],"category_scores_gemma":[0.005015007,0.0004842671,0.0006761937,0.001241162,0.001009001,0.001336793,0.002014305,0.001713301,0.002269295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006823156,"about_ca_system_score_gemma":0.001471093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007351531,"about_ca_topic_score_gemma":0.01702292,"domain_scores_codex":[0.9991819,0.0003068728,0.00004108486,0.00008756457,0.000306766,0.00007578392],"domain_scores_gemma":[0.9982868,0.0006911972,0.00009536498,0.0003890788,0.0004296321,0.000107977],"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.0008159734,0.0002017598,0.001274883,0.0003481081,0.0001178998,0.0001785238,0.0002366367,0.5078514,0.007811792,0.07119308,0.02256373,0.3874062],"study_design_scores_gemma":[0.00007135011,0.0000300072,0.000108831,0.000009183741,0.000008814693,0.00001738735,0.00002149994,0.9767987,0.001412414,0.01727992,0.004233436,0.00000863219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01057598,0.0003308875,0.9813823,0.000434562,0.000260703,0.00005917433,0.0001271144,0.001671661,0.005157646],"genre_scores_gemma":[0.134411,0.0002459115,0.8509832,0.0003462757,0.0003093442,0.0002924115,0.0003986882,0.0008170921,0.01219601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009956676,"threshold_uncertainty_score":0.03330845,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02407950502449638,"score_gpt":0.3036313280909358,"score_spread":0.2795518230664394,"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."}}