{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001477487,0.00007286684,0.0001426197,0.00005371072,0.00002991562,0.00002955565,0.00006030329,0.00003206014,0.00005842062],"category_scores_gemma":[0.000001886412,0.00006096214,0.00002282134,0.00005069043,0.00001914825,0.00009559751,0.000004267879,0.00009649229,0.00000586745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009204942,"about_ca_system_score_gemma":0.000007971245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.074852e-7,"about_ca_topic_score_gemma":8.280852e-8,"domain_scores_codex":[0.9994955,0.000003196371,0.0002632764,0.00003630527,0.0001321068,0.00006959664],"domain_scores_gemma":[0.9997785,0.00004009203,0.00005695996,0.00003890673,0.00002857836,0.0000569534],"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.00003800357,0.000272447,0.00002056494,0.0005115608,0.0001439481,0.00002500509,0.004309328,0.566272,0.007323915,0.09087924,0.004727345,0.3254767],"study_design_scores_gemma":[0.0007925846,0.000156243,0.0001734622,0.0001324271,0.00005426371,0.000493246,0.0003144967,0.5801967,0.003005732,0.410035,0.004311801,0.0003341203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7130779,0.00009393823,0.2648826,0.00004384691,0.00003889293,0.00006534554,0.000003544926,0.0001562544,0.02163772],"genre_scores_gemma":[0.4635236,0.00003533503,0.5362415,0.00005987981,0.00007363844,0.000001820581,0.000002264659,0.00001557203,0.00004633975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3251425,"threshold_uncertainty_score":0.2485964,"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."}}