Application of Newton-Raphson method in three-phase unbalanced power flow
Bibliographic record
Abstract
Renewable energy sources are in the forefront of new energy in power systems. They are predominantly connected to distribution systems at lower voltage levels. Distribution systems have three phases and are largely unbalanced in their line parameters and loads. A large percentage of these systems suffer from severe imbalance in their phases. In the past, two methods of analysis were commonly used. The first is the 'ladder iterative technique' that consider unbalanced systems. However, this method does not possess information about the distribution system. The second method uses the 'Newton Raphson Technique' with 2N equations. It is superior since it computes a Jacobian that holds information about the distribution system. However, predominant implementations of Newton Raphson method assume that the system is balanced and they suffer from poor convergence properties. In order to overcome these difficulties, this research furthers a recent development of single phase 3N equation model of distribution systems by enlarging it to model three phase distribution systems. The Jacobian models each of the three phases using a set of 3N equations. Modeling of network components and formulation of three phase power flow equations are presented. The important characteristics of the Jacobin matrix are also presented. The method is developed and coded. It is tested on standard IEEE distribution systems with 4, 13,34,37, and 123 nodes. The results are compared with published IEEE data.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".