{"id":"W1969579322","doi":"10.1142/s0129626405002374","title":"THE IMPROVED PARALLEL ICGS METHOD FOR LARGE AND SPARSE UNSYMMETRIC LINEAR SYSTEMS","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Conjugate gradient method; Computation; Parallel computing; Sparse matrix; Algorithm; Matrix (chemical analysis); Parallel algorithm; Coefficient matrix; Scheme (mathematics); Distributed memory; Linear system; Mathematical optimization; Shared memory; Mathematics","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.0004462401,0.000626319,0.0005460805,0.0004418892,0.0003590377,0.0004105081,0.001031409,0.0005381025,0.002172416],"category_scores_gemma":[0.0009137195,0.0002453788,0.0003799738,0.0007963637,0.0005637243,0.0006472529,0.000631818,0.0007457073,0.0006517249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003470742,"about_ca_system_score_gemma":0.001525239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003465615,"about_ca_topic_score_gemma":0.003169871,"domain_scores_codex":[0.9997297,0.00006919089,0.000009997251,0.00003242707,0.0001396719,0.00001904094],"domain_scores_gemma":[0.9997129,0.00007455189,0.00002562294,0.00005115849,0.0001110675,0.00002471939],"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.0001930824,0.00009806037,0.0009078407,0.0002667978,0.00005836808,0.0002613261,0.0001557541,0.6404199,0.0300212,0.07055564,0.01232228,0.2447397],"study_design_scores_gemma":[0.00002571595,0.00002885314,0.00008842543,0.000004749388,0.000005407335,0.00005089238,0.000007377107,0.9847333,0.003175829,0.005466583,0.006403743,0.000009267714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005011796,0.0001613794,0.9919614,0.0001471703,0.00009392757,0.00004331884,0.00003761077,0.000392802,0.002150687],"genre_scores_gemma":[0.08228246,0.0002432839,0.9117288,0.0001154279,0.00008732642,0.0001734297,0.0001583752,0.0001826692,0.005028266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003465615,"threshold_uncertainty_score":0.007267416,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01675863454036397,"score_gpt":0.2780497384753776,"score_spread":0.2612911039350136,"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."}}