Proceedings of 2011 International Conference on Electronic &Amp; Mechanical Engineering and Information Technology 2011
DOI: 10.1109/emeit.2011.6023095
|View full text |Cite
|
Sign up to set email alerts
|

Research and application of Successive Over-Relaxation Iterative Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…The successive over‐relaxation (SOR) iterative algorithm is used to solve Laplace's equation under the boundary condition U T , U s and E T . The space potential at the ( i +1)th iteration step can be calculated by [26] Ux,y,z(i+1)=Ux,y,z(i)+ω6Ux±L,y±L,z±Lfalse(ifalse)6Ux,y,zfalse(ifalse)where U x,y,z is the space potential at the point ( x , y , z ), ω is the SOR factor. The factor ω is selected as 1.95 in the subsequent simulation.…”
Section: Proposed Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The successive over‐relaxation (SOR) iterative algorithm is used to solve Laplace's equation under the boundary condition U T , U s and E T . The space potential at the ( i +1)th iteration step can be calculated by [26] Ux,y,z(i+1)=Ux,y,z(i)+ω6Ux±L,y±L,z±Lfalse(ifalse)6Ux,y,zfalse(ifalse)where U x,y,z is the space potential at the point ( x , y , z ), ω is the SOR factor. The factor ω is selected as 1.95 in the subsequent simulation.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…The successive over-relaxation (SOR) iterative algorithm is used to solve Laplace's equation under the boundary condition U T , U s and E T . The space potential at the (i+1)th iteration step can be calculated by [26]…”
Section: Lightning Strike Modelmentioning
confidence: 99%
“…This process will stop after all subdomains are solved, and the fields are denoted as E(0). For the iteration at the (n + 1)th step, the new fields are computed using a rule of the form where the parameter α is called the (over) relaxation parameter [16], while in each iteration, we define the relative 2 error as…”
Section: Complete System Matrix Equationmentioning
confidence: 99%
“…To verify the convergence of NCRG scheme, we compare it with two other benchmark algorithms: the Jacobi iteration approach and the SOR iteration approach . The Jacobi iteration equation is xi(k)=βi1+βicljixi(k1). The SOR iteration equation is xi(k)=(1ω)xi(k1)+ωβi1+βiclj<ixj(k)j>ixj(k1), where ω ∈(0,2).…”
Section: Performance Evaluationmentioning
confidence: 99%
“…To verify the convergence of NCRG scheme, we compare it with two other benchmark algorithms: the Jacobi iteration approach [37] and the SOR iteration approach [39]. The Jacobi iteration equation is…”
Section: Performance Evaluation Of Non-cooperative Cloud Resource Allmentioning
confidence: 99%