{"id":"W2089448319","doi":"10.4028/www.scientific.net/amr.706-708.1890","title":"Implementing Sparse Matrix Ordering Using Hypergraph Partitioning","year":2013,"lang":"en","type":"article","venue":"Advanced materials research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Hypergraph; Cholesky decomposition; Sparse matrix; Computer science; Scheme (mathematics); Vertex (graph theory); Matrix (chemical analysis); Algorithm; Heuristic; Theoretical computer science; Combinatorics; Mathematics; Mathematical optimization; Graph; Eigenvalues and eigenvectors; Materials science; Computational chemistry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002382103,0.000482977,0.0003052433,0.0006013789,0.0005033147,0.000541472,0.000550365,0.0003581383,0.003611884],"category_scores_gemma":[0.0008784516,0.0002125722,0.0002503662,0.0006884139,0.0004148071,0.001030704,0.0009150003,0.0005502551,0.0007121911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004464445,"about_ca_system_score_gemma":0.000780533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003090611,"about_ca_topic_score_gemma":0.007387141,"domain_scores_codex":[0.9997249,0.00007098919,0.00001448391,0.00003939773,0.0001092583,0.00004086099],"domain_scores_gemma":[0.9995362,0.0001765234,0.00003923208,0.0001156787,0.0001038844,0.00002859736],"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.0003262437,0.0001414447,0.001331842,0.0002423815,0.00005751835,0.0003537524,0.000356097,0.2546192,0.1783092,0.08348321,0.006743623,0.4740356],"study_design_scores_gemma":[0.00005394871,0.0001737162,0.0004829026,0.00002131601,0.0000148561,0.0001899694,0.0001294851,0.870145,0.08112294,0.03062603,0.01700687,0.00003297781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0274475,0.0001247755,0.9668928,0.0001032504,0.00004237008,0.00006498706,0.00006464123,0.0008950925,0.004364511],"genre_scores_gemma":[0.3094954,0.0001825872,0.6855961,0.0001087354,0.0000266832,0.0001070731,0.0003477003,0.0001236227,0.004012095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003611884,"threshold_uncertainty_score":0.01208299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06007516919491399,"score_gpt":0.3705282381566178,"score_spread":0.3104530689617038,"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."}}