{"id":"W2129343865","doi":"10.1109/tpds.2012.286","title":"Parallel Sparse Approximate Inverse Preconditioning on Graphic Processing Units","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Preconditioner; Computer science; Biconjugate gradient stabilized method; Solver; Parallel computing; Computational science; Rate of convergence; Sparse matrix; Iterative method; Biconjugate gradient method; Linear system; Convergence (economics); Algorithm; Mathematics; Conjugate residual method; Gradient descent; Channel (broadcasting); Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004573295,0.0002957366,0.0002952348,0.0002000504,0.0006539209,0.0002836307,0.0003159293,0.0001433498,0.00001382428],"category_scores_gemma":[0.00000676232,0.0002615512,0.00007666113,0.0006975091,0.00008692267,0.000938055,0.000004577677,0.0003102704,0.00005586789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004296727,"about_ca_system_score_gemma":0.00005090695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001606171,"about_ca_topic_score_gemma":0.000002126767,"domain_scores_codex":[0.9981277,0.000214471,0.0003764034,0.0004123926,0.0003340824,0.000534937],"domain_scores_gemma":[0.9989169,0.0001049948,0.0001636812,0.0003988454,0.00009168006,0.0003238569],"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.0002765325,0.001337912,0.0002461308,0.0006211124,0.0002271705,0.00003180709,0.00289331,0.8966997,0.0002979989,0.08139401,0.001550687,0.01442367],"study_design_scores_gemma":[0.003518543,0.0005176062,0.000622227,0.0007043216,0.0001294602,0.0004262649,0.001986321,0.9822044,0.0008145222,0.002757736,0.004769437,0.001549158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01155254,0.0002575632,0.9856868,0.000118262,0.0008986854,0.0003761232,0.0001477562,0.0003206309,0.0006415754],"genre_scores_gemma":[0.9971347,0.00004625517,0.002113522,0.00009606039,0.00009757592,0.0001594039,0.00003310768,0.00001626397,0.0003031471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9855821,"threshold_uncertainty_score":0.9999837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03125104163723649,"score_gpt":0.2396300781156609,"score_spread":0.2083790364784245,"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."}}