2022
DOI: 10.1080/00051144.2022.2039989
|View full text |Cite
|
Sign up to set email alerts
|

Recursive versus nonrecursive Richardson algorithms: systematic overview, unified frameworks and application to electric grid power quality monitoring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…The error model ( 21) is obtained via explicit evaluation of (22). The algorithm ( 16) -( 21) has two independent and equally complex computational parts: the first part is associated with calculations of Γ k , L k and Γ n k , where [33].…”
Section: Convergence Rate Improvement Via Combination Of High Order N...mentioning
confidence: 99%
See 1 more Smart Citation
“…The error model ( 21) is obtained via explicit evaluation of (22). The algorithm ( 16) -( 21) has two independent and equally complex computational parts: the first part is associated with calculations of Γ k , L k and Γ n k , where [33].…”
Section: Convergence Rate Improvement Via Combination Of High Order N...mentioning
confidence: 99%
“…It is assumed that the voltage signals can be described by the model (32) with harmonic regressor (33) and fundamental frequency of 60 Hertz with four higher harmonics and unknown parameter vector ϑ. The model of the signals is given by (34) with the vector of the parameters θ * k which estimates unknown vector ϑ.…”
Section: Fault Detection On Real Datamentioning
confidence: 99%
“…The Nonrecursive Richardson algorithm described, for example, in [6] and [14], which requires matrix-vector multiplications, can be used directly for the calculation of the parameters 𝜃 𝑘 in ( 1)…”
Section: Nonrecursive Richardson Algorithmmentioning
confidence: 99%
“…The spectral radius of the matrix (𝐼 − 𝛼𝐴 𝑘 ) gets its minimal value (1 − 𝜆 ̂𝑚𝑖𝑛 (𝐴 𝑘 )𝛼) for the SPD matrix 𝐴 𝑘 for the preconditioner (14), where 𝜆 ̂𝑚𝑖𝑛 (𝐴 𝑘 ) and 𝜆 ̂𝑚𝑎𝑥 (𝐴 𝑘 ) are the estimates of minimal and maximal eigenvalues of 𝐴 𝑘 , respectively. In other words, the preconditioner ( 14) maps the interval containing all eigenvalues of 𝐴 𝑘 onto symmetric interval around the origin [15].…”
Section: Preconditioning Based On the Properties Of The Windowmentioning
confidence: 99%
See 1 more Smart Citation