CN105786984A - Rapid-reading-writing electric-power-system PQ-decomposition-method flow data storage method based on sparse technology - Google Patents
Rapid-reading-writing electric-power-system PQ-decomposition-method flow data storage method based on sparse technology Download PDFInfo
- Publication number
- CN105786984A CN105786984A CN201610086031.2A CN201610086031A CN105786984A CN 105786984 A CN105786984 A CN 105786984A CN 201610086031 A CN201610086031 A CN 201610086031A CN 105786984 A CN105786984 A CN 105786984A
- Authority
- CN
- China
- Prior art keywords
- array
- node
- data
- row
- data file
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 99
- 238000005516 engineering process Methods 0.000 title claims abstract description 7
- 238000013500 data storage Methods 0.000 title abstract description 3
- 238000003860 storage Methods 0.000 claims abstract description 57
- 238000003491 array Methods 0.000 claims abstract description 11
- 238000000354 decomposition reaction Methods 0.000 claims description 22
- 238000000151 deposition Methods 0.000 claims description 8
- 230000007935 neutral effect Effects 0.000 claims description 6
- 238000007689 inspection Methods 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 abstract description 12
- 230000003247 decreasing effect Effects 0.000 abstract 2
- 239000011159 matrix material Substances 0.000 description 7
- 230000014759 maintenance of location Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 239000003990 capacitor Substances 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000010205 computational analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 239000011800 void material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Human Resources & Organizations (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Public Health (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Complex Calculations (AREA)
Abstract
The invention discloses a rapid-reading-writing electric-power-system PQ-decomposition-method flow data storage method based on the sparse technology.The method includes the step that nonzero elements at the upper triangles and the lower triangles of arrays of Y(n, 2n), B'(n-1, n-1) and B''(m, m) in a traditional method are stored into an A(n, d) array formed by three virtual arrays of Y(n, d<1>), B'(n-1, d<2>) and B''(m, d<3>).The number of storage units is greatly decreased, the reading-writing speed of a data file and the calculating speed of I<pi> or I<qi> or P<i> or Q<i> during PQ-decomposition-method flow calculation are increased, the number of the storage units is also greatly decreased, and efficiency is greatly improved.Compared with the traditional method, the method has the advantages that as for an IEEE-118 node system, the largest number of the storage units is only 14.69% of that of the traditional method, the practical number of the storage units is only 6.66% of that of the traditional method, the data file writing time and the data file reading time are 14.32% and 7.29% of the data file writing time and the data file reading time of the traditional method respectively, and the larger the number of nodes is, the more obvious the advantages of the method are.
Description
Technical field
The invention belongs to Electrical power system analysis and computing field.
Background technology
Power system relates in PQ decomposition method Load flow calculation coefficient matrix application multiple symmetry, the most sparse.
If not considering the openness of these coefficient matrixes, the data of a large amount of neutral elements can cause depositing during storing, reading and calculate
Process time is long, computational efficiency is low for the significant wastage of receptacle space, read-write data file and calculating.Accordingly, it is considered to sparse square
The storage mode of array element element not only can save memory cell in a large number, also can greatly reduce the storage of data file, read and calculate
The time of process.
Needing to use 3 coefficient matrixes in PQ decomposition method Load flow calculation, wherein admittance matrix Y is used for calculating node current (Ipi、
Iqi) and node power (Pi、Qi), coefficient matrix B ' is used for calculating voltage phase angle increment Delta δi, coefficient matrix B " is used for calculating voltage
Amplitude increment Delta Vi.In tradition PQ decomposition method to the storage of these 3 coefficient matrix data, read, application etc. has the disadvantage that
(1) " the acquisition mode of array element element is unreasonable for B ', B.
B ', B " the array element simplest acquisition mode of element is directly to take from the imaginary part of Y array element element, if so 1 Y battle array of storage
Element, " array element element can directly obtain from the data file of Y array element element for B ', B.If but B ', B " array element in Practical Calculation
Element takes the imaginary part of Y array element element completely, and as to systems such as IEEE-118 nodes, then PQ decomposition method Load flow calculation is not restrained, and
Other system then may cause iteration time longer.If only B ', B " array element element is identical but is different from the imaginary part of Y array element element,
Still iterations or the convergence of PQ decomposition method Load flow calculation may be affected.Due to Y, B ', B, " composition of array element element is to convergence
Property or convergence rate impact relatively big, therefore general Y, B ', B " array element element is different, thus relate to multiple data file should
With.
(2) " storage mode of array element element is unreasonable for Y, B ', B.
Due to Y, B ', B, " battle array is the extreme sparse matrix of a large amount of neutral element, array corresponding in tradition PQ decomposition method
" (m, m), wherein n is the nodes of system, and m is the PQ nodes of system to be respectively Y (n, 2n), B ' (n-1, n-1), B.Y(n,
2n) array deposits Y array element element, B ' (n-1, n-1), B, and " (" array element is plain for m, m) array deposits B ', B.By Y (n, 2n), B ' (n-1, n-
1), " (m, m) array mode stores respective element to B, when can cause the significant wastage of memory space, read-write data file and calculate
Between long and with Y (n, 2n) array calculate Ipi、IqiOr Pi、QiComputational efficiency extremely inefficient.If it is considered that element is openness,
With method storage Y, B ', B such as coordinate storage, sequential storing, chained list storages " array element element, although many memory cells can be saved, but
Owing to its storage mode and structure are complicated, diagonal element and nondiagonal element separate to store and make the reading process of data loaded down with trivial details, unfavorable
In calculating and the process of data, calculate Ipi、IqiOr Pi、QiTime, the process importing respective element is the most complex, and efficiency is the most not
High." symmetry of array element element only stores the nonzero element of triangle, obtains lower triangle according to symmetry if it is considered that Y, B ', B
Nonzero element, then the assignment between the conversion of footmark, element also takies a lot of time, there is no the biggest advantage.
(3) " the storage number of battle array data file is more, access time is longer for Y, B ', B.
As traditionally to Y, B ', B, " three data files of battle array are stored respectively, then to divide in flow calculation program
Do not open three data files and read data；If it is considered that element openness by chained list memory method respectively to Y, B ', B " battle array
Store, then the number storing file is up to 9.The data file number of storage is the most, then write the time of data file
The longest, again result in and PQ decomposition method flow calculation program needs the time that the data file number opened is more, read data file
Longer, be particularly disadvantageous for PQ decomposition method calculates effect in real time.
Summary of the invention
In order to overcome above-mentioned the deficiencies in the prior art, the present invention propose a kind of can the electric power of fast reading and writing based on Sparse technology
System PQ decomposition method flow data memory method.
The present invention by three arrays Y separately deposited (n, 2n) in tradition PQ decomposition method Load flow calculation, B ' (n-1, n-1),
" (m, m) respectively with three virtual array Y (n, d for B1)、B′(n-1,d2)、B″(m,d3) corresponding replacement, merge and deposit in array A
(n, d) in.Array A (n, d) in deposit in the line number (i) of host node, three arrays each host node and nonzero element child node it
(Si1、Si2、Si3), the row j of each host node and nonzero element child node and parameter g in three arraysij、bij.Array Y (n,
d1) storage Y battle array information, be used for calculating Ipi、IqiOr Pi、Qi；Array B ' (n-1, d2)、B″(m,d3) storage B ', the B " letter of battle array
Breath, has been used for PQ decomposition method Load flow calculation.This storage mode eliminates Y, B ', B " storage of all neutral elements of battle array, greatly
Decrease greatly memory space, the number of storage data file and the access time to data file, can quickly calculate Ipi、Iqi
Or Pi、Qi, quickly form B ', B " and battle array, and storage mode is simple and clear.
The present invention is achieved by the following technical solutions.
Of the present invention a kind of based on Sparse technology can fast reading and writing power system PQ decomposition method flow data storage
Method, comprises the following steps:
Step 1: definition data file array A (n, d)；
(1) defining the node corresponding with line number i is father node, and coupled nonzero element node is child node, and zero
Child node and the parameter of element are not present in memory cell.
(2) Y, B ', B are deposited in definition, and " three virtual arrays of array element element are Y (n, d1)、B′(n-1,d2)、B″(m,d3).Three
Individual array is all deposited the row j of all father nodes and nonzero element child node and corresponding parameter, father's joint in its most each row
Point and nonzero element child node sum are maximum non-zero entry prime number S1max、S2max、S3max。
(3) array Y (n, d1) deposit the row j of interdependent node, corresponding self-admittance and the real part of transadmittance and imaginary values, its
Maximum number of column is d1=3 × S1max；And array B ' (n-1, d2) and B " (m, d3) deposit the row j of interdependent node, corresponding self-admittance
With the imaginary values of transadmittance, the maximum number of column of two arrays is respectively d2=2 × S2max, d3=2 × S3max。
(4) by Y (n, d1)、B′(n-1,d2)、B″(m,d3) data of three arrays coexist in A (n, d) in array, wherein d
=d1+d2+d3+4."+4 " are respectively line number row and S1max、S2max、S3maxThe 1st～4 row in the count column at place, i.e. table 1.
(5) maximum storage unit number U of new methodmax.newCalculate by non-zero entry prime number maximum in each row,
Umax.new=U1max+U2max+U3max=Y (n, d1)+B′(n-1,d2)+B″(m,d3)
=n × (d1+2)+(n-1)×(d2+1)+m×(d3+1)。
Note: "+2 ": for line number row and Y battle array count column；"+1 ": B ' battle array and B " battle array count column respectively.
The approximation maximum storage unit number of the present invention is Ua.max.new(n, d)=n × d have U to=Amax.new/Ua.max.new≈
90%, and do not change along with the change of nodes.
(6) the actual memory cell number U of the present inventionact.newBy each row SiThe non-zero entry prime number sum of actual count calculates,
Uact.new=Y (n, d '1)+B′(n-1,d′2)+B″(m,d′3).Computational analysis shows, the actual memory cell number of new method accounts for
About the 50% of new method maximum storage unit number, and percentage reduces along with the increase of nodes.
(7) by A (n, d) array is divided into five groups, including " line number group ", " node array ", " Y battle array group ", " B ' battle array group ",
" B " battle array group ", Store form is as follows.
Line number group i: be used for inspection data, deposit the line number corresponding with father node, is positioned at the 1st row；
Node array Si1、Si2、Si3: it is used for efficiently read-write data, is positioned at the 2nd～4 row, " each row in battle array of depositing Y, B ', B
Father node and nonzero element son node number sum, its Si1、Si2、Si3Value is added up to ensure to read quickly and efficiently by Automatic Program
Corresponding father node and the parameter of nonzero element child node, so that the actual memory cell number of the present invention is deposited much smaller than its maximum
Storage unit number；
Y battle array group: for depositing and Y (n, d1) Y battle array data corresponding to array are used, and are positioned at the 5th～(d1+ 4) row, press row number and pass
Increase sequential storing father node and the row j of nonzero element child node and corresponding self-admittance, the real part of transadmittance, imaginary values；
B ' battle array group: for depositing and B ' (n-1, d2) B ' battle array data corresponding to array are used, and are positioned at (d1+ 5)～(d1+d2+
4) row, press row incremental order storage father node and the row j of nonzero element child node and corresponding self-admittance, the void of transadmittance
Portion is worth；
B " battle array group: for depositing and B " (m, d3) " battle array data are used B corresponding to array, are positioned at (d1+d2+ 5)～(d1+d2+
d3+ 4) row, press row incremental order storage father node and the row j of nonzero element child node and corresponding self-admittance, transadmittance
Imaginary values；
To in IEEE-118 node system, corresponding to the S of n, n-1, m (=64)1max=10, S2max=9, S3max=5, i.e.
Corresponding Y battle array data leave the 5th～34 row in, and B ' battle array data leave the 35th～52 row in, and " battle array data leave the 53rd～62 in B
Row, therefore (n, d) array that array is corresponding is A (118,62) to this system A.The present invention maximum to A (118,62) array element
Storage mode is as shown in table 1.
Table 1 present invention maximum storage mode to IEEE-118 node system A (118,62) array element
Note: in table 1 in addition to the row corresponding containing maximum nonzero element node, the most all of memory cell has data, and
Application Si1、Si2、Si3Can ensure that actual memory cell number is far smaller than maximum storage unit number, improve the read-write of data further
Efficiency.
Step 2: read in all branches data from data file；
" data are also coexisted in A (n, d) in array step 3: calculate Y, B ', B by all elements of battle array；
Y array element element deposits in A (n, d) Y (n, d in array1) position at array place, Y array element element generally includes all
The real part of the Y battle array that LUSHEN number is formed and imaginary part element, be only used for I in follow-up PQ decomposition method Load Flow Programpi、IqiOr Pi、Qi's
Calculate；" array element element deposits in A (n, d) B ' (n-1, d in array for B ', B2)、B″(m,d3) position at array place, for rear onward
Sequence solves Δ δi、ΔVi；For accelerating PQ decomposition method Load flow calculation speed, calculate B ', B " during array element element to the choice of parameter
Difference, typically removes line mutual-ground capacitor c during calculating B ' array element element and " removes during array element element calculating B
Line resistance r；
Step 4: (n, d) the data write data file of array is in case down-stream uses by A.
In view of the modularity of program, (n, d) program of array leaves it at that, and A (n, d) array data file to form A
Call then by PQ decomposition method flow calculation program perform.
(n, d) data file of array, by corresponding to open the A that stores in a manner described in PQ decomposition method calculation procedure
Y battle array data directly read in Y (n, d1) array is to calculate the I of each nodepi、IqiOr Pi、Qi, by corresponding B ', B, " battle array data are straight
Connect reading B ' (n-1, n-1) and B " (m, m) array is to solve Δ δi、ΔVi.(n, d) data of data file ratio is respectively to read in A
Read in Y (n, 2n), B ' (n-1, n-1) and B " (m, m) the data required time of data file wants much less, and with Y (n, d1) number
Group calculates the I of each nodepi、IqiOr Pi、QiMore much higher than by the computational efficiency of Y (n, 2n) array.
The inventive method does not considers, with traditional, Y, B ', B that element is openness " compared with the storage mode of array element element, by right
The storage of multiple data files is simplified to the storage to 1 data file, will be simplified to the storage of all data only to non-zero
The storage of element.Not only greatly reduce the memory cell of data and the access time to data file, can also be used with Y (n, d1)
Array directly calculates Ipi、IqiOr Pi、Qi, the non-zero saving all elements judges or invalid computation.The inventive method with by coordinate
Storage, in order storage, compare by methods such as chained list storages, the most more decrease the memory cell of data and data file
Storage quantity, improves the read or write speed to data file, and storage mode is the simplest, and the calculating process of follow-up data etc. is more
For convenience, quick.
Accompanying drawing explanation
Fig. 1 is the flow chart that the inventive method forms PQ decomposition method Load flow calculation data file.
Fig. 2 is the flow chart that traditional method forms PQ decomposition method Load flow calculation data file.
Detailed description of the invention
The present invention will be described further by embodiment.
Embodiment.It is respectively compared traditional not considering openness memory method and consider openness chained list memory method
And the inventive method storage IEEE-30 ,-57 ,-118 node system Y, B ', B " data file number needed for array element element, storage
The average time of unit number, data file read-write process.Table 2 gives the comparative result of various method.
(1) comparison of data file number.
1) tradition memory method respectively by Y, B ', B " array element element leaves Y (n, 2n), B ' (n-1, n-1) and B respectively in " (m,
M), in 3 arrays, 3 data files are therefore needed；
2) diagonal element, off-diagonal element, line number (chained list) are stored, therefore by chained list memory method respectively by 3 arrays
" array element element needs 9 arrays, also needs 9 data files to store corresponding Y, B ', B respectively；
3) the inventive method is by Y, B ', B, and " array element element leaves A jointly in, and (n, d) in array, it is only necessary to 1 data file；
(2) storage Y, B ', B " comparison of array element element unit number.
If n is the nodes of system, m is the PQ nodes of system；Per node on average and 4 branch roads are connected；Owing to being
Complex matrix, Y array element element × 2.As a example by IEEE-118 node system, n=118, m=64.
1) Traditional Method memory cell number: Uc=n × 2 × n+ (n-1) × (n-1)+m × m=45633；
2) chain technique memory cell number: Ut=(2n+2N+N)=(2n+3N)=(14 × n)=5838；
3) this method maximum storage unit number: calculate by non-zero entry prime number maximum in each row:
Umax.new=U1max+U2max+U3max=n × (d1+2)+(n-1)×(d2+1)+m×(d3+ 1)=6703；
To IEEE-118 node system, all relevant informations can be stored by the array of A (118,62).
4) this method actual memory cell number: by S in each rowiActual count non-zero entry prime number sum calculate:
Uact.new=Y (n, d '1)+B′(n-1,d′2)+B″(m,d′3)=3039.
Above-mentioned compare it can be seen that the maximum storage unit number of the present invention accounts for traditional method memory cell number
14.69%, and reduce along with the increase of nodes；The actual memory cell number of the present invention accounts for new method maximum storage unit
About the 50% of number, reduces also with the increase of nodes；The actual memory cell number of the present invention accounts for traditional method storage
The 6.66% of unit number, substantially reduces likewise as the increase of nodes；The actual memory cell number of the present invention accounts for chained list
The 52.06% of method memory cell number, reduces likewise as the increase of nodes.Therefore nodes is the biggest, and the present invention saves
Memory cell is the most, and with Y (n, d1) array storage mode calculate each node Ipi、IqiOr Pi、QiTime than with Y (n, 2n)
The computational efficiency of array is much higher.
The various method of table 2 is to IEEE system data file access time and the comparison of memory cell number
tw.c、tr.c、Uc: traditional method is to Y, B ', B " battle array data file average write-read time, required memory cell number；
tw.new、tr.new、Umax.new、Uact.new: the inventive method is to Y, B ', B " battle array data file average write-read time, institute
The maximum needed, actual memory cell number；
tw.new/tw.c、tr.new/tr.c、Umax.new/Uc、Uact.new/Uc: during the average write-read of the inventive method and traditional method
Between, the percentage ratio of maximum storage unit number, the percentage ratio of actually required memory cell number.
Ut、Uact.new/Ut: actual memory cell number and the chain technique institute of memory cell number, the inventive method needed for chain technique
Need the percentage ratio of memory cell number；
It can be seen that
1. the memory cell number of the inventive method and the speed of write-read data file are significantly better than traditional method.
The inventive method is by 3 data file coexistences needed for PQ decomposition method in 1 array, and traditional method is by 3
Data file separately storage mode is compared, and greatly reduces writing of the number of desired data file, memory cell and data file
Read time.
As to IEEE-118 node system, the inventive method is write the time of data file and is only the 14.32% of traditional method,
The time reading data file is only the 7.29% of traditional method, and maximum storage unit number is only the 14.69% of traditional method, actual
Memory element is only tradition 6.66%.
2. the memory cell number of the inventive method is better than considering openness chained list storage mode equally.
The inventive method only stores 1 data file, chain technique need to store 9 data files；The maximum of the inventive method
Relatively, but the actual memory cell number of the inventive method is about the 50% of chain technique for memory cell number and chain technique.
3. power system nodes is the most, and the advantage of the inventive method data-storing and the process of reading is the biggest.
The inventive method can't dramatically increase along with the increase memory cell of system node number, write-read data file time
Between also will not dramatically increase.
4. owing to storing Y, B ', B simultaneously " nonzero element of the upper and lower triangle of battle array, therefore formed B ', B " factor table battle array,
Calculate Ii、Pi、QiTime by extremely convenient, and reading and writing data time or the side of memory cell number triangle nonzero element upper with only storage
Formula is compared almost without difference.
5. the read-write of asymmetric data files multiple for various engineering fields and application, the inventive method has same
Advantage.
The present invention can use any programming language and programmed environment to realize, and uses C++ programming language, exploitation here
Environment is Visual C++.
Claims (1)
1. based on Sparse technology can the power system PQ decomposition method flow data memory method of fast reading and writing, its feature includes
Following steps:
Step 1: definition data file array A (n, d)；
(1) defining the node corresponding with line number i is father node, and coupled nonzero element node is child node, and neutral element
Child node and parameter be not present in memory cell；
(2) Y, B ', B are deposited in definition, and " 3 virtual arrays of array element element are Y (n, d1)、B′(n-1,d2)、B″(m,d3)；Three numbers
Group is all deposited the row j of all father nodes and nonzero element child node and corresponding parameter, in its most each row father node and
Nonzero element child node sum is maximum non-zero entry prime number S1max、S2max、S3max；
(3) array Y (n, d1) deposit the row j of interdependent node, corresponding self-admittance and the real part of transadmittance and imaginary values, it is maximum
Columns is d1=3 × S1max；And array B ' (n-1, d2) and B " (m, d3) deposit the row j of interdependent node, corresponding self-admittance and mutually
The imaginary values of admittance, the maximum number of column of two arrays is respectively d2=2 × S2max, d3=2 × S3max；
(4) by Y (n, d1)、B′(n-1,d2)、B″(m,d3) data of three arrays coexist in A (n, d) in array；
(5) definition maximum storage unit number Umax.newWith actual memory cell number Uact.new；
(6) by A, (n, d) array is divided into five groups, including " line number group ", " node array ", " Y battle array group ", " B ' battle array group ", " B "
Battle array group ", Store form is as follows；
Line number group i: be used for inspection data, deposit the line number corresponding with father node；
Node array Si1、Si2、Si3: it is used for efficiently read-write data, deposit Y, B ', B " each row father node and nonzero element in battle array
Son node number sum, its Si1、Si2、Si3Value is added up to ensure to read quickly and efficiently corresponding father node and non-by Automatic Program
The parameter of neutral element child node；
Y battle array group: for depositing and Y (n, d1) Y battle array data corresponding to array are used, and press row incremental order storage father node and non-zero
The row j of element child node and corresponding self-admittance, the real part of transadmittance, imaginary values；
B ' battle array group: for depositing and B ' (n-1, d2) B ' battle array data corresponding to array are used, press row incremental order storage father node and
The row j of nonzero element child node and corresponding self-admittance, the imaginary values of transadmittance；
B " battle array group: for depositing and B " (m, d3) " battle array data are used B corresponding to array, press row incremental order storage father node and non-
The row j of neutral element child node and corresponding self-admittance, the imaginary values of transadmittance；
Step 2: read in all branches data from data file；
" data are also coexisted in A (n, d) in array step 3: calculate Y, B ', B by all elements of battle array；
Y array element element deposits in A (n, d) Y (n, d in array1) position at array place, Y array element element generally includes all branch parameters
The real part of the Y battle array formed and imaginary part element, be only used for I in follow-up PQ decomposition method Load Flow Programpi、IqiOr Pi、QiCalculating；
" array element element deposits in A (n, d) B ' (n-1, d in array for B ', B2)、B″(m,d3) position at array place, in down-stream
Solve Δ δi、ΔVi；
Step 4: (n, d) the data write data file of array is in case down-stream uses by A.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610086031.2A CN105786984B (en) | 2016-02-15 | 2016-02-15 | It is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data memory method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610086031.2A CN105786984B (en) | 2016-02-15 | 2016-02-15 | It is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data memory method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105786984A true CN105786984A (en) | 2016-07-20 |
| CN105786984B CN105786984B (en) | 2019-02-01 |
Family
ID=56403281
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610086031.2A Expired - Fee Related CN105786984B (en) | 2016-02-15 | 2016-02-15 | It is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data memory method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105786984B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105591388A (en) * | 2016-03-08 | 2016-05-18 | 南昌大学 | Electric power system rectangular coordinate PQ decomposition method tidal data storage method based on sparse technology |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103441496A (en) * | 2013-09-04 | 2013-12-11 | 博爱县电业公司 | MATLAB-based electric-power-system load-flow calculation method |
| CN104158182A (en) * | 2014-08-18 | 2014-11-19 | 国家电网公司 | Large-scale power grid flow correction equation parallel solving method |
| CN104714928A (en) * | 2015-01-20 | 2015-06-17 | 南昌大学 | Method for solving node impedance matrix of electric system on basis of Gaussian elimination method of sparse symmetric matrix technology |
| CN104732459A (en) * | 2015-03-31 | 2015-06-24 | 上海交通大学 | Large-scale power system ill-condition load flow analysis system |
| CN104933528A (en) * | 2015-06-24 | 2015-09-23 | 南昌大学 | Method for quickly forming jacobian matrix in electric system load flow calculation based on sparse matrix technology |
-
2016
- 2016-02-15 CN CN201610086031.2A patent/CN105786984B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103441496A (en) * | 2013-09-04 | 2013-12-11 | 博爱县电业公司 | MATLAB-based electric-power-system load-flow calculation method |
| CN104158182A (en) * | 2014-08-18 | 2014-11-19 | 国家电网公司 | Large-scale power grid flow correction equation parallel solving method |
| CN104714928A (en) * | 2015-01-20 | 2015-06-17 | 南昌大学 | Method for solving node impedance matrix of electric system on basis of Gaussian elimination method of sparse symmetric matrix technology |
| CN104732459A (en) * | 2015-03-31 | 2015-06-24 | 上海交通大学 | Large-scale power system ill-condition load flow analysis system |
| CN104933528A (en) * | 2015-06-24 | 2015-09-23 | 南昌大学 | Method for quickly forming jacobian matrix in electric system load flow calculation based on sparse matrix technology |
Non-Patent Citations (2)
| Title |
|---|
| 周茜等: "基于P-Q解耦的可用输电能力的计算分析", 《电力科学与工程》 * |
| 许康等: "四川变电站仿真系统的技术创新浅析", 《四川电力技术》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105591388A (en) * | 2016-03-08 | 2016-05-18 | 南昌大学 | Electric power system rectangular coordinate PQ decomposition method tidal data storage method based on sparse technology |
| CN105591388B (en) * | 2016-03-08 | 2018-08-03 | 南昌大学 | A kind of electric system rectangular co-ordinate PQ decomposition method flow data memory methods based on Sparse technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105786984B (en) | 2019-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104317553B (en) | Method for fast forming, reading and writing power system node admittance matrix data based on sparse matrix technology | |
| CN104933528B (en) | A kind of method that Jacobian matrix during electric power system tide calculates quickly is formed based on sparse matrix technology | |
| CN103440246A (en) | Intermediate result data sequencing method and system for MapReduce | |
| CN104537003B (en) | A kind of general high-performance data wiring method of Hbase databases | |
| Korb et al. | Real-time renormalization group and cutoff scales in nonequilibrium applied to an arbitrary quantum dot in the Coulomb blockade regime | |
| CN105354422B (en) | A method of polar coordinates Newton-Raphson approach trend is quickly sought based on symmetrical and sparse technology | |
| CN104714928B (en) | A method of the Gaussian elimination method based on symmetrical and sparse technology seeks power system nodal impedance matrix | |
| CN110459258A (en) | The method of multi-memory built-in self-test based on multi-object clustering genetic algorithm | |
| CN102799617A (en) | Construction and query optimization methods for multiple layers of Bloom Filters | |
| CN105786984B (en) | It is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data memory method | |
| CN109710542A (en) | A kind of completely N-ary tree construction method and device | |
| CN103034621A (en) | Address mapping method and system of radix-2*K parallel FFT (fast Fourier transform) architecture | |
| CN105045767B (en) | A kind of method of immediate access and reading power system sparse matrix data | |
| CN105591388B (en) | A kind of electric system rectangular co-ordinate PQ decomposition method flow data memory methods based on Sparse technology | |
| CN110018882A (en) | A kind of virtual machine performance prediction technique based on width study | |
| CN117539408A (en) | Integrated index system for memory and calculation and key value pair memory system | |
| CN105786769B (en) | Application of method based on rapid data reading and symmetric sparse factor table in polar coordinate PQ decomposition method trend | |
| CN117892051A (en) | Line graph convolutional neural network-based power grid power flow calculation method after line fault | |
| CN107632830B (en) | Register allocation method and system for overflow optimization | |
| CN109741421A (en) | A kind of Dynamic Graph color method based on GPU | |
| CN109284476A (en) | The method that member that nonzero element is stored at random and random symmetric disappears seeks electric system node impedance | |
| CN105375468B (en) | A kind of method that rectangular co-ordinate Newton-Laphson method trend is quickly asked for based on symmetrical and sparse technology | |
| US8565251B2 (en) | MAC address table collection in distributed switching systems | |
| CN105703359A (en) | Application of sparse symmetric factor table method in PQ decomposition method-based load flow calculation in rectangular coordinate system | |
| CN103942158B (en) | A kind of self learning system with intelligent optimization recursion instruction functions of modules |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190201 |