CN105786984B - It is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data memory method - Google Patents
It is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data memory method Download PDFInfo
- Publication number
- CN105786984B CN105786984B CN201610086031.2A CN201610086031A CN105786984B CN 105786984 B CN105786984 B CN 105786984B CN 201610086031 A CN201610086031 A CN 201610086031A CN 105786984 B CN105786984 B CN 105786984B
- Authority
- CN
- China
- Prior art keywords
- array
- node
- data
- storage
- memory cell
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 82
- 238000000354 decomposition reaction Methods 0.000 title claims abstract description 25
- 238000005516 engineering process Methods 0.000 title claims abstract description 6
- 238000003491 array Methods 0.000 claims description 9
- 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
- 238000007796 conventional method Methods 0.000 abstract description 11
- 239000011159 matrix material Substances 0.000 description 7
- 238000004458 analytical method Methods 0.000 description 2
- 239000003990 capacitor Substances 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009466 transformation 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
It is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data memory method, by Y in conventional method (n, 2n), B ' (n-1, n-1), B " (m; m) nonzero element of triangle is stored in by Y (n, d above and below array1)、B′(n‑1,d2)、B″(m,d3) in A (n, d) array for constituting of 3 virtual arrays, greatly reduce memory cell number and improve I in the read or write speed and PQ decomposition method Load flow calculation of data filepi、IqiOr Pi、QiCalculating speed, the quantity of memory cell is also greatly reduced, efficiency greatly improves.The present invention is compared with the traditional method, and such as to IEEE-118 node system, maximum storage unit number is only the 14.69% of the latter, and practical memory cell number is only the 6.66% of the latter, and the time of write-read data file is respectively the 14.32% and 7.29% of the latter.Number of nodes is more, and advantage of the invention is more obvious.
Description
Technical field
The invention belongs to electrical power system analysis and computing fields.
Background technique
It is related to multiple symmetrical, extremely sparse coefficient matrix applications in electric system in PQ decomposition method Load flow calculation.
If not considering the sparsity of these coefficient matrixes, the data of a large amount of neutral elements will lead in storage, reading and calculating process is deposited
The significant wastage of receptacle space, read-write data file and calculating process overlong time, computational efficiency are low.Accordingly, it is considered to sparse square
The storage mode of array element element not only can largely save memory cell, can also greatly reduce the storage, reading and calculating of data file
The time of process.
It needs to use 3 coefficient matrixes in PQ decomposition method Load flow calculation, wherein admittance matrix Y is used for calculate node electric current (Ipi、
Iqi) and node power (Pi、Qi), coefficient matrix B ' is for calculating voltage phase angle increment Delta δi, coefficient matrix B " is for calculating voltage
Amplitude increment Delta Vi.In traditional PQ decomposition method to the storage of this 3 coefficient matrix data, reading, using etc. have the disadvantage that
(1) acquisition modes of B ', B " array element element are unreasonable.
The simplest acquisition modes of B ', B " array element element are directly to be derived from the imaginary part of Y array element element, as long as storing 1 Y gusts in this way
Element, B ', B " array element element can be directly obtained from the data file of Y array element element.But if B ', B " array element in practical calculating
Element takes the imaginary part of Y array element element completely, such as to IEEE-118 node system, then PQ decomposition method Load flow calculation is not restrained, and
It is longer that iteration time then may cause to other systems.If only B ', B " array element element are identical but are different from the imaginary part of Y array element element,
Still the number of iterations or convergence of PQ decomposition method Load flow calculation may be influenced.Due to Y, B ', B, " composition of array element element is to convergence
Property or convergence rate be affected, therefore general Y, B ', B " array element element is different, to be related to answering for multiple data files
With.
(2) storage mode of Y, B ', B " array element element is unreasonable.
Due to Y, B ', B, " battle array is the extreme sparse matrix for having a large amount of neutral elements, corresponding array in traditional PQ decomposition method
Respectively Y (n, 2n), B ' (n-1, n-1), B " (m, m), wherein n is the number of nodes of system, and m is the PQ number of nodes of system.Y(n,
2n) array storage Y array element element, B ' (n-1, n-1), B " (m, m) array stores B ', B " array element element.By Y (n, 2n), B ' (n-1, n-
1), B " (m, m) array mode stores respective element, when will cause the significant wastage, read-write data file and calculating of memory space
Between it is too long and with Y (n, 2n) array calculate Ipi、IqiOr Pi、QiComputational efficiency it is extremely inefficient.If it is considered that element openness,
It is plain with the methods of coordinate storage, sequential storing, chained list storage storage Y, B ', B " array element, although many memory cells can be saved,
Due to its storage mode and structure is complicated, diagonal element separately stores with nondiagonal element so that the reading process of data is cumbersome, unfavorable
In the calculating and processing of data, I is calculatedpi、IqiOr Pi、QiWhen, the process for importing respective element is also complex, and efficiency is not yet
It is high.If it is considered that Y, B ', B, " symmetry of array element element only stores the nonzero element of triangle, obtains lower triangle according to symmetry
Nonzero element, then the assignment between the transformation of footmark, element also occupies many times, has no too big advantage.
(3) the storage number of Y, B ', B " battle array data file is more, access time is longer.
As traditionally to Y, B ', B, " three data files of battle array are stored respectively, then to be divided in flow calculation program
Three data files and data Da Kai not be read；If it is considered that element openness is by chained list memory method respectively to Y, B ', B " battle array
Stored, then the number for storing file is up to 9.The data file number of storage is more, then writes the time of data file
It is longer, also result in needed in PQ decomposition method flow calculation program open data file number it is more, read data file time
It is longer, it is particularly disadvantageous for the real-time calculating effect of PQ decomposition method.
Summary of the invention
In order to overcome the above-mentioned deficiencies of the prior art, the present invention propose it is a kind of based on Sparse technology can fast reading and writing electric power
System PQ decomposition method flow data memory method.
Array Y (n, 2n) that the present invention separately stores three in traditional PQ decomposition method Load flow calculation, B ' (n-1, n-1),
B " (m, m) is respectively with three virtual array Y (n, d1)、B′(n-1,d2)、B″(m,d3) substitution is corresponded to, array A is deposited in merging
In (n, d).In array A (n, d) in the line number (i), three arrays of storage host node each host node and nonzero element child node it
(Si1、Si2、Si3), in three arrays each host node and nonzero element child node row number j and parameter gij、bij.Array Y (n,
d1) Y gusts of information of storage, for calculating Ipi、IqiOr Pi、Qi；Array B ' (n-1, d2)、B″(m,d3) storage B ', B " battle array letter
Breath, for completing PQ decomposition method Load flow calculation.This storage mode is eliminated to Y, B ', B " storage of all neutral elements of battle array, greatly
Reduce memory space greatly, store the number of data file and the access time to data file, can quickly calculate Ipi、Iqi
Or Pi、Qi, B ', B " battle array are quickly formed, and storage mode is simple and clear.
The present invention is achieved by the following technical solutions.
It is of the present invention it is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data storage
Method, comprising the following steps:
Step 1: defining data file array A (n, d)；
(1) defining node corresponding with line number i is father node, and coupled nonzero element node is child node, and zero
The child node and parameter of element are not present in memory cell.
(2) three virtual arrays of definition storage Y, B ', B " array element element are Y (n, d1)、B′(n-1,d2)、B″(m,d3).Three
Stored in a array all father nodes and nonzero element child node row number j and corresponding parameter, father's section in respective each row
The sum of point and nonzero element child node are maximum non-zero entry prime number S1max、S2max、S3max。
(3) array Y (n, d1) the row number j of interdependent node, the real part and imaginary values of corresponding self-admittance and transadmittance are stored,
Maximum number of column is d1=3 × S1max；And array B ' (n-1, d2) and B " (m, d3) the storage row number 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) array, wherein d
=d1+d2+d3+4."+4 " are respectively line number column and S1max、S2max、S3maxThe count column at place, i.e., the 1st~4 column in table 1.
(5) the maximum storage unit number U of new methodmax.newIt is calculated 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 column and Y gusts of count columns；"+1 ": B ' battle array and B " battle array count column respectively.
Approximate maximum storage unit number of the invention is Ua.max.new=A (n, d)=n × d, there is Umax.new/Ua.max.new≈
90%, and do not change with the variation of number of nodes.
(6) practical memory cell number U of the inventionact.newBy each row SiThe sum of non-zero entry prime number of actual count calculates,
Uact.new=Y (n, d '1)+B′(n-1,d′2)+B″(m,d′3).Calculate analysis shows, the practical memory cell number of new method accounts for about
50% or so of new method maximum storage unit number, and percentage is reduced with the increase of number of nodes.
(7) A (n, d) array is divided into five groups, including " line number group ", " node array ", " Y gusts of groups ", " B ' battle array group ",
" B " battle array group ", Store form is as follows.
Line number group i: being used for inspection data, stores line number corresponding with father node, is located at the 1st column；
Node array Si1、Si2、Si3: it is used efficiently to read and write data, is located at the 2nd~4 column, storage Y, B ', B " each row in battle array
The sum of father node and nonzero element son node number, Si1、Si2、Si3Value is added up by program automatically to guarantee quickly and efficiently to read
The parameter of corresponding father node and nonzero element child node, so that practical memory cell number of the invention be made to deposit much smaller than its maximum
Storage unit number；
Y gusts of groups: for storage and Y (n, d1) the corresponding Y gusts of data of array are used, it is located at the 5th~(d1+ 4) it arranges, is passed by row number
Increase row number j and the corresponding self-admittance, the real part of transadmittance, imaginary values of sequential storing father node and nonzero element child node；
B ' battle array group: for storage and B ' (n-1, d2) the corresponding B ' battle array data of array are used, it is located at (d1+ 5)~(d1+d2+
4) it arranges, the row number j of father node and nonzero element child node and the void of corresponding self-admittance, transadmittance is stored by row number incremental order
Portion's value；
B " battle array group: for storage and B " (m, d3) array corresponding B " battle array data are used, it is located at (d1+d2+ 5)~(d1+d2+
d3+ 4) it arranges, by row number j and the corresponding self-admittance, transadmittance of row number incremental order storage father node and nonzero element child node
Imaginary values；
To in IEEE-118 node system, correspond to the S of n, n-1, m (=64)1max=10, S2max=9, S3max=5, i.e.,
Corresponding Y gusts of data are stored in the 5th~34 column, and B ' battle array data are stored in the 35th~52 column, and B " battle array data are stored in the 53rd~62
Column, therefore the corresponding array of the system A (n, d) array is A (118,62).Maximum of the present invention to A (118,62) array element
Storage mode is as shown in table 1.
Maximum storage mode of 1 present invention of table to IEEE-118 node system A (118,62) array element
Note: in table 1 in addition to containing the corresponding row of maximum nonzero element node, and not all memory cell has data, and
Using Si1、Si2、Si3It can guarantee that practical memory cell number is far smaller than maximum storage unit number, further increase the read-write of data
Efficiency.
Step 2: reading in all branches data from data file；
Step 3: calculating all elements of Y, B ', B " battle array and coexist in data in A (n, d) array；
Y array element element deposits in Y (n, d in A (n, d) array1) position where array, Y array element element generally includes all
Road parameter is formed by Y gusts of real and imaginary parts element, is only used for I in subsequent PQ decomposition method Load Flow Programpi、IqiOr Pi、Qi's
It calculates；B ', B " array element element deposit in B ' (n-1, d in A (n, d) array2)、B″(m,d3) position where array, it is used for rear onward encoding
Δ δ is solved in sequencei、ΔVi；To accelerate PQ decomposition method Load flow calculation speed, when calculating B ', B " array element element to the choice of parameter
Difference is generally removed line mutual-ground capacitor c during calculating B ' array element element and is removed during calculating B " array element element
Line resistance r；
Step 4: by the data write-in data file of A (n, d) array in case down-stream uses.
In view of the modularization of program, the program for forming A (n, d) array leaves it at that, and A (n, d) array data file
Calling then by PQ decomposition method flow calculation program execute.
The data file that A (n, the d) array stored in a manner described is opened in PQ decomposition method calculation procedure, will be corresponding
Y gusts of data directly read in Y (n, d1) array is to calculate the I of each nodepi、IqiOr Pi、Qi, corresponding B ', B " battle array data are straight
It connects and reads in B ' (n-1, n-1) and B " (m, m) array to solve Δ δi、ΔVi.The data of A (n, d) data file are read in than difference
Read in Y (n, 2n), the data required time of B ' (n-1, n-1) and B " (m, m) data file wants much less, and with Y (n, d1) number
Group calculates the I of each nodepi、IqiOr Pi、QiThan wanting much higher with the computational efficiency of Y (n, 2n) array.
The method of the present invention, will be right compared with the storage mode of traditional Y, B ', B for not considering element openness " array element element
The storage of multiple data files is simplified to the storage to 1 data file, will be simplified to only the storage of all data to non-zero
The storage of element.The memory cell of data and the access time to data file are not only greatly reduced, Y (n, d also can be used1)
Array directly calculates Ipi、IqiOr Pi、Qi, save the non-zero judgement or invalid computation of all elements.The method of the present invention with press coordinate
Store, be stored in order, being compared by the methods of chained list storage, still more reducing the memory cell and data file of data
Store quantity, improves the read or write speed to data file, and storage mode is more simple, calculation processing of follow-up data etc. is more
For convenience, quick.
Detailed description of the invention
Fig. 1 is the flow chart that the method for the present invention forms PQ decomposition method Load flow calculation data file.
Fig. 2 is the flow chart that conventional method forms PQ decomposition method Load flow calculation data file.
Specific embodiment
The present invention will be described further by embodiment.
Embodiment.It is respectively compared the traditional memory method for not considering sparsity and the chained list memory method for considering sparsity
And the plain required data file number of the method for the present invention storage node system of IEEE-30, -57, -118 Y, B ', B " array element, storage
The average time of unit number, data file read-write process.Table 2 gives the comparison result of various methods.
(1) comparison of data file number.
1) traditional memory method is respectively by Y, B ', B " array element element be stored in respectively Y (n, 2n), B ' (n-1, n-1) and B " (m,
M) in 3 arrays, therefore 3 data files are needed；
2) chained list memory method respectively stores 3 diagonal element, off-diagonal element, line number (chained list) arrays, therefore
Storing corresponding Y, B ', B " array element element respectively needs 9 arrays, also needs 9 data files；
3) Y, B ', B " array element element are stored in A (n, d) array by the method for the present invention jointly, it is only necessary to 1 data file；
(2) store the comparison of Y, B ', B " array element element unit number.
If n is the number of nodes of system, m is the PQ number of nodes of system；Per node on average is connected with 4 branches；Due to being
Complex matrix, Y array element element × 2.By taking IEEE-118 node system as an example, 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) it this method maximum storage unit number: is calculated 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 with the array of A (118,62).
4) the practical memory cell number of this method: by S in each rowiThe sum of the non-zero entry prime number of actual count calculate:
Uact.new=Y (n, d '1)+B′(n-1,d′2)+B″(m,d′3)=3039.
Above-mentioned comparison can be seen that maximum storage unit number of the invention and account for about conventional method memory cell number
14.69%, and reduced with the increase of number of nodes；Practical memory cell number of the invention accounts for about new method maximum storage unit
Several 50% or so, also with number of nodes increase and reduce；Practical memory cell number of the invention accounts for about conventional method storage
The 6.66% of unit number, likewise as number of nodes increase and substantially reduce；Practical memory cell number of the invention accounts for about chained list
The 52.06% of method memory cell number, likewise as number of nodes increase and reduce.Therefore number of nodes is bigger, what the present invention saved
Memory cell is more, and with Y (n, d1) array storage mode in the I for calculating each nodepi、IqiOr Pi、QiWhen, ratio was with Y (n, 2n)
The computational efficiency of array wants much higher.
Comparison of the various methods of table 2 to IEEE system data file access time and memory cell number
tw.c、tr.c、Uc: conventional method is averaged write-read time, required memory cell number to Y, B ', B " battle array data file；
tw.new、tr.new、Umax.new、Uact.new: the method for the present invention is averaged write-read time, institute to Y, B ', B " battle array data file
The maximum of need, practical memory cell number；
tw.new/tw.c、tr.new/tr.c、Umax.new/Uc、Uact.new/Uc: when the average write-read of the method for the present invention and conventional method
Between, the percentage of the percentage of maximum storage unit number, actually required memory cell number.
Ut、Uact.new/Ut: the practical memory cell number of memory cell number, the method for the present invention needed for chain technique and chain technique institute
Need the percentage of memory cell number；
It can be seen that
1. the memory cell number of the method for the present invention and the speed of write-read data file are significantly better than conventional method.
The method of the present invention is by 3 data file coexistences needed for PQ decomposition method in 1 array and conventional method is by 3
Data file separates storage mode and compares, and greatly reduces writing for the number of required data file, memory cell and data file
Read time.
Such as to IEEE-118 node system, the time that the method for the present invention writes data file is only the 14.32% of conventional method,
The time for reading data file is only the 7.29% of conventional method, and maximum storage unit number is only the 14.69% of conventional method, practical
Storage unit is only tradition 6.66%.
2. the memory cell number of the method for the present invention is equally better than considering the chained list storage mode of sparsity.
The method of the present invention only stores 1 data file, chain technique need to store 9 data files；The maximum of the method for the present invention
Relatively, but the practical memory cell number of the method for the present invention is about the 50% of chain technique for memory cell number and chain technique.
3. electric system number of nodes is more, the advantage of the method for the present invention data-storing and reading process is bigger.
The method of the present invention can't be dramatically increased with the increase memory cell of system node number, write-read data file when
Between will not dramatically increase.
4. due to simultaneously store Y, B ', B " battle array up and down triangle nonzero element, formed B ', B " factor table battle array,
Calculate Ii、Pi、QiWhen will be extremely convenient, and reading and writing data time or memory cell number and the side of only storing upper triangle nonzero element
Formula is compared almost without difference.
5. the read-write and application of asymmetric data files multiple for various engineering fields, the method for the present invention has same
Advantage.
The present invention can be realized using any programming language and programmed environment, use C++ programming language, exploitation here
Environment is Visual C++.
Claims (1)
1. it is a kind of based on Sparse technology can fast reading and writing electric system PQ decomposition method flow data memory method, feature includes
Following steps:
Step 1: defining data file array A (n, d)；
(1) defining 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) 3 virtual arrays of definition storage Y, B ', B " array element element are Y (n, d1)、B′(n-1,d2)、B″(m,d3)；Three numbers
Stored in group all father nodes and nonzero element child node row number j and corresponding parameter, in respective each row father node and
The sum of nonzero element child node is maximum non-zero entry prime number S1max、S2max、S3max；
(3) array Y (n, d1) the row number j of interdependent node, the real part and imaginary values of corresponding self-admittance and transadmittance are stored, it is maximum
Columns is d1=3 × S1max；And array B ' (n-1, d2) and B " (m, d3) the storage row number j of interdependent node, corresponding self-admittance and mutually
The imaginary values of admittance, the maximum number of column of two arrays are 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) array；
(5) maximum storage unit number U is definedmax.newWith practical memory cell number Uact.new；
(6) A (n, d) array is divided into five groups, including " line number group ", " node array ", " Y gusts of groups ", " B ' battle array group ", " B "
Battle array group ", Store form is as follows；
Line number group i: being used for inspection data, stores line number corresponding with father node；
Node array Si1、Si2、Si3: it is used efficiently to read and write data, storage Y, B ', B " each row father node and nonzero element in battle array
The sum of son node number, Si1、Si2、Si3Value is added up by program automatically to guarantee quickly and efficiently to read corresponding father node and non-
The parameter of neutral element child node；
Y gusts of groups: for storage and Y (n, d1) the corresponding Y gusts of data of array are used, store father node and non-zero by row number incremental order
The row number j of element child node and corresponding self-admittance, the real part of transadmittance, imaginary values；
B ' battle array group: for storage and B ' (n-1, d2) the corresponding B ' battle array data of array are used, by row number incremental order storage father node and
The row number j of nonzero element child node and the imaginary values of corresponding self-admittance, transadmittance；
B " battle array group: for storage and B " (m, d3) array corresponding B " battle array data are used, store father node and non-by row number incremental order
The row number j of neutral element child node and the imaginary values of corresponding self-admittance, transadmittance；
Step 2: reading in all branches data from data file；
Step 3: calculating all elements of Y, B ', B " battle array and coexist in data in A (n, d) array；
Y array element element deposits in Y (n, d in A (n, d) array1) position where array, Y array element element generally includes all branch parameters
It is formed by Y gusts of real and imaginary parts element, is only used for I in subsequent PQ decomposition method Load Flow Programpi、IqiOr Pi、QiCalculating；
B ', B " array element element deposit in B ' (n-1, d in A (n, d) array2)、B″(m,d3) position where array, in down-stream
Solve Δ δi、ΔVi；
Step 4: by the data write-in data file of A (n, d) array in case down-stream uses.
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 CN105786984A (en) | 2016-07-20 |
| CN105786984B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (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 |
| CN104158182B (en) * | 2014-08-18 | 2016-09-28 | 国家电网公司 | A kind of large scale electric network trend update equation Parallel implementation method |
| CN104714928B (en) * | 2015-01-20 | 2018-10-19 | 南昌大学 | A method of the Gaussian elimination method based on symmetrical and sparse technology seeks power system nodal impedance matrix |
| CN104732459A (en) * | 2015-03-31 | 2015-06-24 | 上海交通大学 | Large-scale power system ill-condition load flow analysis system |
| CN104933528B (en) * | 2015-06-24 | 2018-04-17 | 南昌大学 | A kind of method that Jacobian matrix during electric power system tide calculates quickly is formed based on sparse matrix technology |
-
2016
- 2016-02-15 CN CN201610086031.2A patent/CN105786984B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN105786984A (en) | 2016-07-20 |
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 | |
| CN104537003B (en) | A kind of general high-performance data wiring method of Hbase databases | |
| Wang et al. | Short-term load forecasting of power system based on time convolutional network | |
| CN104933143B (en) | Obtain the method and device of recommended | |
| CN110459258A (en) | The method of multi-memory built-in self-test based on multi-object clustering genetic algorithm | |
| 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 | |
| CN104714928B (en) | A method of the Gaussian elimination method based on symmetrical and sparse technology seeks power system nodal impedance matrix | |
| CN105354422B (en) | A method of polar coordinates Newton-Raphson approach trend is quickly sought based on symmetrical and sparse technology | |
| CN103034621A (en) | Address mapping method and system of radix-2*K parallel FFT (fast Fourier transform) architecture | |
| CN105591388B (en) | A kind of electric system rectangular co-ordinate PQ decomposition method flow data memory methods based on Sparse technology | |
| CN105045767B (en) | A kind of method of immediate access and reading power system sparse matrix data | |
| CN107807793B (en) | The storage of data copy isomery and access method in distributed computer storage system | |
| CN105786769B (en) | Application of method based on rapid data reading and symmetric sparse factor table in polar coordinate PQ decomposition method trend | |
| 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 | |
| CN116738983A (en) | Word embedding method, device and equipment for performing financial field task processing by model | |
| Valgaerts | Space-filling curves an introduction | |
| CN109344361B (en) | Method for quickly forming Jacobian matrix in power system load flow calculation | |
| CN105375468B (en) | A kind of method that rectangular co-ordinate Newton-Laphson method trend is quickly asked for based on symmetrical and sparse technology | |
| CN112817982A (en) | Dynamic power law graph storage method based on LSM tree | |
| CN110347705B (en) | Distributed Skyline query system and method | |
| US8565251B2 (en) | MAC address table collection in distributed switching systems | |
| CN107203635B (en) | Thumbnail constructing method of directed label graph in stream mode based on minimum thumbnail | |
| CN105703359A (en) | Application of sparse symmetric factor table method in PQ decomposition method-based load flow calculation in rectangular coordinate system |
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 |
Granted publication date: 20190201 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |