{"id":"W2278832452","doi":"10.1137/16m1062454","title":"Reordering Strategy for Blocking Optimization in Sparse Linear Solvers","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Direction Générale de l’Armement; Université de Bordeaux; Agence Nationale de la Recherche","keywords":"Granularity; Solver; Computer science; Block (permutation group theory); Kernel (algebra); Sparse matrix; Parallel computing; Linear algebra; LU decomposition; Linear system; Computation; Algorithm; Theoretical computer science; Matrix decomposition; Mathematics; Eigenvalues and eigenvectors","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0004728659,0.00009642101,0.0001856975,0.0003787816,0.0008314219,0.0005961254,0.0005063821,0.00004818734,0.000004189311],"category_scores_gemma":[0.00003446622,0.00009024924,0.0001097398,0.0003695647,0.00002580838,0.0002674683,0.00006750945,0.0001352504,0.00000115695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002711025,"about_ca_system_score_gemma":0.00003305243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001242438,"about_ca_topic_score_gemma":0.00000935288,"domain_scores_codex":[0.999167,0.00002669038,0.0002906148,0.0002409209,0.000118871,0.0001559076],"domain_scores_gemma":[0.9989897,0.00005709235,0.000352193,0.0004108642,0.0001155249,0.00007463533],"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.000002947161,0.00003098122,0.0009182658,0.000003761826,0.00004718787,9.422243e-7,0.00002722824,0.9761435,0.00001597773,0.01250121,0.00003532453,0.01027273],"study_design_scores_gemma":[0.0002210156,0.00003244104,0.0009170666,0.00001416462,0.00005238791,0.000004587061,0.00001389208,0.9951832,0.00009141928,0.002120909,0.001241762,0.0001071338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001170638,0.00008370503,0.9974577,0.0005742093,0.00001759184,0.0001573746,0.000001774759,0.00004944214,0.0004875344],"genre_scores_gemma":[0.5813081,0.0004529239,0.4179191,0.00004691942,0.00009778023,0.00003591417,0.000005150851,0.000006704683,0.0001274828],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5801374,"threshold_uncertainty_score":0.6394709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02994591289847937,"score_gpt":0.3352709230479765,"score_spread":0.3053250101494971,"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."}}