{"id":"W2057980100","doi":"10.1177/109434200101500106","title":"Parallel Implementation and Practical Use of Sparse Approximate Inverse Preconditioners with a Priori Sparsity Patterns","year":2001,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Lawrence Livermore National Laboratory; University of Waterloo; Microsoft; U.S. Department of Energy","keywords":"Inverse; Sparse matrix; Computation; Computer science; Minification; Matrix (chemical analysis); Norm (philosophy); Algorithm; Numbering; A priori and a posteriori; Mathematical optimization; Code (set theory); Parallel computing; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004876882,0.00009322752,0.0001287404,0.0001141798,0.0001484014,0.0001237667,0.0004746529,0.00002165847,0.00001297323],"category_scores_gemma":[0.00001116777,0.00006561981,0.00003301504,0.0001572961,0.00008535865,0.000809568,0.0001625036,0.0001703508,0.000002662454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003991795,"about_ca_system_score_gemma":0.00008044783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003859011,"about_ca_topic_score_gemma":0.000009410358,"domain_scores_codex":[0.9989467,0.00005257258,0.0003807762,0.0001334703,0.0003652035,0.0001212633],"domain_scores_gemma":[0.9985538,0.0001958955,0.0006321345,0.000199756,0.0003646961,0.00005371061],"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.0009214086,0.001273941,0.1854016,0.0001599672,0.001244204,0.0001159787,0.007074826,0.08934039,0.001244647,0.3995731,0.00181526,0.3118347],"study_design_scores_gemma":[0.005543462,0.001021146,0.265097,0.0004404903,0.0002310744,0.009079608,0.001465816,0.6795664,0.006895291,0.01578177,0.01408714,0.0007908121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.526292,0.000005451791,0.4721849,0.001317783,0.0000605428,0.0001100371,0.00000437812,0.00001077625,0.00001417826],"genre_scores_gemma":[0.9033016,0.0001229956,0.09625329,0.0001673754,0.0001229659,0.00000660424,0.000006087572,0.000004646716,0.00001443862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5902261,"threshold_uncertainty_score":0.2675898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03075754452208893,"score_gpt":0.2976504321479393,"score_spread":0.2668928876258504,"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."}}