{"id":"W7000453708","doi":"","title":"Fast Sparse Matrix Reordering on GPU for Cholesky Based Solvers","year":2024,"lang":"en","type":"other","venue":"eScholarship (California Digital Library)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Cholesky decomposition; Speedup; Implementation; Sparse matrix; Graph; Minimum degree algorithm; Reduction (mathematics); CUDA; Matrix (chemical analysis)","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":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001981539,0.0006657241,0.000522351,0.000835589,0.0001059645,0.003514595,0.00180681,0.0004677953,0.0002190579],"category_scores_gemma":[0.0001109354,0.0006387995,0.0003975503,0.0006671534,0.00006927225,0.001095325,0.0005079407,0.0006538877,0.003764842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005637417,"about_ca_system_score_gemma":0.0001855265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002133128,"about_ca_topic_score_gemma":5.224759e-7,"domain_scores_codex":[0.9971579,0.00005854459,0.0004843256,0.001203612,0.0004608702,0.0006347162],"domain_scores_gemma":[0.9981725,0.0001358361,0.0002754853,0.001099035,0.00003121936,0.0002859811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003346799,0.0001291754,0.00007399532,0.0003784254,0.00007216427,0.00004709561,0.00001147649,0.0007073786,0.000005623799,0.01132038,0.9782319,0.008988892],"study_design_scores_gemma":[0.0003901297,0.0001327182,0.000002648953,0.001027706,0.00001614423,0.000004322032,0.000001938686,0.02200263,0.0006206275,0.005527365,0.9695118,0.0007619343],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0000097644,0.0005868074,0.5667574,0.0008567817,0.0006297855,0.0007840848,0.002139357,0.007464338,0.4207716],"genre_scores_gemma":[0.004488062,0.00005913081,0.3242211,0.002135565,0.0008581559,0.0001964454,0.001352087,0.001869018,0.6648204],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.2440488,"threshold_uncertainty_score":0.9996063,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01606751837522267,"score_gpt":0.2431890435201492,"score_spread":0.2271215251449265,"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."}}