2021
DOI: 10.3390/en14144108
|View full text |Cite
|
Sign up to set email alerts
|

On the Applicability of Two Families of Cubic Techniques for Power Flow Analysis

Abstract: This work presents a comprehensive analysis of two cubic techniques for Power Flow (PF) studies. In this regard, the families of Weerakoon-like and Darvishi-like techniques are considered. Several theoretical findings are presented and posteriorly confirmed by multiple numerical results. Based on the obtained results, the Weerakoon’s technique is considered more reliable than the Newton-Raphson and Darvishi’s methods. As counterpart, it presents a high computational burden. Regarding this point, the Darvishi’s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
13
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(14 citation statements)
references
References 44 publications
1
13
0
Order By: Relevance
“…As a sake of example, it is desirable that robust methodologies meet the Contraction Mapping Theorem (e.g. see [8]). However, this kind of analysis is infrequent in the related literature.…”
Section: A Motivationmentioning
confidence: 99%
See 2 more Smart Citations
“…As a sake of example, it is desirable that robust methodologies meet the Contraction Mapping Theorem (e.g. see [8]). However, this kind of analysis is infrequent in the related literature.…”
Section: A Motivationmentioning
confidence: 99%
“…Definition 2 [8]. Nonexpansive and Contractive Mappings: let ⊂ ℝ be a nonempty convex subset of a real Banach space.…”
Section: B Theoretical Backgroundmentioning
confidence: 99%
See 1 more Smart Citation
“…This feature allows Darvishi's method to usually converge faster than NR employing less number of iterations and consuming less computation time 39 . However, this technique is quite weak 40 . To compensate for this drawback, Darvishi's method is combined with the Trapezoidal rule, 17 which provides robustness to the algorithm 40 …”
Section: Foundations and Remarksmentioning
confidence: 99%
“…Thus, if a PF solver is stable, its convergence is not guaranteed, but, if contrary, the PF solver would be unable to successfully converge. Unstable solvers are normally characterized by an erratic pattern in which the residuals tend to exponentially grow each iteration 40 …”
Section: Mathematical Backgroundmentioning
confidence: 99%