{"id":"W4306251851","doi":"10.1016/j.egyr.2022.09.121","title":"Improved Laplacian Matrix based power flow solver for DC distribution networks","year":2022,"lang":"en","type":"article","venue":"Energy Reports","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Hong Kong Polytechnic University","keywords":"Solver; Computer science; Network topology; Convergence (economics); Topology (electrical circuits); Laplacian matrix; Mathematical optimization; Flow (mathematics); Power (physics); Matrix (chemical analysis); Power flow; Algorithm; Electric power system; Graph; Distributed computing; Mathematics; Theoretical computer science; Engineering; Electrical engineering; Computer network; Physics","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.0003791707,0.0006518457,0.0005275179,0.0004266861,0.0003555262,0.0006593453,0.0007086904,0.0007658468,0.005934132],"category_scores_gemma":[0.001207516,0.0002934856,0.0003917181,0.0006467002,0.0003535023,0.0006073085,0.0006823367,0.0009110346,0.0007009736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006793161,"about_ca_system_score_gemma":0.001360615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01412533,"about_ca_topic_score_gemma":0.01289786,"domain_scores_codex":[0.9998611,0.00004290889,0.000005486118,0.00002199585,0.00005147638,0.00001696346],"domain_scores_gemma":[0.9995994,0.000209412,0.00002671883,0.00001973777,0.0001240518,0.00002070046],"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.00001676867,0.00001773951,0.0002092941,0.00003471897,0.000007533335,0.00004857126,0.0000262055,0.9728248,0.0008503731,0.007856536,0.002073001,0.01603457],"study_design_scores_gemma":[0.00000285594,0.000002000972,0.00001366062,0.000001052107,5.108313e-7,0.000003099009,0.000002483024,0.9990116,0.00006994126,0.0005442765,0.0003476178,7.949386e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009784785,0.0001393312,0.9785085,0.0002759208,0.00004321218,0.00007545766,0.0001712988,0.0003975432,0.01060385],"genre_scores_gemma":[0.4637041,0.0003864175,0.5111423,0.0002143852,0.00008820777,0.0004405467,0.0005297411,0.0003865344,0.02310772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01412533,"threshold_uncertainty_score":0.02808619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003430047421010798,"score_gpt":0.1935782665372242,"score_spread":0.1901482191162134,"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."}}