{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000517286,0.0003949468,0.0005493621,0.0004587281,0.000384516,0.0003836844,0.0007026062,0.00033718,0.003605639],"category_scores_gemma":[0.001308901,0.0001738976,0.0003457448,0.0005369282,0.0005579288,0.0005161284,0.0006110033,0.000629755,0.0006864789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003461056,"about_ca_system_score_gemma":0.0009006049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003388864,"about_ca_topic_score_gemma":0.004215838,"domain_scores_codex":[0.9997243,0.00008110665,0.00001067602,0.00002805929,0.0001240725,0.00003168884],"domain_scores_gemma":[0.9995937,0.0001290928,0.0000364388,0.00009681095,0.0001226474,0.00002130308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002986378,0.000180027,0.00123234,0.000213039,0.00005949083,0.0003658379,0.0002599375,0.3334662,0.0736279,0.171942,0.006846864,0.4115077],"study_design_scores_gemma":[0.00003579843,0.00003951133,0.0001686543,0.000005730263,0.000007906865,0.00005669007,0.00001380662,0.9763868,0.01000354,0.009842,0.003431906,0.000007653963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01778423,0.00006251384,0.9780058,0.000105405,0.00004213918,0.0000498265,0.00001788164,0.0005246489,0.003407525],"genre_scores_gemma":[0.2611698,0.0001151903,0.733869,0.00007205872,0.00004730686,0.0001323086,0.00005892742,0.0002356562,0.004299802],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003605639,"threshold_uncertainty_score":0.01206207,"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."}}