{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857151,0.0002536747,0.0002715008,0.0001260556,0.0008635912,0.0006953009,0.0008741615,0.00008006975,0.000001128889],"category_scores_gemma":[0.0001157094,0.0001783682,0.00008976607,0.0004471983,0.00006163046,0.0005941067,0.0001748713,0.0002107051,0.00001533305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003723707,"about_ca_system_score_gemma":0.00005342198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001222649,"about_ca_topic_score_gemma":0.000003271011,"domain_scores_codex":[0.9979912,0.0001668918,0.0003908258,0.0005522864,0.0002324675,0.0006663451],"domain_scores_gemma":[0.9985779,0.0005192063,0.0002379498,0.0004446953,0.0000842565,0.0001360223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002924024,0.0003390019,0.0001864882,0.001004158,0.0002328729,0.00002464873,0.003682956,0.02118878,0.00587794,0.1909643,0.01374566,0.7624608],"study_design_scores_gemma":[0.0009647995,0.00003941651,0.00003437729,0.00002965402,0.00001807821,0.00003206007,0.00005503304,0.9076715,0.0001188612,0.001059799,0.08970417,0.0002723208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008468396,0.003487933,0.983479,0.01104335,0.0002868137,0.0005168546,0.000004421735,0.0001899,0.0001449425],"genre_scores_gemma":[0.09644088,0.00009106335,0.8971459,0.0042921,0.0007710031,0.000242481,0.00000481869,0.00003837982,0.0009734177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8864827,"threshold_uncertainty_score":0.7273645,"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."}}