{"id":"W2075789590","doi":"10.1145/1940475.1940490","title":"Cache friendly sparse matrix-vector multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge; Western University","funders":"","keywords":"Multiplication (music); Computer science; Matrix multiplication; Kernel (algebra); Sparse matrix; Parallel computing; Column (typography); Cache; Matrix (chemical analysis); Conjugate gradient method; Cache-oblivious algorithm; CPU cache; Algorithm; Computational complexity theory; Cache algorithms; Mathematics; Discrete mathematics; Combinatorics","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.0004673296,0.0004912663,0.0006403344,0.0005202128,0.0006105533,0.0008239744,0.0009875054,0.0004932008,0.004894355],"category_scores_gemma":[0.004266634,0.0002203682,0.0002479874,0.001325529,0.0003338919,0.001520137,0.001042932,0.0007078056,0.001826454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004024238,"about_ca_system_score_gemma":0.001264565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002234434,"about_ca_topic_score_gemma":0.006056089,"domain_scores_codex":[0.9992014,0.0001749927,0.00004487871,0.00006939479,0.0004169266,0.00009248629],"domain_scores_gemma":[0.99756,0.000810954,0.0001738719,0.0007157234,0.0006516269,0.00008772409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001156902,0.0002709266,0.004357527,0.0004227078,0.0001071832,0.0005009467,0.000294527,0.2652291,0.05785098,0.07914682,0.03542125,0.5552412],"study_design_scores_gemma":[0.00004360529,0.0001274352,0.0004061633,0.00001312854,0.0000109701,0.0001491183,0.00003738956,0.9563692,0.0166362,0.01962178,0.006570227,0.00001475697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07604027,0.0007836123,0.9089192,0.0003304493,0.0001410298,0.00006289717,0.0003169065,0.004819822,0.008585693],"genre_scores_gemma":[0.5299264,0.0003783626,0.4610367,0.0001423951,0.0001050665,0.0001393544,0.0007690444,0.0003762873,0.007126393],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004894355,"threshold_uncertainty_score":0.01637322,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05468255262939944,"score_gpt":0.2969070496063049,"score_spread":0.2422244969769054,"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."}}