Lecture #12 EEE 574 Dr. Dan Tylavsky Optimal Ordering.

Slides:



Advertisements
Similar presentations
POWER SYSTEM ENGINEERING
Advertisements

Announcements Be reading Chapters 9 and 10 HW 8 is due now.
TOPIC : Reduced Ordered Binary Decision Diagrams UNIT 1: Modeling Digital Circuits Module 1 : Functional Modeling.
PRECALCULUS I SOLVING SYSTEMS OF EQUATIONS Dr. Claude S. Moore Cape Fear Community College Chapter 8.
Twisted Pairs Another way to reduce cross-talk is by means of a twisted pair of wires. A twisted pair of wires will be modeled as a cascade of alternating.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
Power Flow Problem Formulation
ECE 552 Numerical Circuit Analysis Chapter Four SPARSE MATRIX SOLUTION TECHNIQUES Copyright © I. Hajj 2012 All rights reserved.
EE 369 POWER SYSTEM ANALYSIS
Lecture #14 EEE 574 Dr. Dan Tylavsky Matrix Inversion Lemma.
Triangular Linear Equations Lecture #5 EEE 574 Dr. Dan Tylavsky.
LU - Factorizations Matrix Factorization into Triangular Matrices.
Trees and BFSs Page 1 The Network Simplex Method Spanning Trees and Basic Feasible Solutions.
SOLVING SYSTEMS OF LINEAR EQUATIONS. Overview A matrix consists of a rectangular array of elements represented by a single symbol (example: [A]). An individual.
Lecture 9: Introduction to Matrix Inversion Gaussian Elimination Sections 2.4, 2.5, 2.6 Sections 2.2.3, 2.3.
Sparse Matrix Storage Lecture #3 EEE 574 Dr. Dan Tylavsky.
Matrix Factorization Lecture #7 EEE 574 Dr. Dan Tylavsky.
Sparse Triangular Matrix Equations Lecture #6 EEE 574 Dr. Dan Tylavsky.
Sparse Vector & Matrix Algebra Lecture #4 EEE 574 Dr. Dan Tylavsky.
Lecture #22 EEE 574 Dr. Dan Tylavsky Newton-Raphson Power Flow Implementation.
Graphs and Matrix Storage Structures EEE 574 Dr. Dan Tylavsky.
Analysis of Triangular Factorization Lecture #8 EEE 574 Dr. Dan Tylavsky.
Lecture #23 EEE 574 Dr. Dan Tylavsky Decoupled Power Flow Algorithms.
Newton-Raphson Power Flow Algorithm
Lecture #15 EEE 574 Dr. Dan Tylavsky Breaker to Bus Modeling.
Fill Lecture #9 EEE 574 Dr. Dan Tylavsky. Fill © Copyright 1999 Daniel Tylavsky 4 When we solve Ax=b, (A sparse), fill-in will occur in the L,U factor.
Lecture #21 EEE 574 Dr. Dan Tylavsky Newton-Raphson Power Flow Algorithm II.
Special Matrices and Gauss-Siedel
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 4 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
ECE 552 Numerical Circuit Analysis Chapter Two EQUATION FORMULATION Copyright © I. Hajj 2015 All rights reserved.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Digital Logic Design Lecture 26. Announcements Exams will be returned on Thursday Final small quiz on Monday, 12/8. Final homework will be assigned Thursday,
Linear Systems and Matrices
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 18 LU Decomposition and Matrix Inversion.
Introduction Information in science, business, and mathematics is often organized into rows and columns to form rectangular arrays called “matrices” (plural.
Systems and Matrices (Chapter5)
System of Linear Equations Nattee Niparnan. LINEAR EQUATIONS.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Graph Theory, Topological Analysis ECE Graph Theory, Topological Analysis - Terms Topological Analysis: General, systematic, suited for CAD Graph:
Announcements Homework #4 is due now Homework 5 is due on Oct 4
General Methods of Network Analysis Node Analysis Mesh Analysis Loop Analysis Cutset Analysis State variable Analysis Non linear and time varying network.
ECE 476 Power System Analysis Lecture 11: Ybus, Power Flow Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Linear Equation System Pertemuan 4 Matakuliah: S0262-Analisis Numerik Tahun: 2010.
Slide Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley A set of equations is called a system of equations. The solution.
Copyright © Cengage Learning. All rights reserved. 2 SYSTEMS OF LINEAR EQUATIONS AND MATRICES Solve p. 87 #45 by elimination.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Module 7 Test Review. Formulas Shifting Functions  Given g(x) on a graph, f(x) = g(x) + 7 would mean that…..  Answer: g(x) would be shifted 7 units.
Linear Systems Dinesh A.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Gaussian Elimination Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Gaussian elimination with back-substitution.
Gaussian Elimination and Gauss-Jordan Elimination
Gaussian Elimination and Gauss-Jordan Elimination
Part 3 Linear Programming
Linear Equations by Dr. Shorouk Ossama.
5 Systems of Linear Equations and Matrices
Linear Algebra Lecture 4.
Chapter 8: Lesson 8.1 Matrices & Systems of Equations
Chapter 1 Systems of Linear Equations and Matrices
Part 3 Linear Programming
Matrices and Systems of Equations
Chapter 4 Systems of Linear Equations; Matrices
Numerical Analysis Lecture10.
EOC Practice #15 SPI
Discrete Mathematics Lecture 12: Graph Theory
ECEN 615 Methods of Electric Power Systems Analysis
Copyright © 2019 Pearson Education, Inc.
Chapter 4 Systems of Linear Equations; Matrices
Part 3 Linear Programming
Numerical Analysis Lecture11.
Presentation transcript:

Lecture #12 EEE 574 Dr. Dan Tylavsky Optimal Ordering

© Copyright 1999 Daniel Tylavsky * L,D,UIndicate positions of native nonzeros. zIndicates positions where fill occurs. –When we discussed fill we observed that depending on the ordering we got different amounts of fill. Table of Factors*

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Re-label nodes: native node 1 native node 7. Table of Factors –There is a graphical relationship between the elimination of a node and the fill that occurs after a node is eliminated in Gauss elimination/LU factorization

Optimal Ordering © Copyright 1999 Daniel Tylavsky –When column/row k of a matrix is eliminated, the fill produced corrresponds to new branches in the network graph created by: removing node k and all of its connected branches from the network graph. mutually interconnecting in the (resulting network graph) all nodes upon which the removed branches were incident.

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Ex: Eliminate node 1. Eliminate node

Optimal Ordering © Copyright 1999 Daniel Tylavsky Eliminate node 3. Eliminate node

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Defn: Node Valency - number of branches incident on the node or, equivalently, the number of non- zero off-diagonal terms in the row of the matrix corresponding to the node of interest

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Bill Tinney’s sub-optimal ordering methods: Tinney #1: Number nodes in ascending order of valency

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Look at the fill graphically

Optimal Ordering © Copyright 1999 Daniel Tylavsky

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Teams (Think Pair Share) - Using Tinney #1 ordering scheme, find the fill that will occur during factorization for the matrix associated with the network graph shown below. The ordering you get will depend on the order in which you process the nodes.

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Bill Tinney’s sub-optimal ordering methods: Tinney #2: Number nodes in ascending order of valency accounting for valency changes due to fill

Optimal Ordering © Copyright 1999 Daniel Tylavsky –No fill with Tinney #2 for this simple problem!

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Teams (Think Pair Share) - Using Tinney #2 ordering scheme, find the fill that will occur during factorization for the matrix associated with the network graph shown below. Ordering you get will depend on the order in which you process the nodes.

Optimal Ordering © Copyright 1999 Daniel Tylavsky –Teams (Think Pair Share) - Find the fill due another Tinney #2 ordering. (This yields a form known as border block diagonal form.) Is there an ordering scheme consistent with Tinney #2 that has fill?

Optimal Ordering © Copyright 1999 Daniel Tylavsky 4 Node Ordering for Generating Network Equivalents. Order External Buses First. Order Boundary Buses Second. Order Internal Buses Third. Order according to Tinney #1 or 2. Internal External Boundary Buses

Optimal Ordering © Copyright 1999 Daniel Tylavsky 4 After reduction of rows associated with the external system: Only submatrix where fill occurs. 4 Premultiplying by the inverse of L. (In practice perform forward substitution.)

Optimal Ordering © Copyright 1999 Daniel Tylavsky 4 Writing: 4 Yields: OR

Optimal Ordering © Copyright 1999 Daniel Tylavsky 4 Graphical Interpretation of: Internal Modified Boundary Bus Injections (I ’ B ) Note that bus voltages of interest are unscathed by the process. Fictitious Branches (due to fill) represent equivalent network.

The End

Optimal Ordering © Copyright 1999 Daniel Tylavsky

Optimal Ordering © Copyright 1999 Daniel Tylavsky

Optimal Ordering © Copyright 1999 Daniel Tylavsky