{"id":"W2107400804","doi":"10.1017/s1446181109000364","title":"AN APPROXIMATE MATRIX INVERSION PROCEDURE BY PARALLELIZATION OF THE SHERMAN–MORRISON FORMULA","year":2009,"lang":"en","type":"article","venue":"The ANZIAM Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Preconditioner; Incomplete LU factorization; Factorization; Parallel computing; Computer science; Inversion (geology); Matrix (chemical analysis); Matrix decomposition; Linear system; Inverse; Incomplete Cholesky factorization; LU decomposition; Algorithm; Mathematics; Iterative method; Geometry; Mathematical analysis","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.0006583926,0.0001016198,0.0001076065,0.00003608925,0.000400311,0.0001379049,0.001344991,0.00004688136,0.00001894784],"category_scores_gemma":[0.00001617999,0.00005192787,0.00007784218,0.0002719453,0.00003688675,0.0006394573,0.00006773404,0.0002335011,0.00000540969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001942371,"about_ca_system_score_gemma":0.00004424888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001899896,"about_ca_topic_score_gemma":3.760362e-7,"domain_scores_codex":[0.9989836,0.0001709623,0.0002288048,0.0001207161,0.0003049854,0.0001909124],"domain_scores_gemma":[0.9991968,0.00001908145,0.0002491672,0.0003993226,0.00006979443,0.00006586467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004037548,0.001678631,0.002456673,0.0001765566,0.0001315144,0.00003517501,0.02165182,0.01926754,0.132261,0.3739623,0.1179705,0.3300045],"study_design_scores_gemma":[0.001360418,0.0007213134,0.003827173,0.0001551223,0.00005171938,0.0007238207,0.0003638245,0.7535579,0.04696509,0.1855042,0.006339124,0.0004302907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4187708,0.0007641871,0.5707755,0.007548661,0.0004787995,0.0003782513,0.000004205501,0.00009344009,0.001186103],"genre_scores_gemma":[0.9957632,0.00007992578,0.003082167,0.000586403,0.0001412923,0.000001049235,0.000001393129,0.000005408858,0.0003391686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7342904,"threshold_uncertainty_score":0.3078909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006824261619264791,"score_gpt":0.2467293615869229,"score_spread":0.239905099967658,"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."}}