{"id":"W2168380569","doi":"10.1016/s0377-0427(00)00399-x","title":"Refining an approximate inverse","year":2000,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preconditioner; Robustness (evolution); Factorization; Computation; Mathematics; Inverse; Exploit; Graph; Algorithm; Incomplete LU factorization; Iterative method; Mathematical optimization; Computer science; Matrix decomposition; Discrete 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.0006065888,0.0007628196,0.0008046665,0.0008087996,0.0005342863,0.001295318,0.0004662397,0.001229451,0.006987376],"category_scores_gemma":[0.003111056,0.0005164143,0.0007731048,0.0005843187,0.001208809,0.001674398,0.001456784,0.001354311,0.001617493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003569914,"about_ca_system_score_gemma":0.0005290895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008449068,"about_ca_topic_score_gemma":0.001099941,"domain_scores_codex":[0.9993993,0.0001044491,0.00002756761,0.0001109435,0.0003201873,0.00003750457],"domain_scores_gemma":[0.9992901,0.0002286416,0.00004356823,0.000283115,0.0001327795,0.0000217028],"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.0005942183,0.0001185504,0.001314041,0.0004157939,0.0001046617,0.0007484683,0.0004940722,0.182298,0.1278215,0.2932347,0.006321495,0.3865344],"study_design_scores_gemma":[0.00005778721,0.0003438186,0.0006374931,0.00007299612,0.00008077391,0.001650011,0.0002350701,0.7507005,0.07087977,0.1323159,0.04297213,0.00005379246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02810253,0.0001944973,0.9583842,0.0002740081,0.0001590619,0.00004522533,0.00007256262,0.0003199952,0.01244808],"genre_scores_gemma":[0.3245549,0.0004375294,0.6578674,0.0001725781,0.0000912317,0.00004982531,0.0002122834,0.000286156,0.01632807],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006987376,"threshold_uncertainty_score":0.02337503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01524730610236856,"score_gpt":0.2231089521677451,"score_spread":0.2078616460653766,"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."}}