{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048799,0.0006999613,0.0006284353,0.0004183037,0.0007365299,0.0006388111,0.001108168,0.0008121363,0.002403513],"category_scores_gemma":[0.005778145,0.0003338213,0.0003504,0.0005111273,0.0008410977,0.0009606563,0.0009406203,0.0007635134,0.0006335733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005260219,"about_ca_system_score_gemma":0.001113293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003404794,"about_ca_topic_score_gemma":0.003749315,"domain_scores_codex":[0.9991891,0.0002337104,0.00002959851,0.00007673697,0.0003753316,0.00009557814],"domain_scores_gemma":[0.9977906,0.00118765,0.0001459141,0.000483573,0.0003269661,0.00006527439],"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.0004835251,0.0003414672,0.002692414,0.0002763367,0.00005693575,0.0004493017,0.0005267678,0.6102651,0.04503473,0.04425783,0.004679383,0.2909362],"study_design_scores_gemma":[0.00008010009,0.0001186158,0.0002653316,0.0000103978,0.00001240641,0.0001014022,0.0000470881,0.9586243,0.02711765,0.009099077,0.004510674,0.00001292866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0805883,0.0001206326,0.9077278,0.0003249224,0.00003423865,0.0001287059,0.00005370451,0.00275836,0.008263336],"genre_scores_gemma":[0.429456,0.0001586271,0.5668349,0.00004942809,0.00002984031,0.0001846506,0.0001551184,0.0003509172,0.002780493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003404794,"threshold_uncertainty_score":0.008040607,"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."}}