2019
DOI: 10.1016/j.epsr.2019.04.038
|View full text |Cite
|
Sign up to set email alerts
|

Fast and reliable uncertain power flow analysis by affine arithmetic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…In the existing affine algorithm, scholars express the form of every interval parameter from x=true[xtrue¯,xtrue¯true] to affine form xtruê (Coletta et al , 2019; Vaccaro and Canizares, 2017): where x 0 is the central value of xtruê, x i is the increment of xtruê, ε i ∈ [−1, 1]. Although this method can avoid the problem of correlation, it needs to transform every interval parameter into affine form, which increases the workload.…”
Section: Statement Of the Problemmentioning
confidence: 99%
“…In the existing affine algorithm, scholars express the form of every interval parameter from x=true[xtrue¯,xtrue¯true] to affine form xtruê (Coletta et al , 2019; Vaccaro and Canizares, 2017): where x 0 is the central value of xtruê, x i is the increment of xtruê, ε i ∈ [−1, 1]. Although this method can avoid the problem of correlation, it needs to transform every interval parameter into affine form, which increases the workload.…”
Section: Statement Of the Problemmentioning
confidence: 99%
“…Further, to enhance the robustness and L-stability of the approach, a backward Euler method was utilized in [9]. To solve uncertain PF analysis, an affine arithmetic method was explored in [10]. In [11], the application of two cubic methods, namely, Darvishi and Weerakoon-like approaches was examined to solve PF studies.…”
Section: Introductionmentioning
confidence: 99%