CN105574353B - Generator saturation coefficient computational methods based on two points of iterative methods - Google Patents
Generator saturation coefficient computational methods based on two points of iterative methods Download PDFInfo
- Publication number
- CN105574353B CN105574353B CN201610042030.8A CN201610042030A CN105574353B CN 105574353 B CN105574353 B CN 105574353B CN 201610042030 A CN201610042030 A CN 201610042030A CN 105574353 B CN105574353 B CN 105574353B
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- munderover
- msubsup
- sigma
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000000205 computational method Methods 0.000 title claims abstract description 10
- 238000012360 testing method Methods 0.000 claims abstract description 16
- 238000004364 calculation method Methods 0.000 claims abstract description 8
- 238000012937 correction Methods 0.000 claims description 6
- 238000013459 approach Methods 0.000 claims description 3
- 238000005259 measurement Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Z—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS, NOT OTHERWISE PROVIDED FOR
- G16Z99/00—Subject matter not provided for in other main groups of this subclass
Abstract
The present invention provides a kind of generator saturation coefficient computational methods based on two points of iterative methods, it is directed to the no-load curve obtained in no-load characteristic test, can be in the case of containing interference data, saturation coefficient is calculated, the accurate deciphering to test data is realized, is calculated for generator excited system parameter and accurate foundation is provided.This method avoids error caused by manually recognizing, with the result of calculation more more precisely consistent than artificial interpretation, the problem of avoiding different artificial sentence read result differences, principle based on least square method is fitted, the mean square deviation of matched curve is minimum, the two points of iterative methods used, less iterations can be used to obtain result of calculation, and be suitable for the test data containing interference.
Description
Technical field
The present invention relates to a kind of generator no-load curve saturation coefficient computational methods, are specifically that one kind is based on two points of iterative methods
Generator saturation coefficient computational methods.
Background technology
During generator excited system parameter calculates, saturation coefficient a, b and n calculating are a key parameters, the parameter
It is defined as follows：
If=aU+b (U)n
Wherein IfIt is the perunit value that exciting current is measured after generator no-load characteristic measurement is carried out, U is to carry out generator
After no-load characteristic measurement, the perunit value of set end voltage is measured.
The parameter directly affects the dynamic characteristic of generator excited system, be generator excited system key parameter it
One.It is the accurate key for calculating generator excited system parameter accurately to calculate saturation coefficient by generator no-load curve.
The computational methods being widely used at present, only use on air gap line and no-load saturation curve, correspond to 1 times and 1.2 respectively
Exciting current value at times load voltage value is calculated：
Wherein IfB、IfJIt is to correspond to the exciting current value at 1 times and 1.2 times of load voltage values on power generator air gap line respectively,
If0、IfKIt is to correspond to the exciting current value at 1 times and 1.2 times of load voltage values on generator no-load curve respectively.
Understand that saturation coefficient is determined by generator no-load characteristic test curve by above formula, but generator in full size field test
The test result of no-load curve is influenceed by various disturbing factors in environment, often containing certain disturbance.And saturation coefficient pair
If0, IfKNumerical requirements it is high, carry out identification by artificial experience and be likely to occur larger error, and be difficult to ensure that different interpretations
As a result uniformity.
The content of the invention
The present invention provides a kind of generator saturation coefficient computational methods based on two points of iterative methods, and it is directed to no-load characteristic
The no-load curve obtained in experiment, saturation coefficient can be calculated, realize to testing number in the case of containing interference data
According to accurate deciphering, for generator excited system parameter calculate accurate foundation is provided.
A kind of generator saturation coefficient computational methods based on two points of iterative methods, comprise the following steps：
(1) by generator no-load characteristic test, one group of generator no-load test data is obtained：
X={ Ii,Ui, i=1,2 ..., m；
Wherein UiFor the set end voltage value measured, IiFor the exciting current value measured, m is the positive integer more than or equal to 2；
(2) by principle of least square method, following iterative equation group is established：
Wherein a, b and n are generator saturation coefficient.From principle of least square method, meet the saturation coefficient a, b of above formula
There is the mean square deviation of minimum with the curve of n fittings.
(3) from variable n some initial value n1Set out, according to preceding two formula of step (2)：
Solve variable a1、b1；
(4) a that will be solved1、b1The 3rd formula left side for substituting into step (2) together is calculated, if result is more than 0, is reduced
N numerical value；If result is less than 0, increase n numerical value：
(5) two formulas solve variable a again before n correction values are substituted into2、b2, and substitute into the 3rd formula together and carry out calculation and check；
(6) repeat step (4)-(5) reversion on the left of the 3rd formula, and make：
nj=0.5 (nj-1+nj-2)
(7) two formulas solve variable a again before n correction values are substituted into2、b2, and the 3rd formula is substituted into together；
(8) Approach by inchmeal is carried out to n using dichotomy：
(9) above procedure (7)-(8) are circulated.When absolute value is less than 1E-8 on the left of the 3rd equation, you can must meet
Saturation coefficient a, b, n of condition.
Beneficial effects of the present invention：
1st, there is the result of calculation more more precisely consistent than artificial interpretation, avoid that different artificial sentence read result is different asks
Topic；
2nd, the principle based on least square method is fitted, and the mean square deviation of matched curve is minimum；
3rd, the two points of iterative methods used, less iterations can be used to obtain result of calculation.
Brief description of the drawings
Fig. 1 is the test data schematic diagram that the present invention uses；
Fig. 2 is the schematic diagram of the saturation coefficient n iteration calculated using the present invention.
Embodiment
The present invention provides a kind of generator saturation coefficient computational methods based on two points of iterative methods, comprises the following steps：
(1) by generator no-load characteristic test, one group of generator no-load test data is obtained：
X={ Ii,Ui, i=1,2 ..., m；
Wherein UiFor the set end voltage value measured, IiFor the exciting current value measured, m is the positive integer more than or equal to 2；
(2) by principle of least square method, following iterative equation group is established：
Wherein a, b and n are generator saturation coefficient.From principle of least square method, meet the saturation coefficient a, b of above formula
There is the mean square deviation of minimum with the curve of n fittings.
(3) from variable n some initial value n1Set out, according to preceding two formula of step (2)：
Solve variable a1、b1：
(4) a that will be solved1、b1The 3rd formula left side for substituting into step (2) together is calculated, if result is more than 0, is reduced
N numerical value；If result is less than 0, increase n numerical value：
(5) two formulas solve variable a again before n correction values are substituted into2、b2, and substitute into the 3rd formula together and carry out calculation and check；
(6) repeat step (4)-(5) reversion on the left of the 3rd formula, and make；
nj=0.5 (nj-1+nj-2)
(7) two formulas solve variable a again before n correction values are substituted into2、b2, and the 3rd formula is substituted into together；
(8) Approach by inchmeal is carried out to n using dichotomy：
(9) above procedure (7)-(8) are circulated.When absolute value is less than 1E-8 on the left of the 3rd equation, you can must meet
Saturation coefficient a, b, n of condition.
Below in conjunction with the accompanying drawing and instantiation in the present invention, the technical scheme in the present invention is carried out clear, complete
Ground describes.
Certain synchronous generator carries out no-load characteristic test, and measurement is obtained shown in no-load characteristic Fig. 1.Read experimental test
Data, it is as follows to obtain one group of no-load characteristic data：
Initial n=4 is given, substitutes into first, second formula of iterative equation group：
It can be solved by above formula
By a, b and substitute into together on the left of the 3rd formula：
Left term is less than zero, increases n value：
N=4+1=5
Cycle calculations successively, as a result it see the table below：
When iterating to the 5th time, during n=8, the 3rd formula left term reversion, this season：
n6=0.5 (n5+n4)=7.5
Continue to iterate to calculate, it is as a result as follows：
When iterating to the 17th time (as shown in Figure 2), left term is less than 1E-8, and iteration terminates, the saturation system now obtained
Number is：
The foregoing is only a specific embodiment of the invention, but protection scope of the present invention is not limited thereto, any
Belong to those skilled in the art the invention discloses technical scope in, the change or replacement that can readily occur in, all should
It is included within the scope of the present invention.Therefore, protection scope of the present invention should be defined by scope of the claims.
Claims (1)
1. a kind of generator saturation coefficient computational methods based on two points of iterative methods, it is characterised in that comprise the following steps：
(1) by generator no-load characteristic test, one group of generator no-load test data is obtained：
X={ Ii,Ui, i=1,2 ..., m；
Wherein UiFor the set end voltage value measured, IiFor the exciting current value measured, m is the positive integer more than or equal to 2；
(2) following iterative equation group is established：
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mo>(</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mn>2</mn>
</msubsup>
</mstyle>
<mo>)</mo>
<mi>a</mi>
<mo>+</mo>
<mo>(</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
</mstyle>
<mo>)</mo>
<mi>b</mi>
<mo>=</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
</mstyle>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>(</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
</mstyle>
<mo>)</mo>
<mi>a</mi>
<mo>+</mo>
<mo>(</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mn>2</mn>
<mi>n</mi>
</mrow>
</msubsup>
</mstyle>
<mo>)</mo>
<mi>b</mi>
<mo>=</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
</mstyle>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>(</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<mrow>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
</mrow>
</mstyle>
<mo>)</mo>
<mi>a</mi>
<mo>+</mo>
<mo>(</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<mrow>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mn>2</mn>
<mi>n</mi>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
</mrow>
</mstyle>
<mo>)</mo>
<mi>b</mi>
<mo>-</mo>
<mstyle>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<mrow>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mn>0</mn>
</mrow>
</mstyle>
</mtd>
</mtr>
</mtable>
</mfenced>
Wherein a, b and n are generator saturation coefficient；
(3) from variable n some initial value n1Set out, according to preceding two formula of step (2)：
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mn>2</mn>
</msubsup>
<mo>)</mo>
<msub>
<mi>a</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>)</mo>
<msub>
<mi>b</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>)</mo>
<msub>
<mi>a</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mn>2</mn>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
</mrow>
</msubsup>
<mo>)</mo>
<msub>
<mi>b</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
</msubsup>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
Solve variable a1、b1；
(4) a that will be solved1、b1The 3rd formula left side for substituting into step (2) together is calculated, if result is more than 0, reduces n's
Numerical value；If result is less than 0, increase n numerical value：
<mrow>
<msub>
<mi>n</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>,</mo>
<mi>i</mi>
<mi>f</mi>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>a</mi>
<mo>+</mo>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mn>2</mn>
<mi>n</mi>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>b</mi>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>></mo>
<mn>0</mn>
<mo>,</mo>
</mrow>
<mrow>
<msub>
<mi>n</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mn>1</mn>
<mo>,</mo>
<mi>i</mi>
<mi>f</mi>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>a</mi>
<mo>+</mo>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mn>2</mn>
<mi>n</mi>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>b</mi>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo><</mo>
<mn>0</mn>
<mo>,</mo>
</mrow>
(5) preceding two formula that n correction value is substituted into step (2) solves variable a again2、b2, and the 3rd of step (2) is substituted into together
Formula carries out calculation and check；
(6) repeat step (4)-(5) reversion on the left of the 3rd formula, and make：
nj=0.5 (nj-1+nj-2)
(7) preceding two formula that n correction value is substituted into step (2) solves variable a again2、b2, and the 3rd of step (2) is substituted into together
Formula；
(8) Approach by inchmeal is carried out to n using dichotomy：
<mrow>
<msub>
<mi>n</mi>
<mi>j</mi>
</msub>
<mo>=</mo>
<mn>0.5</mn>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mrow>
<mi>j</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>+</mo>
<mi>min</mi>
<mo>(</mo>
<mrow>
<msub>
<mi>n</mi>
<mrow>
<mi>j</mi>
<mo>-</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>n</mi>
<mrow>
<mi>j</mi>
<mo>-</mo>
<mn>3</mn>
</mrow>
</msub>
</mrow>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mi>f</mi>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>a</mi>
<mo>+</mo>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mn>2</mn>
<mi>n</mi>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>b</mi>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>></mo>
<mn>0</mn>
</mrow>
<mrow>
<msub>
<mi>n</mi>
<mi>j</mi>
</msub>
<mo>=</mo>
<mn>0.5</mn>
<mrow>
<mo>(</mo>
<msub>
<mi>n</mi>
<mrow>
<mi>j</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>+</mo>
<mi>max</mi>
<mo>(</mo>
<mrow>
<msub>
<mi>n</mi>
<mrow>
<mi>j</mi>
<mo>-</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>n</mi>
<mrow>
<mi>j</mi>
<mo>-</mo>
<mn>3</mn>
</mrow>
</msub>
</mrow>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mi>f</mi>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>a</mi>
<mo>+</mo>
<mrow>
<mo>(</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mrow>
<mn>2</mn>
<mi>n</mi>
</mrow>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mi>b</mi>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msub>
<mi>I</mi>
<mi>i</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>U</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
<mo>&CenterDot;</mo>
<mi>ln</mi>
<mi> </mi>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
<mo><</mo>
<mn>0</mn>
</mrow>
(9) above procedure (7)-(8) are circulated, when absolute value is less than 1E-8 on the left of the 3rd equation, you can condition must be met
Saturation coefficient a, b, n.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610042030.8A CN105574353B (en) | 2016-01-22 | 2016-01-22 | Generator saturation coefficient computational methods based on two points of iterative methods |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610042030.8A CN105574353B (en) | 2016-01-22 | 2016-01-22 | Generator saturation coefficient computational methods based on two points of iterative methods |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105574353A CN105574353A (en) | 2016-05-11 |
| CN105574353B true CN105574353B (en) | 2017-11-24 |
Family
ID=55884478
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610042030.8A Active CN105574353B (en) | 2016-01-22 | 2016-01-22 | Generator saturation coefficient computational methods based on two points of iterative methods |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105574353B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102073012A (en) * | 2009-11-20 | 2011-05-25 | 华北电力科学研究院有限责任公司 | Method and system for obtaining parameters of synchronous generator |
| CN102510263A (en) * | 2011-10-25 | 2012-06-20 | 中国电力科学研究院 | Method for identifying practical parameters of synchronous generator on basis of load rejection test and numerical difference |
-
2016
- 2016-01-22 CN CN201610042030.8A patent/CN105574353B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102073012A (en) * | 2009-11-20 | 2011-05-25 | 华北电力科学研究院有限责任公司 | Method and system for obtaining parameters of synchronous generator |
| CN102510263A (en) * | 2011-10-25 | 2012-06-20 | 中国电力科学研究院 | Method for identifying practical parameters of synchronous generator on basis of load rejection test and numerical difference |
Non-Patent Citations (2)
| Title |
|---|
| Measurement of the saturation characteristics in the quadrature axis of synchronous machines;Kar N C et.;《IEEE Transactions on Energy Conversion》;20061231;第21卷(第3期);第690-698页 * |
| 考虑磁饱和效应的同步电机建模与参数辨识;蔡然;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;20141015(第10期);第C042-95页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105574353A (en) | 2016-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103455716B (en) | A kind of power system voltage stabilization margin calculation method based on super short-period wind power prediction | |
| CN105305438B (en) | New energy power station model verification method based on impedance and controlled AC voltage source | |
| CN105184027A (en) | Power load modeling method based on interactive multi-model algorithm | |
| CN108599239A (en) | A kind of droop control type isolated island micro-capacitance sensor voltage quality probability evaluation method of failure | |
| CN107846023A (en) | A kind of improved network loss duty value direct current optimal power flow computational methods | |
| CN103336882A (en) | Evaluation method of overall process dynamic voltage stabilization margin based on time domain simulation | |
| CN102904519A (en) | Robust excitation system parameter identification method based on exponential-type target function | |
| CN106786567A (en) | A kind of online load modeling method based on PMU noise like data | |
| CN104104097A (en) | Method for evaluating sub-synchronous oscillation of sending out system of wind power generation set | |
| CN115549139A (en) | New energy power generation and load hybrid model identification modeling method | |
| CN101788608B (en) | Method for evaluating reactance parameters of independent three-winding transformer | |
| CN104734127A (en) | Self-adaptation ground distance protection method and system | |
| CN105574353B (en) | Generator saturation coefficient computational methods based on two points of iterative methods | |
| CN104036148A (en) | Inner-node loosening and expanding method capable of automatically correcting infeasible constraints in optimal power flow calculation | |
| CN101814738A (en) | Method for evaluating reactive power adequacy of power system based on heuristic energy function | |
| CN105229477B (en) | The method that area of computer aided determines power network impedance | |
| CN108258725A (en) | A kind of double-fed fan motor machine Dynamic Equivalence based on the equivalent generator rotor angle people having the same aspiration and interest | |
| CN106981872A (en) | A kind of Operation of Electric Systems reliability determination method and device | |
| CN107167658A (en) | A kind of jamproof power system fundamental frequency of high accuracy and Method for Phase Difference Measurement | |
| CN108123434B (en) | Method for calculating slope of PV curve to obtain operating point of PV curve | |
| CN110098610A (en) | The real-time identification method and system of power system oscillation dominant pattern under fault disturbance | |
| CN107086603A (en) | A kind of Random-fuzzy Continuation power flow of power system containing DFIG | |
| CN104037756B (en) | A kind of Power System Stability Assessment method containing Complex Power device model | |
| CN106203883A (en) | A kind of based on interval power distribution network small-signal stability computational methods | |
| CN103576120A (en) | Calibration and self-healing algorithm for third-harmonic component quasi-synchronous information transmission |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |