{"id":"W2101788802","doi":"10.1109/tmag.2009.2012640","title":"Efficient Multicore Sparse Matrix-Vector Multiplication for FE Electromagnetics","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Electromagnetics; Multi-core processor; Multiplication (music); Sparse matrix; Computer science; Sparse approximation; Matrix multiplication; Parallel computing; Computational science; Matrix (chemical analysis); Computational electromagnetics; Set (abstract data type); Algorithm; Mathematics; Physics; Electromagnetic field; Materials science","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.0003075296,0.0005221292,0.0004159808,0.0003475775,0.0005768457,0.0004125853,0.0008165976,0.000456651,0.004052424],"category_scores_gemma":[0.001318041,0.0001641977,0.0002202163,0.0007184381,0.0002237246,0.0008951993,0.0006451277,0.0005632503,0.0008178615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003636649,"about_ca_system_score_gemma":0.0006736953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00266818,"about_ca_topic_score_gemma":0.008510712,"domain_scores_codex":[0.9997569,0.00005189415,0.00001186238,0.00002401133,0.0001321572,0.00002318624],"domain_scores_gemma":[0.9994506,0.0002026387,0.00004234766,0.0001104543,0.0001649688,0.00002898703],"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.0003269326,0.000185974,0.001077567,0.00028264,0.00006925559,0.0002104134,0.0002027946,0.3518059,0.06339312,0.04511476,0.01608705,0.5212435],"study_design_scores_gemma":[0.00001994422,0.00004916717,0.0001673043,0.000006512073,0.000004676605,0.00005392603,0.00001905481,0.9761681,0.0110851,0.007784734,0.004633851,0.000007633836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02588588,0.0002231006,0.9680099,0.00021836,0.00005632829,0.00003695188,0.0001097657,0.001490027,0.003969803],"genre_scores_gemma":[0.2285121,0.000168751,0.7665085,0.00007674972,0.00004009995,0.0001198987,0.0003618884,0.0001567027,0.004055434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004052424,"threshold_uncertainty_score":0.01355672,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01361796000504157,"score_gpt":0.2569370167323706,"score_spread":0.2433190567273291,"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."}}