An Improved Measurement Placement Algorithm for Network Observability
|
|
- Rudolf Lewis
- 5 years ago
- Views:
Transcription
1 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 4, NOVEMBER An Improved Measurement Placement Algorithm for Network Observability Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper presents a fast method for multiple measurement placement for systems that are found to be unobservable. Upon placement of multiple measurements, all observable islands will be merged together and the entire system will be rendered fully observable. The method uses a test matrix whose leading dimension is determined by the rank deficiency of the gain matrix. Therefore, even for very large systems, as long as the number of measurements to be placed is relatively low, proposed method will maintain its computational advantage. Compared to the existing iterative approaches, this method directly provides the entire set of additional measurements for placement. The method is developed based on authors previous work [4] where a direct method for observability analysis was presented. Index Terms Measurement placement, multiple measurement placement, observability analysis, observable islands, test matrix, triangular factors updating with multiple rank. I. INTRODUCTION OBSERVABILITY analysis of power systems involves checking the rank of the state estimation gain matrix, which is sparse, symmetric and positive definite for observable systems. This can be accomplished by topological [1] or by numerical [2], [3] methods. If the gain matrix is found singular, then all observable islands need to be identified and injection pseudo-measurements will have to be introduced in order to merge these islands into a single observable island for the entire system. The process of choosing the right set of additional measurements for this purpose is referred to as the measurement placement. Pseudo-measurements are typically generated from load forecasts, scheduled generation data, or some other source with a degree of uncertainty. Hence, pseudo-measurements are usually of injection type. It is assumed that a set of such pseudo-measurements exits. Further, it can be shown that the eligible candidates for placement in a given islanded system will be those taken at the boundary buses of observable islands [1]. The approach taken in the past for multiple measurement placement has been to place one candidate boundary injection at a time each time updating the observable islands and hence the candidate list. This procedure is repeated until enough candidates are placed to merge all observable islands together. In this paper, an alternative and direct procedure which accomplishes Manuscript received February 11, 2000; revised March 2, B. Gou was with the Department of Electrical Engineering, Texas A&M University, College Station, TX He is currently with ABB Energy Information Systems, Santa Clara, CA ( beigou@ee.tamu.edu). A. Abur is with the Department of Electrical Engineering, Texas A&M University, College Station, TX ( abur@ee.tamu.edu). Publisher Item Identifier S (01) this same task, will be presented. The main idea behind the proposed method is the use of the test matrix, which has been introduced in [4] in order to simultaneously process the candidate measurements and make the final selection in a noniterative and fast manner. II. MOTIVATION The measurement placement algorithm presented in this paper is based on the observability analysis method introduced earlier in [4]. This method will be briefly reviewed first in order to show the motivation behind the algorithm developed in this paper. Consider the real power versus phase angle part of the linearized and decoupled measurement equation. This is obtained by using the first order approximation of the decoupled nonlinear measurement equation around an operating point: where mismatch between the measured and calculated real power measurements; decoupled Jacobian of the real power measurements versus all bus phase angles; incremental change in the bus phase angles at all buses including the slack bus; measurement error vector. The decoupled gain matrix for the real power measurements can be formed as: where, measurement error covariance matrix is assumed to be the identity matrix without loss of generality. Note that, since the slack bus is also included in the formulation, the rank of (and ) will be at most ( being the number of buses), even for a fully observable system. This leads to the triangular factorization of a singular and symmetric gain matrix. The symmetric matrix can be decomposed into its Cholesky factors where the diagonal factor, may have one or more zeros on its diagonal. Taking the inverse of and collecting only those rows of corresponding to the zero diagonals of, we can form a rectangular submatrix which is called the test matrix and denoted by in [4]. Computation of can be done very efficiently via the use of back substitutions. The following algorithm can then be used to determine all the observable islands simultaneously as shown in [4]: Step 1 Form the gain matrix and perform the triangular factorization. (1) (2) /01$ IEEE
2 820 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 4, NOVEMBER 2001 Step 2 Check if has only one zero pivot. If yes, stop. If not, compute the test matrix from. Step 3 Compute the matrix, where is the branch-node incidence matrix. If at least one entry in a row is not zero, then the corresponding branch will be unobservable. Step 4 Remove all the unobservable branches, to obtain the observable islands. Step 5 Stop. The above algorithm is noniterative, which makes it computationally very efficient. Thus, it will be used to initialize the multiple measurement placement algorithm developed in this paper. III. MULTIPLE MEASUREMENT PLACEMENT In this section, a new method which will identify all the necessary measurements to be added to an existing measurement set in order to render an observable system, will be presented. Assume that the symmetric gain matrix is expressed in terms of its factors as, and the rank deficiency of the diagonal matrix is. Further assume that a set of pseudo-measurements, whose Jacobian matrix is, are chosen from the candidate measurements. The new gain matrix will then be given by: Denoting a singleton vector by, let us choose the vector to be: Substituting (5) for in (4) will yield: which concludes the proof. We can extend this proposition to the following one. Proposition 3.2: Let be the diagonal factor of gain matrix and be a row vector. If is of full rank, then will also have full rank. Proof: Suppose is singular, i.e., any row of it can be expressed as a linear combination of the rest. Let and. Then, for, there exist a set of scalars,, such that (5) (6) (7) and for : Let, then we have: can be reordered to make the last diagonal entries zero: (3) Multiplying (7) by and (8) by, the scaler can be solved: (8) (9) Similar ordering of will yield: Equation (7) can then be rewritten as: where is a matrix, is a matrix whose rows are those of corresponding to the zero diagonals in. The following propositions and lemma are introduced in order to present a theorem, which will facilitate the development of the multiple measurement placement algorithm. Proposition 3.1: If is the diagonal factor of gain matrix, then the diagonal elements of will all be nonnegative. Proof: Suppose the gain matrix is factorized as by the proposed singular triangular factorization in [4]. Since is definite, i.e., for any row vector, the following equation is satisfied: (4) (10) Based on the above proposition for all. Thus, the left hand side of (10) will always be positive, while the right hand side will always be negative or zero, implying contradiction. Hence, the following lemma can be introduced. Lemma 3.1: Let be the diagonal factor of gain matrix and be a row vector. If has full rank, then will have full rank. Proof: The proof will be carried out by induction. Lemma is shown to be true for the special case of,by proposition 3.2.
3 GOU AND ABUR: AN IMPROVED MEASUREMENT PLACEMENT ALGORITHM FOR NETWORK OBSERVABILITY 821 Now, let us suppose it holds for let:. Then, for Let now consider matrix. (11) where is a row vector. Forming the matrix product: (12) Since is a real symmetric matrix with full rank, it can be factorized as: (13) where has full rank by the assumption. So, (12) can be rewritten as: (17) where. During the above derivation, the following formula is used: (14) Using proposition 3.2,, will have full rank. This concludes the proof. We now present the following theorem, which follows from the above propositions and the lemma. Theorem 3.1: Let the triangular factors of the gain matrix be. Assume the rank deficiency of diagonal matrix is, and a set of pseudo-measurements are chosen from the candidate measurements. The pseudo-measurements, whose Jacobian matrix is, will modify the old gain matrix by. Then, the new gain matrix will have full rank if and only if matrix is of full rank. Proof: From (3), we know that the rank of is decided by the rank of, since is of full rank. According to the above reordering of and,wehave: (15) Since is of full rank, and by lemma 3.1, then the inverse of exists. So, the triangular factorization can reduce the above matrix to: where (16) From (17), it is always true that Assume that is of full rank, then we have (18) (19) must be equal to since is a matrix. Then we conclude that the rank of is totally decided by since is of full rank. This ends the proof. The above theorem implies a simple method to determine a minimal set of pseudo-measurements in a single step. This set of pseudo-measurements will be guaranteed by Theorem 3.1 to make the whole system observable. The selection criteria will be that the matrix must have full rank. This matrix can be easily computed as the product of the test matrix and the Jacobian matrix of the pseudo-measurements chosen from the candidate measurements, Since the rank deficiency of a measurement system is generally small, the computation of will be fast. A pseudo-measurement is called a candidate if it is an available injection measurement connecting different observable islands, which can make at least one zero diagonal entry of nonzero by [4, Theorem 3.1]. The definition of candidate pseudo-measurements here is the same as those given in [2], [3]. After forming the product, the matrix can be transformed into its rectangular Echelon form, by Gaussian elimination [5]. Following the columns with nonzero pivots in the Echelon form will yield the corresponding measurements as the minimal set of candidates to be chosen for observability. Note that the number of such measurements will be exactly equal to the rank deficiency of the gain matrix.
4 822 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 4, NOVEMBER 2001 Thus, the steps of the proposed multiple measurement placement algorithm will be given as follows: Step 1 Form the gain matrix and perform the triangular factorization. Step 2 Check if has only one zero pivot. If yes, stop. If not, form the test matrix. Step 3 Using the test matrix to find the observable islands. Step 4 Form the candidate list. Those injection measurements, which connect at least two different observable islands, should be included in the list if those pseudo-measurements are available. Step 5 Form the rectangular matrix, and reduce it to its Echelon form. The candidates will correspond to the linearly independent columns in. A. Comparison With the Method [3] This section presents a comparative evaluation of the proposed method with that of [3] in order to demonstrate their conceptual equivalence, but computational differences. In the sequel, the algorithm of [3] will be referred to as algorithm 1 and the proposed algorithm of this paper will be called algorithm 2. Algorithm 1 decomposes the gain matrix by assigning 1 s at the diagonal entries whenever a zero pivot is encountered, as opposed to algorithm 2 where these zero entries are left as they are, yielding a singular diagonal factor. If the triangular factors of the gain matrix obtained by algorithm 2 and 1 by,, and by,, respectively then, the following equation gives the relation between these two different factorizations: (20) where is the pseudo-measurements corresponding to the zero pivots. In algorithm 1, the residuals for all the angle pseudomeasurements have to be computed in order to find out if the added pseudo-measurement can increase the rank of the gain matrix. After an injection pseudo-measurement is added into the existing measurement set, if at least one of the residuals is nonzero, then the corresponding angle pseudo-measurement will be moved out since it will now become redundant. Now we will briefly show that this process is equivalent to checking the nonzeros in corresponding to the zero pivots given in Theorem 3.1 in [4]. Before the addition of an injection pseudo-measurement, algorithm 1 first needs to solve the following equation: (21) where is the angle solution before the addition of ; is the measurement vector containing all zeros except for the angle pseudo-measurements with arbitrarily assigned integer values, such as, etc. Factorizing and pre-multiplying both sides by : (22) Note that the submatrix within corresponding to the nonzero rows of and, is an identity matrix. Thus, pre-multiplying these arrays by does not change any of the entries in these arrays. Hence, (22) can be rewritten as below: After introducing, the above equation becomes: (23) (24) where is the new angle solution after the introduction of. Pre-multiplying the above equation by, we obtain: (25) Let us denote by, and denote by. Then can be solved by the compensation method: where. We can rewrite (26) as below: (26) (27) Since all the entries in rows of corresponding to the zero pivots are zero except for a 1 on the diagonal, the entries in corresponding to zero pivots will appear as the difference of angles of and corresponding to the zero pivots. Hence, if the corresponding entries in the right hand side vector are not zero, those differences will also not be zero. As for the right hand side vector, is a diagonal matrix, hence we only need to study the rest part of the right hand side. We also know is a scalar, therefore, the values of those differences are totally decided by. If the elements in corresponding to zero pivots are all zero, then differences of angles in and corresponding to zero pivots must be zero; if the elements in corresponding to zero pivots have at least one non zero value, then there exists non zero differences of angles in and corresponding to at least one zero pivot. Therefore, instead of checking the values of angle residuals, we can compute the values of. This naturally requires less computational effort. The above result implies the modification of algorithm 1 as follows: Step 1 Form gain matrix. Perform singular triangular factorization of. If only one zero pivot occurs, stop. Step 2 Determine the set of nodes that do not have any injection measurement and whose adjacent branches have at least one nonzero flow. These nodes are candidates to have injection pseudo-measurements. If there is no candidate nodes, stop. Else
5 GOU AND ABUR: AN IMPROVED MEASUREMENT PLACEMENT ALGORITHM FOR NETWORK OBSERVABILITY 823 Step 3 Introduce an injection pseudo-measurement at one of the candidate nodes and compute. Step 4 Check if has any nonzero elements corresponding to the zero diagonals in. If yes and rank deficiency of the new gain matrix is still bigger than 1, update the singular triangular factors of new gain matrix; if no, select another candidate, and repeat step 3. Step 5 Return to Step 2. The above modified algorithm is now computationally more efficient since it requires one triangular decomposition rather than two in each iteration. However, the computation time can be further reduced if the triangular decomposition step can be avoided altogether. The procedure of triangular decomposition can be expressed as: Fig. 1. Measurement configuration of IEEE 14 bus system... computing its triangular factors, a diagonal factor is obtained with three zero diagonals indicating an unobservable system. (28) Let us suppose that sequential updating of the triangular factors times and simultaneous multiple-rank ( rank) updating of the triangular factors have the same computational complexity. Then the above process can be assumed to have a computation complexity of the Gaussian elimination of the matrix, where. However, Theorem 3.1 implies the Gaussian elimination of the whole matrix is not necessary. We only need to do the Gaussian elimination of the small submatrix of, i.e., matrix. Hence, algorithm 2 will require less computational effort to achieve the same results provided by algorithm 1. Applying the method of [4], the test matrix is computed and the matrix is formed. This yields the unobservable branches as: 5 6, 6 10, 10 11, 9 11, 9 14 and Removing all the unobservable branches one obtains the observable islands as: { }, { }, {10}, {11} and {14}. All the candidates can then be found. They are injections at bus 5, 6, 10, 11, and 13. The Jacobian matrix corresponding to the candidate injections is then formed and multiplied by to obtain the matrix as below: IV. SIMULATION RESULTS The proposed algorithm for the multiple measurement placement problem is tested on the IEEE 14 and 30 bus systems. A variety of measurement configurations have been studied. In this section, some of the simulation results will be shown to illustrate the steps of the algorithm. Upon reducing the matrix into its Echelon form, we obtain: A. IEEE 14 Bus System The IEEE 14 bus system and its measurement configuration, which is taken from the example used in [3], is shown in Fig. 1. Injections are located at bus 1, 2, 3, 7, 9, 12, and 14, and flows at branches 1 2, 1 5, 2 3, 4 7, 4 9, 6 13, 7 8, and 7 9. These are the must use measurements. Forming the gain matrix and Note that Echelon reduction may require row pivoting and since the rows with nonzero pivots indicate to the minimal set of measurements to be chosen, these should be properly identified based on the new row ordering. In the above example, the first two rows of correspond to the injections at bus 5 and 10 and
6 824 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 4, NOVEMBER 2001 Reducing into its Echelon form results in only two nonzero rows, namely 1st and 4th rows. These correspond to the injection pseudo-measurements at buses 22 and 27. Therefore, adding these two measurements to the existing measurement configuration, will make the entire system observable. Fig. 2. IEEE 30 bus system. hence they are chosen as the minimal set of measurements to make the whole system observable. B. IEEE 30 Bus System The IEEE 30 bus system and measurement configuration are shown in Fig. 2. The same procedure as above, is repeated for the given measurement set of the 30 bus system. Upon forming the test matrix and the product of the branch-node incidence matrix and lead to the identification of the following set of unobservable branches: and Removing these unobservable branches, four observable islands are obtained. These islands are composed of buses {24}, {29, 30}, {25, 26, 27} and {all other nodes}. This suggests the bus injections at nodes 22, 23, 25, 27, 28, 29, and 30 are candidates for measurement placement. Forming the corresponding sub-jacobian for these candidate measurements and calculating the product yields the following matrix: V. CONCLUSION This paper investigates the problem of measurement placement in power system state estimation. A new and improved algorithm is developed for multiple measurement placement. This algorithm avoids iterative addition of measurements and instead allows simultaneous placement of a minimal set of pseudomeasurements that will render the system observable. It is based on a previously developed method for observability analysis and makes use of small dimension test matrix in deciding on the placement of measurements. The dimension of the test matrix is equal to the rank deficiency of the existing gain matrix, and therefore is typically only a small fraction of the total number of buses in the system. This makes the method computationally very attractive, yet simple to implement in existing state estimators. Examples are included to illustrate the steps of the proposed algorithm. REFERENCES [1] G. R. Krumpholz, K. A. Clements, and P. W. Davis, Power system observability: A practical algorithm using network topology, IEEE Trans.Power Apparatus and Systems, vol. PAS-99, no. 4, pp , July [2] A. Monticelli and F. F. Wu, Network observability: Theory, IEEE Trans. Power Apparatus and Systems, vol. PAS-104, no. 5, pp , May [3], Network observability: Identification of observable islands and measurement placement, IEEE Trans. Power Apparatus and Systems, vol. PAS-104, no. 5, pp , May [4] B. Gou and A. Abur, A direct numerical method for observability analysis, IEEE Trans. Power Systems, to be published. [5] L. O. Chua and P.-M. Lin, Computer-Aided Analysis of Electronic Circuits: Algorithms and Computational Techniques: Prentice-Hall, Bei Gou is from Sichuan, China. He received the B.S. degree in electrical engineering from North China University of Electric Power, China, in 1990, and the M.E. (Electrical) degree from Shanghai JiaoTong University, China, From 1993 to 1996, he taught at the department of electric power engineering in Shanghai JiaoTong University. He worked as a research assistant at Texas A&M University since 1997 and received the Ph.D. degree in He currently works at ABB Energy Information Systems, Santa Clara, CA. Ali Abur (SM 90) received the B.S. degree from METU, Turkey in 1979, the M.S. and Ph.D. degrees from The Ohio State University, Columbus, OH, in 1981 and 1985, respectively. Since late 1985, he has been with the Department of Electrical Engineering at Texas A&M University, College Station, TX, where he is currently a Professor. His research interests are in computational methods for the solution of power system monitoring, operation and control problems.
MEASUREMENTS that are transmitted to the control
458 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 20, NO. 1, FEBRUARY 2005 Combined State Estimation and Measurement Calibration Shan Zhong, Student Member, IEEE, and Ali Abur, Fellow, IEEE Abstract A measurement
More informationALL THE energy management system (EMS) applications
586 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 2, MAY 2006 Identification of Network Parameter Errors Jun Zhu and Ali Abur, Fellow, IEEE Abstract This paper describes a simple yet effective method
More informationThe Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs
The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs Frankie Smith Nebraska Wesleyan University fsmith@nebrwesleyan.edu May 11, 2015 Abstract We will look at how to represent
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.2 Row Reduction and Echelon Forms ECHELON FORM A rectangular matrix is in echelon form (or row echelon form) if it has the following three properties: 1. All nonzero
More informationAli Abur Northeastern University Department of Electrical and Computer Engineering Boston, MA 02115
Enhanced State t Estimation Ali Abur Northeastern University Department of Electrical and Computer Engineering Boston, MA 02115 GCEP Workshop: Advanced Electricity Infrastructure Frances Arriallaga Alumni
More informationFalse Analog Data Injection Attack Towards Topology Errors: Formulation and Feasibility Analysis
False Analog Data Injection Attack Towards Topology Errors: Formulation and Feasibility Analysis Yuqi Zhou, Jorge Cisneros-Saldana, Le Xie Department of Electrical and Computer Engineering Texas A&M University
More informationMATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the
More informationA Novel Approach for the Optimal PMU Placement using Binary Integer Programming Technique
A Novel Approach for the Optimal PMU Placement using Binary Integer Programming Technique J. S. Bhonsle 1 & A. S. Junghare 2 1 Department of Electrical Engg., Priyadarshini Institute of Engineering & Technology,
More informationSolving Systems Using Row Operations 1 Name
The three usual methods of solving a system of equations are graphing, elimination, and substitution. While these methods are excellent, they can be difficult to use when dealing with three or more variables.
More informationData Exchange Design and A Textured State Estimation Algorithm For Distributed Multi-Utility Operations In Electric Power Market.
Data Exchange Design and A Textured State Estimation Algorithm For Distributed Multi-Utility Operations In Electric Power Market Jiansheng Lei Advisor: Dr. Garng M. Huang Department of Electrical Engineering
More informationSection 3.1 Gaussian Elimination Method (GEM) Key terms
Section 3.1 Gaussian Elimination Method (GEM) Key terms Rectangular systems Consistent system & Inconsistent systems Rank Types of solution sets RREF Upper triangular form & back substitution Nonsingular
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationThe Paired Assignment Problem
Open Journal of Discrete Mathematics, 04, 4, 44-54 Published Online April 04 in SciRes http://wwwscirporg/ournal/odm http://dxdoiorg/0436/odm044007 The Paired Assignment Problem Vardges Melkonian Department
More informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
More informationUnified PMU Placement Algorithm for Power Systems
Unified PMU Placement Algorithm for Power Systems Kunal Amare, and Virgilio A. Centeno Bradley Department of Electrical and Computer Engineering, Virginia Tech Blacksburg, VA-24061, USA. Anamitra Pal Network
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationLARP / 2018 ACK : 1. Linear Algebra and Its Applications - Gilbert Strang 2. Autar Kaw, Transforming Numerical Methods Education for STEM Graduates
Triangular Factors and Row Exchanges LARP / 28 ACK :. Linear Algebra and Its Applications - Gilbert Strang 2. Autar Kaw, Transforming Numerical Methods Education for STEM Graduates Then there were three
More informationRe-Dispatching Generation to Increase Power System Security Margin and Support Low Voltage Bus
496 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 15, NO 2, MAY 2000 Re-Dispatching Generation to Increase Power System Security Margin and Support Low Voltage Bus Ronghai Wang, Student Member, IEEE, and Robert
More informationARITHMETIC operations based on residue number systems
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 2, FEBRUARY 2006 133 Improved Memoryless RNS Forward Converter Based on the Periodicity of Residues A. B. Premkumar, Senior Member,
More informationPart 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm
In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationCS6015 / LARP ACK : Linear Algebra and Its Applications - Gilbert Strang
Solving and CS6015 / LARP 2018 ACK : Linear Algebra and Its Applications - Gilbert Strang Introduction Chapter 1 concentrated on square invertible matrices. There was one solution to Ax = b and it was
More informationLOW-DENSITY PARITY-CHECK (LDPC) codes [1] can
208 IEEE TRANSACTIONS ON MAGNETICS, VOL 42, NO 2, FEBRUARY 2006 Structured LDPC Codes for High-Density Recording: Large Girth and Low Error Floor J Lu and J M F Moura Department of Electrical and Computer
More informationLECTURES 3 and 4: Flows and Matchings
LECTURES 3 and 4: Flows and Matchings 1 Max Flow MAX FLOW (SP). Instance: Directed graph N = (V,A), two nodes s,t V, and capacities on the arcs c : A R +. A flow is a set of numbers on the arcs such that
More informationA Poorly Conditioned System. Matrix Form
Possibilities for Linear Systems of Equations A Poorly Conditioned System A Poorly Conditioned System Results No solution (inconsistent) Unique solution (consistent) Infinite number of solutions (consistent)
More informationSingularity Analysis of an Extensible Kinematic Architecture: Assur Class N, Order N 1
David H. Myszka e-mail: dmyszka@udayton.edu Andrew P. Murray e-mail: murray@notes.udayton.edu University of Dayton, Dayton, OH 45469 James P. Schmiedeler The Ohio State University, Columbus, OH 43210 e-mail:
More informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly
More information10/26/ Solving Systems of Linear Equations Using Matrices. Objectives. Matrices
6.1 Solving Systems of Linear Equations Using Matrices Objectives Write the augmented matrix for a linear system. Perform matrix row operations. Use matrices and Gaussian elimination to solve systems.
More informationREGULAR GRAPHS OF GIVEN GIRTH. Contents
REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion
More informationOn Fiedler s characterization of tridiagonal matrices over arbitrary fields
Linear Algebra and its Applications 401 (2005) 467 481 www.elsevier.com/locate/laa On Fiedler s characterization of tridiagonal matrices over arbitrary fields Américo Bento a, António Leal Duarte b,,1
More informationCHAPTER 5 SYSTEMS OF EQUATIONS. x y
page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More information2. Use elementary row operations to rewrite the augmented matrix in a simpler form (i.e., one whose solutions are easy to find).
Section. Gaussian Elimination Our main focus in this section is on a detailed discussion of a method for solving systems of equations. In the last section, we saw that the general procedure for solving
More informationImproved Protection Scheme for Data Attack on Strategic Buses in the Smart Grid
Improved Protection Scheme for Data Attack on Strategic Buses in the Smart Grid Charith Wickramaarachchi, Sanmukh R. Kuppannagari, Rajgopal Kannan and Viktor K. Prasanna Department of Computer Science
More informationDeficient Quartic Spline Interpolation
International Journal of Computational Science and Mathematics. ISSN 0974-3189 Volume 3, Number 2 (2011), pp. 227-236 International Research Publication House http://www.irphouse.com Deficient Quartic
More informationDesign of Low-Delay FIR Half-Band Filters with Arbitrary Flatness and Its Application to Filter Banks
Electronics and Communications in Japan, Part 3, Vol 83, No 10, 2000 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol J82-A, No 10, October 1999, pp 1529 1537 Design of Low-Delay FIR Half-Band
More information6. Lecture notes on matroid intersection
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm
More informationAim. Structure and matrix sparsity: Part 1 The simplex method: Exploiting sparsity. Structure and matrix sparsity: Overview
Aim Structure and matrix sparsity: Part 1 The simplex method: Exploiting sparsity Julian Hall School of Mathematics University of Edinburgh jajhall@ed.ac.uk What should a 2-hour PhD lecture on structure
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationProject and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi
Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 8 Consistency and Redundancy in Project networks In today s lecture
More informationDual-Mode Low-Complexity Codebook Searching Algorithm and VLSI Architecture for LTE/LTE-Advanced Systems
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 61, NO 14, JULY 15, 2013 3545 Dual-Mode Low-Complexity Codebook Searching Algorithm and VLSI Architecture LTE/LTE-Advanced Systems Yi-Hsuan Lin, Yu-Hao Chen,
More informationMOST attention in the literature of network codes has
3862 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 8, AUGUST 2010 Efficient Network Code Design for Cyclic Networks Elona Erez, Member, IEEE, and Meir Feder, Fellow, IEEE Abstract This paper introduces
More informationCOLUMN GENERATION IN LINEAR PROGRAMMING
COLUMN GENERATION IN LINEAR PROGRAMMING EXAMPLE: THE CUTTING STOCK PROBLEM A certain material (e.g. lumber) is stocked in lengths of 9, 4, and 6 feet, with respective costs of $5, $9, and $. An order for
More informationAN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP
AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP W. L. PRICE ABSTRACT The paper describes an algorithm which generates those Hamiltonian circuits of a given cubic planar map
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationMa/CS 6b Class 13: Counting Spanning Trees
Ma/CS 6b Class 13: Counting Spanning Trees By Adam Sheffer Reminder: Spanning Trees A spanning tree is a tree that contains all of the vertices of the graph. A graph can contain many distinct spanning
More informationComputational Methods CMSC/AMSC/MAPL 460. Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science
Computational Methods CMSC/AMSC/MAPL 460 Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science Zero elements of first column below 1 st row multiplying 1 st
More informationEfficient Minimization of New Quadric Metric for Simplifying Meshes with Appearance Attributes
Efficient Minimization of New Quadric Metric for Simplifying Meshes with Appearance Attributes (Addendum to IEEE Visualization 1999 paper) Hugues Hoppe Steve Marschner June 2000 Technical Report MSR-TR-2000-64
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Projective 3D Geometry (Back to Chapter 2) Lecture 6 2 Singular Value Decomposition Given a
More informationChapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
Chapter 8 out of 7 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal 8 Matrices Definitions and Basic Operations Matrix algebra is also known
More informationThe block triangular form and bipartite matchings
Outline The block triangular form and bipartite matchings Jean-Yves L Excellent and Bora Uçar GRAAL, LIP, ENS Lyon, France CR-07: Sparse Matrix Computations, November 2010 http://graal.ens-lyon.fr/~bucar/cr07/
More informationFundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.
Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture No # 06 Simplex Algorithm Initialization and Iteration (Refer Slide
More informationOn the maximum rank of completions of entry pattern matrices
Linear Algebra and its Applications 525 (2017) 1 19 Contents lists available at ScienceDirect Linear Algebra and its Applications wwwelseviercom/locate/laa On the maximum rank of completions of entry pattern
More informationCyclic base orders of matroids
Cyclic base orders of matroids Doug Wiedemann May 9, 2006 Abstract This is a typewritten version, with many corrections, of a handwritten note, August 1984, for a course taught by Jack Edmonds. The purpose
More informationGeneralized Network Flow Programming
Appendix C Page Generalized Network Flow Programming This chapter adapts the bounded variable primal simplex method to the generalized minimum cost flow problem. Generalized networks are far more useful
More informationMath 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011
Rice University, Summer 20 Math 355: Linear Algebra: Midterm Colin Carroll June 25, 20 I have adhered to the Rice honor code in completing this test. Signature: Name: Date: Time: Please read the following
More informationLecture 6: Faces, Facets
IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny
More informationOn Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract
On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge
More informationCSCE 411 Design and Analysis of Algorithms
CSCE 411 Design and Analysis of Algorithms Set 4: Transform and Conquer Slides by Prof. Jennifer Welch Spring 2014 CSCE 411, Spring 2014: Set 4 1 General Idea of Transform & Conquer 1. Transform the original
More information3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs
11 3.1 Forms of linear programs... 12 3.2 Basic feasible solutions... 13 3.3 The geometry of linear programs... 14 3.4 Local search among basic feasible solutions... 15 3.5 Organization in tableaus...
More informationLecture 3: Graphs and flows
Chapter 3 Lecture 3: Graphs and flows Graphs: a useful combinatorial structure. Definitions: graph, directed and undirected graph, edge as ordered pair, path, cycle, connected graph, strongly connected
More informationHeuristic Algorithms for Multiconstrained Quality-of-Service Routing
244 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 10, NO 2, APRIL 2002 Heuristic Algorithms for Multiconstrained Quality-of-Service Routing Xin Yuan, Member, IEEE Abstract Multiconstrained quality-of-service
More informationSynchrophasor Based Robust Linear State Estimator
Synchrophasor Based Robust Linear State Estimator Ali Abur, Murat Göl and Bilgehan Dönmez Department of Electrical and Computer Engineering Northeastern University, Boston abur@ece.neu.edu NASPI Workshop,
More informationError-Correcting Codes
Error-Correcting Codes Michael Mo 10770518 6 February 2016 Abstract An introduction to error-correcting codes will be given by discussing a class of error-correcting codes, called linear block codes. The
More informationDetermination of the Minimum Break Point Set of Directional Relay Networks based on k-trees of the Network Graphs
IEEE TPWRD 2011. THIS IS THE AUTHORS COPY. THE DEFINITIVE VERSION CAN BE FOUND AT IEEE. 1 Determination of the Minimum Break Point Set of Directional Relay Networks based on k-trees of the Network Graphs
More informationOptimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 8, AUGUST 2011 5227 Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction K V Rashmi,
More informationFIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders
770 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: ANALOG AND DIGITAL SIGNAL PROCESSING, VOL. 48, NO. 8, AUGUST 2001 FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders Hyeong-Ju
More informationStructured System Theory
Appendix C Structured System Theory Linear systems are often studied from an algebraic perspective, based on the rank of certain matrices. While such tests are easy to derive from the mathematical model,
More informationMA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:
MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of
More informationAdaptive Linear Programming Decoding of Polar Codes
Adaptive Linear Programming Decoding of Polar Codes Veeresh Taranalli and Paul H. Siegel University of California, San Diego, La Jolla, CA 92093, USA Email: {vtaranalli, psiegel}@ucsd.edu Abstract Polar
More informationLinear Loop Transformations for Locality Enhancement
Linear Loop Transformations for Locality Enhancement 1 Story so far Cache performance can be improved by tiling and permutation Permutation of perfectly nested loop can be modeled as a linear transformation
More informationI. INTRODUCTION. 2 matrix, integral-equation-based methods, matrix inversion.
2404 IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, VOL. 59, NO. 10, OCTOBER 2011 Dense Matrix Inversion of Linear Complexity for Integral-Equation-Based Large-Scale 3-D Capacitance Extraction Wenwen
More informationGraph Adjacency Matrix Automata Joshua Abbott, Phyllis Z. Chinn, Tyler Evans, Allen J. Stewart Humboldt State University, Arcata, California
Graph Adjacency Matrix Automata Joshua Abbott, Phyllis Z. Chinn, Tyler Evans, Allen J. Stewart Humboldt State University, Arcata, California Abstract We define a graph adjacency matrix automaton (GAMA)
More informationarxiv: v1 [math.ho] 7 Nov 2017
An Introduction to the Discharging Method HAOZE WU Davidson College 1 Introduction arxiv:1711.03004v1 [math.ho] 7 Nov 017 The discharging method is an important proof technique in structural graph theory.
More informationAhigh school curriculum in Algebra 2 contains both solving systems of linear equations,
The Simplex Method for Systems of Linear Inequalities Todd O. Moyer, Towson University Abstract: This article details the application of the Simplex Method for an Algebra 2 class. Students typically learn
More informationECEN 615 Methods of Electric Power Systems Analysis Lecture 13: Sparse Matrix Ordering, Sparse Vector Methods
ECEN 615 Methods of Electric Power Systems Analysis Lecture 13: Sparse Matrix Ordering, Sparse Vector Methods Prof. Tom Overbye Dept. of Electrical and Computer Engineering Texas A&M University overbye@tamu.edu
More informationA Level-wise Priority Based Task Scheduling for Heterogeneous Systems
International Journal of Information and Education Technology, Vol., No. 5, December A Level-wise Priority Based Task Scheduling for Heterogeneous Systems R. Eswari and S. Nickolas, Member IACSIT Abstract
More informationProblem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009
Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.
More informationThe real voyage of discovery consists not in seeking new landscapes, but in having new eyes.
The real voyage of discovery consists not in seeking new landscapes, but in having new eyes. - Marcel Proust University of Texas at Arlington Camera Calibration (or Resectioning) CSE 4392-5369 Vision-based
More informationCS Elementary Graph Algorithms & Transform-and-Conquer
CS483-10 Elementary Graph Algorithms & Transform-and-Conquer Outline Instructor: Fei Li Room 443 ST II Office hours: Tue. & Thur. 1:30pm - 2:30pm or by appointments Depth-first Search cont Topological
More informationPractice Test - Chapter 6
1. Write each system of equations in triangular form using Gaussian elimination. Then solve the system. Align the variables on the left side of the equal sign. Eliminate the x-term from the 2nd equation.
More informationLecture 9 - Matrix Multiplication Equivalences and Spectral Graph Theory 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanfordedu) February 6, 2018 Lecture 9 - Matrix Multiplication Equivalences and Spectral Graph Theory 1 In the
More informationCHAPTER 6 IDENTIFICATION OF CLUSTERS USING VISUAL VALIDATION VAT ALGORITHM
96 CHAPTER 6 IDENTIFICATION OF CLUSTERS USING VISUAL VALIDATION VAT ALGORITHM Clustering is the process of combining a set of relevant information in the same group. In this process KM algorithm plays
More informationChapter 2. Splitting Operation and n-connected Matroids. 2.1 Introduction
Chapter 2 Splitting Operation and n-connected Matroids The splitting operation on an n-connected binary matroid may not yield an n-connected binary matroid. In this chapter, we provide a necessary and
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More informationHandout 9: Imperative Programs and State
06-02552 Princ. of Progr. Languages (and Extended ) The University of Birmingham Spring Semester 2016-17 School of Computer Science c Uday Reddy2016-17 Handout 9: Imperative Programs and State Imperative
More informationOn the null space of a Colin de Verdière matrix
On the null space of a Colin de Verdière matrix László Lovász 1 and Alexander Schrijver 2 Dedicated to the memory of François Jaeger Abstract. Let G = (V, E) be a 3-connected planar graph, with V = {1,...,
More informationExact Optimized-cost Repair in Multi-hop Distributed Storage Networks
Exact Optimized-cost Repair in Multi-hop Distributed Storage Networks Majid Gerami, Ming Xiao Communication Theory Lab, Royal Institute of Technology, KTH, Sweden, E-mail: {gerami, mingx@kthse arxiv:14012774v1
More informationThree applications of Euler s formula. Chapter 10
Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if
More informationFUTURE communication networks are expected to support
1146 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 13, NO 5, OCTOBER 2005 A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast Ariel Orda, Senior Member, IEEE, and Alexander Sprintson,
More informationNumerical Linear Algebra
Numerical Linear Algebra Probably the simplest kind of problem. Occurs in many contexts, often as part of larger problem. Symbolic manipulation packages can do linear algebra "analytically" (e.g. Mathematica,
More informationMerging the Temporal and Spatial Aspects of Data and Information for Improved Power System Monitoring Applications
Merging the Temporal and Spatial Aspects of Data and Information for Improved Power System Monitoring Applications MLADEN KEZUNOVIC, FELLOW, IEEE, AND ALI ABUR, FELLOW, IEEE Invited Paper Many power system
More informationMy Favorite Problems, 4 Harold B. Reiter University of North Carolina Charlotte
My Favorite Problems, 4 Harold B Reiter University of North Carolina Charlotte This is the fourth of a series of columns about problems I am soliciting problems from the readers of M&I Quarterly I m looking
More informationRobot Mapping. Least Squares Approach to SLAM. Cyrill Stachniss
Robot Mapping Least Squares Approach to SLAM Cyrill Stachniss 1 Three Main SLAM Paradigms Kalman filter Particle filter Graphbased least squares approach to SLAM 2 Least Squares in General Approach for
More informationGraphbased. Kalman filter. Particle filter. Three Main SLAM Paradigms. Robot Mapping. Least Squares Approach to SLAM. Least Squares in General
Robot Mapping Three Main SLAM Paradigms Least Squares Approach to SLAM Kalman filter Particle filter Graphbased Cyrill Stachniss least squares approach to SLAM 1 2 Least Squares in General! Approach for
More informationCMPSCI611: The Simplex Algorithm Lecture 24
CMPSCI611: The Simplex Algorithm Lecture 24 Let s first review the general situation for linear programming problems. Our problem in standard form is to choose a vector x R n, such that x 0 and Ax = b,
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
More information