The fast preconditioned Landweber iteration algorithm for grounding grid fault diagnosis

In this paper, we will use the method that shifts the positions of the exciters among the touchable nodes and measures as much as possible for each excitation. As the equations obtained by linearizing the question are underdetermined, the fast projected-Landweber algorithm is used. The first part of...

Full description

Saved in:
Bibliographic Details
Published in2010 2nd International Conference on Mechanical and Electronics Engineering Vol. 2; pp. V2-33 - V2-36
Main Authors Yao Yao, Wanting Deng, Zhenhua Zhu, Tao Jin
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2010
Subjects
Accessible nodes
Equations
fast
Grounding grid
Loss measurement
Mathematical model
Position measurement
projected-Landweber
Testing
Online AccessGet full text

Cover

More Information
Summary:In this paper, we will use the method that shifts the positions of the exciters among the touchable nodes and measures as much as possible for each excitation. As the equations obtained by linearizing the question are underdetermined, the fast projected-Landweber algorithm is used. The first part of the scheme uses the preconditioning matrix to accelerate the iterative process, and the second part maintains the algorithm stable by projected-Landweber algorithm. The preconditioning matrix is calculated by an iterative algorithm for generalized inverse, and an optimized step length function is incorporated into the prior-iterative scheme. The convergence condition for grounding grid fault diagnosis problems is also discussed. It shows that it is easy to meet the convergence condition and convenient to choose the parameters of the preconditioning matrix. The results of the calculation, and the measurements in practical examples show that the proposed method is feasible.
ISBN:1424474795
9781424474790
DOI:10.1109/ICMEE.2010.5558492