Max-plus algebra. Max-plus algebra. Monika Molnárová. Technická univerzita Košice. Max-plus algebra.
|
|
- Brianne Sutton
- 5 years ago
- Views:
Transcription
1 Technická univerzita Košice
2 Outline 1 Digraphs Maximum cycle-mean and transitive closures of a matrix Reducible and irreducible matrices Definite matrices
3 Digraphs Complete digraph Transition matrix of a DDS A = 1 4 ε ε ε 3 complete digraph G c (A) corresponding finite digraph G(A) 3 3 ε 6 5 ε ε
4 Digraphs Finite digraph Definition For a matrix A R (n, n) we define the digraf G(A) = (V, E) with the node set V = {1, 2,..., n} and with arc (i, j) having finite weight a ij. For any pair (i, j) with a ij = ε, there is no arc from the node i to the node j in the digraph G(A).
5 Digraphs Paths and cycles Definition A path in a digraph G(A) = (V, E) is a sequence of nodes p = (i 1, i 2,..., i r+1 ) with r 0, such that (i t, i t+1 ) E for any t {1, 2,..., r}. The number r is called the length of p and is denoted by p. If i 1 = i r+1, then p is called a cycle. An elementary path is a path without repetitions. An elementary cycle is a path with only repetition i 1 = i r+1.
6 Digraphs Weight of a path Definition The weight of a path (cycle) denoted by w(p) (w(c)) is the sum of the weights of its arcs. For a cycle c with positive length the ratio of the weight of the cycle to its length is the mean value of the cycle w(c). The maximum cycle-mean value in G(A) is denoted by λ(a). A cycle with mean value equal to λ(a) is called a critical cycle. Remark: The cycle-mean value of a cycle can not exceed the cycle-means of its elementary cycles. Since a digraph contains finite number of cycles λ(a) always exists. In case there is no cycle with positive length in the digraph λ(a) = ε.
7 Digraphs Maximum cycle-mean - Example Example: A = 1 4 ε ε ε c = (1, 2, 3, 1) w(c) = 15 c = 3 λ(a) = w(c) = w(c) c = 5
8 Digraphs A digraph for A F (n, n) Theorem Let A F (n, n). Then the corresponding digraph G(A) contains at least one cycle with finite weight. P: There is an arc from any node to some node in the digraph G(A). Since the number of nodes is finite a repetition of some node must occur.
9 Digraphs Maximum weight of paths Theorem Let A R (n, n). The maximum weight of the weights of all paths of length r from a node i to a node j is given by a (r) ij for r = 1, 2,.... P: consider paths p = (i, k, j) of length 2 from the node i to the node j max{a ik + a kj } = k aik a kj = a (2) ij
10 Maximum cycle-mean and transitive closures of a matrix Weak transitive closure of a matrix Definition Let A R (n, n). The weak transitive closure of the matrix A in max-plus algebra is the sum of its powers (A) = A A 2 A 3 Remark: If (A) = (δ ij ), then δ ij represents the maximum weight of all paths from the node i to the node j regardless of the length.
11 Maximum cycle-mean and transitive closures of a matrix Maximum speed of DDS - estimation Theorem Let A R (n, n). Suppose the digraph G(A) contains a critical cycle of length L. Then for arbitrary vector x F (n, 1) and t 1 holds ξ(x, A Lt x) (λ(a)) Lt P: c is a critical cycle of length L max a (L) i ii = (λ(a)) L ξ(x(1), C t x(1)) ( set C = A L i cii ) t
12 Maximum cycle-mean and transitive closures of a matrix Maximum speed of DDS - Example Example: A = 1 4 ε ε ε c = (1, 2, 3, 1) w(c) = 15 c = 3 λ(a) = w(c) = w(c) c = 5
13 Maximum cycle-mean and transitive closures of a matrix Maximum speed of DDS - Example x(r) : 1 2 3, 6 8 7, , , ξ(x(1), x(4)) (λ(a)) 3 = 5 3 = 15 ξ(x(2), x(5)) (λ(a)) 3 = 5 3 = 15...
14 Maximum cycle-mean and transitive closures of a matrix Nodes of a critical cycle Theorem Let A R (n, n). Let G(A) contains a critical cycle of length L c = (i 1, i 2,..., i L, i 1 ). Then for all multiples q of number L (by natural number) following holds a (q) i si s = (λ(a)) q s = 1, 2,..., L P: the mean value of any cycle is less or equal to maximum cycle-mean (λ(a)) q a (q) i si s q is a multiple of L, we can add proper number of cycles c to get the length q (λ(a)) q a (q) i si s
15 Maximum cycle-mean and transitive closures of a matrix Nodes of a critical cycle - Example 1 Example: A = 1 4 ε ε ε the critical cycle c = (1, 2, 3, 1) contains all nodes a (3) ii = (λ(a)) 3 = 5 3 = 15 i = 1, 2, 3 A 3 =
16 Maximum cycle-mean and transitive closures of a matrix Nodes of a critical cycle - Example 2 Example: A = 1 1 ε ε ε critical cycle c = (3, 3) A 2 = a (k) = (λ(a))k = 4 k k = 1, 2, , A 3 = , A 4 =
17 Maximum cycle-mean and transitive closures of a matrix p-regularity Definition Let A R (n, n). Let p = A A 2 A 3 A p. The matrix A is called p-regular in max-plus algebra, if (A) = p = p+1 = p+2 =... Theorem Let A R (n, n). Then the following hold 1 If λ(a) 0, then there exists p n, such that the matrix A is p-regular. 2 If λ(a) > 0, then for any p the matrix A is not p-regular.
18 Maximum cycle-mean and transitive closures of a matrix p-regularity - Example 1 Example: A = 1 1 ε ε ε critical cycle c = (3, 3) a 33 = λ(a) = A 5 = , A 6 = , A 7 =
19 Maximum cycle-mean and transitive closures of a matrix p-regularity - Example 2 Example: A = 5 5 ε ε ε critical cycle c = (3, 3) a 33 = λ(a) = A 2 = 7 8 6A 3 = A 4 =
20 Maximum cycle-mean and transitive closures of a matrix p-regularity - Example 3 Example: A = 3 3 ε ε ε critical cycle c = (3, 3) a 33 = λ(a) = A 2 = 3 4 2, A 3 = 3 6 2, A 4 = A 4 = A 5 = A 6...
21 Maximum cycle-mean and transitive closures of a matrix Strong transitive closure Definition Let A R (n, n). The strong transitive closure of the matrix A in max-plus algebra is the sum Γ(A) = E A A 2 A 3 Remark: Γ(A) = E (A) no action = Γ(D) = E = diagonal elements equal 0 zero profit (loss) ln 1, i.e. logarithm of probability of certain event...
22 Maximum cycle-mean and transitive closures of a matrix Model of road net-work - probability of accessibility Description of the model: Let us consider a road net-work in a mountain region. Roads connect villages N 1, N 2,... N n. Let p ij represents the probability that the direct road from village N i to village N j is open during the winter. Let us compute the probability of most reliable route from the village N i to the village N j. Solution route (N i, N i+1,..., N j 1, N j ) probability of reliability p i,i+1 p j 1,j
23 Maximum cycle-mean and transitive closures of a matrix Model of road net-work - probability of accessibility Transformation to max-plus model: ln(p i,i+1 p j 1,j ) = ln p i,i ln p j 1,j Solution: set a ij = ln p ij find Γ(A) = γ ij represents probability of most reliable route (logaritmus) γ ii = ln 1 = 0 access of the village N i from itself is guaranteed
24 Maximum cycle-mean and transitive closures of a matrix Properties of Γ(D) Theorem Let D R (n, n). Let D be p-regular for some p 1, then the strong transitive closure exists. Moreover Γ(D) = (E D) p. P: binomial theorem Γ(D) = E D D 2 D 3 D p = (E D) p
25 Maximum cycle-mean and transitive closures of a matrix Computation of strong transitive closure - method of matrix squaring Theorem Let D R (n, n). Let λ(d) 0. Then the following holds D n E n 1. P: diagonal elements d (n) ii e ii = 0 (cycle weights) off diagonal elements d (n) ij weights of paths of length n = contain cycle = d (n) ij ( n 1 ) ij Corollary Let D R (n, n). Let λ(d) 0. Then for arbitrary p n 1 holds Γ(D) = (E D) p.
26 Maximum cycle-mean and transitive closures of a matrix Computation of strong transitive closure - Example Example: Consider matrix D R (16, 16). Let λ(d) 0. Let us compute the strong transitive closure Γ(D). Solution: Γ(D) = (E D) p p n 1 = 15 Γ(D) = (E D) 15 = (E D) 16 = (E D) 24 Theorem Let D R (n, n). Let λ(d) 0. Then Γ(D) can be computed by matrix-squaring method in O(n 3 ln n) time.
27 Maximum cycle-mean and transitive closures of a matrix Computation of weak transitive closure - Example Example: Consider matrix D R (16, 16). Let λ(d) 0. Let us compute the weak transitive closure (D). Solution: (D) = D Γ(D) = D (E D) 24 Theorem Let D R (n, n). Let λ(d) 0. Then (D) can be computed by matrix-squaring method in O(n 3 ln n) time.
28 Reducible and irreducible matrices Strong connectivity - Algorithm for verifying by Γ(D) Definition Let D R (n, n). The digraph G(D) is strongly connected, if there is a path from node i to node j for arbitrary pair of distinct nodes i and j. Algorithm for verifying the strong connectivity: assign each arc in the digraph by weight 0 λ(d) 0 = Γ(D) can be computed digraph is strongly connected if all elements of Γ(D) are finite
29 Reducible and irreducible matrices Verifying the strong connectivity - Example 1 Example: D = Solution: 0 ε ε ε ε 0 0 ε ε ε ε 0 Γ(D) = (E D) 3 = D 3 = D 4 Γ(D) = ε ε ε
30 Reducible and irreducible matrices Verifying the strong connectivity - Example 2 Example: D = ε ε ε ε ε ε 0 ε ε ε ε 0 ε Solution: Γ(D) = Γ(D) = (E D) 3 = (E D) 4 0 ε ε ε ε 0 0 ε ε ε =
31 Reducible and irreducible matrices Computation of weak transitive closure - Floyd-Warshall algorithm Floyd-Warshallov algorithm For D R (n, n) compute the sequence D {1}, D {2},..., D {n+1} for k = 1, 2,..., n { {k} d ij d {k+1} ij = d {k} ij d {k} ik d {k} kj for i k j k d {k} ij for i = k j = k represents the maximum weight of all elementary paths from the node i to the node j not having as an intermediate node any node r for r k
32 Reducible and irreducible matrices Computation of weak transitive closure - Floyd-Warshall algorithm Theorem Let D R (n, n). Let λ(d) 0. Then (D) = D {n+1}, which Floyd-Warshall algorithm computes in O(n 3 ) time. Corollary Let D R (n, n). Let λ(d) 0. Then Floyd-Warshall algorithm computes Γ(D) in O(n 3 ) time. P: Γ(D) = E (D)
33 Reducible and irreducible matrices Floyd-Warshall algorithm - Example Example: D = ε ε ε 0 ε 0 ε ε 0 ε ε ε ε Solution: D {1} = D D {2} = d {1+1} ij = { ε ε ε 0 ε ε ε ε ε {1} {1} {1} d ij d i1 d 1j pre i 1 j 1 d {1} ij pre i = 1 j = 1
34 Reducible and irreducible matrices Floyd-Warshall algorithm - Example D {3} = ε ε ε 0 ε ε ε ε ε D{4} = (D) = D {5} = D {4} = Γ(D) = E (D) = ε ε ε ε ε ε ε ε ε ε ε 0
35 Reducible and irreducible matrices Strongly connected components Theorem Let D R (n, n). The digraph G(D) is strongly connected if and only if there is a common cycle for any pair of distinct nodes. Definition Let G(D) = (V, E) is a digraph. A subdigraph K = (K, E K 2 ) generated by a nonempty subset K V satisfying 1 there is a common cycle for any pair of distinct nodes 2 K is the maximum subset with above property is called a strongly connected component of G(D).
36 Reducible and irreducible matrices Finding the strongly connected components by Γ(D) Algorithm for finding the strongly connected components: 1 choose i and find in i-th row of Γ(D) the finite values δ ij, for which δ ji is finite as well = these nodes are contained in the same strongly connected component 2 remove all the rows and columns corresponding to the nodes of the strongly connected component 3 repeat steps 1 and 2, until all the nodes are associated with one of the strongly connected components
37 Reducible and irreducible matrices Finding the strongly connected components by Γ(D) - Example D = ε ε ε ε 0 ε 0 ε ε 0 ε ε ε 0 ε ε ε 0 ε ε 0 ε ε ε 0 ε ε ε ε 0 ε ε ε ε ε ε Γ(D) = 0 ε ε ε ε ε ε 0 0 ε ε ε ε ε 0 delete 1. and 5. row and column K 1 = {1, 5} K 2 = {2, 3, 4} K 3 = {6} ε ε ε 0
38 Reducible and irreducible matrices Condensed digraph Condensed digraph nodes K 1, K 2, K 3 represent strongly connected components K 3 K 2 K 1 condensed digraph is acyclic
39 Reducible and irreducible matrices Acyclic digraphs - coherent numbering Definition Digraph which contains no cycles except loops is called acyclic. Definition An acyclic digraph is coherently numbered, if for any arc (i, j) holds i j. Theorem An acyclic digraph can be always coherently numbered.
40 Reducible and irreducible matrices Coherent numbering of an acyclic digraph Algorithm for coherent numbering of an acyclic digraph: 1 remove loops 2 assign the highest node-numbers to the terminal nodes 3 delete them with all arcs incident with them 4 repeat steps 2-3, until all the nodes are numbered
41 Reducible and irreducible matrices Coherent numbering of an acyclic digraph - Example
42 Reducible and irreducible matrices The matrix of a coherent numbered acyclic digraph Example: D = ε 0 0 ε ε ε Theorem Let T (n, n) is the class of upper-triangular matrices of order n. Then T (n, n) is closed under and, i.e. A, B T (n, n) 1 A B T (n, n) 2 A B T (n, n)
43 Reducible and irreducible matrices Irreducible a reducible matrices Definition Let D R (n, n). The matrix D is called irreducible, if G(D) is strongly connected. Matrix D, which is not irreducible is called reducible. Definition The digraph of a reducible matrix is coherently numbered, if for any arc (i, j) for nodes i and j from distinct strongly connected components holds i < j. Remark: The matrix of a coherently numbered acyclic digraph has an upper triangular form. The matrix of a coherently numbered digraph has an upper block-triangular form.
44 Reducible and irreducible matrices Coherent numbering of an arbitrary digraph K 3 3 K 2 K K 3 = {6} 3 rd {6} K 1 = {1, 5} 2 nd {4, 5} K 2 = {2, 3, 4} 1 st {1, 2, 3}
45 Reducible and irreducible matrices Permutation of nodes π = ( n π(1) π(2)... π(n) ) ( = permutation matrix P P 1 : P P 1 = P 1 P = E P = ε ε ε 0 ε ε 0 ε ε ε ε ε ε 0 ε ε ε ε ε ε 0 ε ε ε ε ε ε ε 0 ε ε ε ε ε ε 0 P 1 = ) ε 0 ε ε ε ε ε ε 0 ε ε ε ε ε ε 0 ε ε 0 ε ε ε ε ε ε ε ε ε 0 ε ε ε ε ε ε 0 D com = P 1 D P
46 Reducible and irreducible matrices The matrix of a coherent numbered digraph D = Γ(D) = ε ε ε ε 0 ε 0 ε ε 0 ε ε ε 0 ε ε ε 0 ε ε 0 ε ε ε 0 ε ε ε ε 0 ε ε ε ε ε ε 0 ε ε ε ε ε ε 0 0 ε ε ε ε ε 0 D com = Γ(D com ) = ε ε 0 0 ε ε 0 ε ε ε ε 0 ε 0 ε ε ε ε ε ε ε ε 0 ε ε ε ε 0 ε 0 ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε 0
47 Reducible and irreducible matrices The upper block-triangular matrix The upper block-triangular matrix D com = D 11 D 12 D 13 ε D 22 D 23 ε ε D 33 = ε ε 0 0 ε ε 0 ε ε ε ε 0 ε 0 ε ε ε ε ε ε ε ε 0 ε ε ε ε 0 ε 0 ε ε ε ε ε ε
48 Reducible and irreducible matrices Floyd-Warshall algorithm - summary By Floyd-Warshall algorithm we can in O(n 3 ) time 1 find the strongly connected components 2 number coherently the nodes 3 find the upper block-triangular matrix
49 Definite matrices Definite matrices Definition Let D R (n, n). A node j of a critical cycle in G(D) is called an eigen node. Definition Let D R (n, n). The matrix D is called definite, if 1 λ(d) = 0 2 G(D) is strongly connected
50 Definite matrices Definite matrices - summary Theorem Let D R (n, n) is definite with digraph G(D). Then 1 D F (n, n), (D) exists and is finite (if n > 1) and δ ij for i j represents some maximum weight path from node i to node j of length not exceeding n 1 2 each diagonal element δ ii represents some maximum weight cycle containing node i of length not exceeding n 3 G(D) contains at least one elementary cycle with weight 0 and no cycle with positive weight 4 G(D) contains at least one eigen-node, for any eigen node j is δ jj = 0, else δ kk < 0
51 Definite matrices Eigen nodes of a definite matrix Theorem Let D F (n, n) is definite and = (D). If j is an eigen node then for any node i there is a node k such that δ ij = d ik + δ kj. Theorem Let D F (n, n) is definite and = (D). For any node j there is an eigen node i such that δ ij represents the weight of some path from the node i to the node j of length n + 1. Theorem Let D F (n, n) is definite, then λ(d p ) = 0 (for p > 1) and G(D) and G(D p ) have the same eigen nodes.
52 Definite matrices Transitive closures of definite matrices with increasing property Theorem Let D R (n, n). Then the DES with the transition matrix D has the increasing property if and only if D E, and then D F (n, n). If D is definite and DES has the increasing property, then 1 d ii = 0 i = 1, 2,..., n 2 Γ(D) = D n 1 = (D), and D (D) = (D)
53 Thank you for your attention.
Chapter 8 Dynamic Programming
Chapter 8 Dynamic Programming Copyright 007 Pearson Addison-Wesley. All rights reserved. Dynamic Programming Dynamic Programming is a general algorithm design technique for solving problems defined by
More informationModeling and Stability Analysis of a Communication Network System
Modeling and Stability Analysis of a Communication Network System Zvi Retchkiman Königsberg Instituto Politecnico Nacional e-mail: mzvi@cic.ipn.mx Abstract In this work, the modeling and stability problem
More informationPeriodic properties of matrices
Periodic properties of matrices Technická univerzita Košice monika.molnarova@tuke.sk References 1 E. Draženská, M. Molnárová, Periods of Monge matrices with zero-weight cycles, Proc. of the Conf. Informatics
More informationChapter 8 Dynamic Programming
Chapter 8 Dynamic Programming Copyright 2007 Pearson Addison-Wesley. All rights reserved. Dynamic Programming Dynamic Programming is a general algorithm design technique for solving problems defined by
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationNonnegative Matrices I
Nonnegative Matrices I Daisuke Oyama Topics in Economic Theory September 26, 2017 References J. L. Stuart, Digraphs and Matrices, in Handbook of Linear Algebra, Chapter 29, 2006. R. A. Brualdi and H. J.
More informationCS412: Lecture #17. Mridul Aanjaneya. March 19, 2015
CS: Lecture #7 Mridul Aanjaneya March 9, 5 Solving linear systems of equations Consider a lower triangular matrix L: l l l L = l 3 l 3 l 33 l n l nn A procedure similar to that for upper triangular systems
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationDeterminants. Samy Tindel. Purdue University. Differential equations and linear algebra - MA 262
Determinants Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T. Determinants Differential equations
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationA Generalized Eigenmode Algorithm for Reducible Regular Matrices over the Max-Plus Algebra
International Mathematical Forum, 4, 2009, no. 24, 1157-1171 A Generalized Eigenmode Algorithm for Reducible Regular Matrices over the Max-Plus Algebra Zvi Retchkiman Königsberg Instituto Politécnico Nacional,
More informationMatrices. Chapter Definitions and Notations
Chapter 3 Matrices 3. Definitions and Notations Matrices are yet another mathematical object. Learning about matrices means learning what they are, how they are represented, the types of operations which
More informationResults on Integer and Extended Integer Solutions to Max-linear Systems
Results on Integer and Extended Integer Solutions to Max-linear Systems Peter Butkovič p.butkovic@bham.ac.uk Marie MacCaig m.maccaig.maths@outlook.com Abstract This paper follows on from, and complements
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13
STAT 309: MATHEMATICAL COMPUTATIONS I FALL 208 LECTURE 3 need for pivoting we saw that under proper circumstances, we can write A LU where 0 0 0 u u 2 u n l 2 0 0 0 u 22 u 2n L l 3 l 32, U 0 0 0 l n l
More informationCSC 1700 Analysis of Algorithms: Warshall s and Floyd s algorithms
CSC 1700 Analysis of Algorithms: Warshall s and Floyd s algorithms Professor Henry Carter Fall 2016 Recap Space-time tradeoffs allow for faster algorithms at the cost of space complexity overhead Dynamic
More informationDEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular
form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix
More informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2017/18 Part 2: Direct Methods PD Dr.
More informationCompletions of P-Matrix Patterns
1 Completions of P-Matrix Patterns Luz DeAlba 1 Leslie Hogben Department of Mathematics Department of Mathematics Drake University Iowa State University Des Moines, IA 50311 Ames, IA 50011 luz.dealba@drake.edu
More informationStochastic modelling of epidemic spread
Stochastic modelling of epidemic spread Julien Arino Centre for Research on Inner City Health St Michael s Hospital Toronto On leave from Department of Mathematics University of Manitoba Julien Arino@umanitoba.ca
More informationMatrices and Vectors
Matrices and Vectors James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 11, 2013 Outline 1 Matrices and Vectors 2 Vector Details 3 Matrix
More informationON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES
ON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES SANTOSH N. KABADI AND ABRAHAM P. PUNNEN Abstract. Polynomially testable characterization of cost matrices associated
More informationMath.3336: Discrete Mathematics. Chapter 9 Relations
Math.3336: Discrete Mathematics Chapter 9 Relations Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More information. =. a i1 x 1 + a i2 x 2 + a in x n = b i. a 11 a 12 a 1n a 21 a 22 a 1n. i1 a i2 a in
Vectors and Matrices Continued Remember that our goal is to write a system of algebraic equations as a matrix equation. Suppose we have the n linear algebraic equations a x + a 2 x 2 + a n x n = b a 2
More informationEE263 Review Session 1
EE263 Review Session 1 October 5, 2018 0.1 Importing Variables from a MALAB.m file If you are importing variables given in file vars.m, use the following code at the beginning of your script. close a l
More informationChapter 7 Network Flow Problems, I
Chapter 7 Network Flow Problems, I Network flow problems are the most frequently solved linear programming problems. They include as special cases, the assignment, transportation, maximum flow, and shortest
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More informationStochastic modelling of epidemic spread
Stochastic modelling of epidemic spread Julien Arino Department of Mathematics University of Manitoba Winnipeg Julien Arino@umanitoba.ca 19 May 2012 1 Introduction 2 Stochastic processes 3 The SIS model
More informationCMPS 6610 Fall 2018 Shortest Paths Carola Wenk
CMPS 6610 Fall 018 Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk Paths in graphs Consider a digraph G = (V, E) with an edge-weight function w
More informationMatrices and systems of linear equations
Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.
More informationA graph theoretic approach to matrix inversion by partitioning
Numerische Mathematik 4, t 28-- t 35 (1962) A graph theoretic approach to matrix inversion by partitioning By FRANK HARARY Abstract Let M be a square matrix whose entries are in some field. Our object
More informationSingle Source Shortest Paths
CMPS 00 Fall 017 Single Source Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk Paths in graphs Consider a digraph G = (V, E) with an edge-weight
More informationSparse spectrally arbitrary patterns
Electronic Journal of Linear Algebra Volume 28 Volume 28: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 8 2015 Sparse spectrally arbitrary patterns Brydon
More informationAn O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra
Discrete Applied Mathematics 127 (2003) 651 656 Short Note www.elsevier.com/locate/dam An O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra Martin Gavalec a;,jan Plavka b a Department
More informationLIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE
International Journal of Applied Mathematics Volume 31 No. 18, 41-49 ISSN: 1311-178 (printed version); ISSN: 1314-86 (on-line version) doi: http://dx.doi.org/1.173/ijam.v31i.6 LIMITING PROBABILITY TRANSITION
More informationA Mixed Lyapunov-Max-Plus Algebra Approach to the Stability Problem for a two Species Ecosystem Modeled with Timed Petri Nets
International Mathematical Forum, 5, 2010, no. 28, 1393-1408 A Mixed Lyapunov-Max-Plus Algebra Approach to the Stability Problem for a two Species Ecosystem Modeled with Timed Petri Nets Zvi Retchkiman
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationInvertible Matrices over Idempotent Semirings
Chamchuri Journal of Mathematics Volume 1(2009) Number 2, 55 61 http://www.math.sc.chula.ac.th/cjm Invertible Matrices over Idempotent Semirings W. Mora, A. Wasanawichit and Y. Kemprasit Received 28 Sep
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationCSR EXPANSIONS OF MATRIX POWERS IN MAX ALGEBRA
CSR EXPANSIONS OF MATRIX POWERS IN MAX ALGEBRA SERGEĭ SERGEEV AND HANS SCHNEIDER Abstract. We study the behavior of max-algebraic powers of a reducible nonnegative matrix A R n n +. We show that for t
More informationRelationships between the Completion Problems for Various Classes of Matrices
Relationships between the Completion Problems for Various Classes of Matrices Leslie Hogben* 1 Introduction A partial matrix is a matrix in which some entries are specified and others are not (all entries
More informationEIGENVALUES AND EIGENVECTORS OF LATIN SQUARES IN MAX-PLUS ALGEBRA
J. Indones. Math. Soc. Vol. 20, No. 1 (2014), pp. 37 45. EIGENVALUES AND EIGENVECTORS OF LATIN SQUARES IN MAX-PLUS ALGEBRA Muhammad Syifa ul Mufid 1 and Subiono 2 1,2 Institut Teknologi Sepuluh Nopember
More informationDeterminants. Chia-Ping Chen. Linear Algebra. Professor Department of Computer Science and Engineering National Sun Yat-sen University 1/40
1/40 Determinants Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra About Determinant A scalar function on the set of square matrices
More informationLecture Notes 1: Matrix Algebra Part C: Pivoting and Matrix Decomposition
University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 46 Lecture Notes 1: Matrix Algebra Part C: Pivoting and Matrix Decomposition Peter J. Hammond Autumn 2012, revised Autumn 2014 University
More informationOn the job rotation problem
On the job rotation problem Peter Butkovič and Seth Lewis School of Mathematics The University of Birmingham Edgbaston Birmingham B15 2TT United Kingdom August 26, 2006 Abstract The job rotation problem
More informationAAA616: Program Analysis. Lecture 7 The Octagon Abstract Domain
AAA616: Program Analysis Lecture 7 The Octagon Abstract Domain Hakjoo Oh 2016 Fall Hakjoo Oh AAA616 2016 Fall, Lecture 7 November 3, 2016 1 / 30 Reference Antoine Miné. The Octagon Abstract Domain. Higher-Order
More informationGeneralized matrix period in max-plus algebra
Linear Algebra and its Applications 404 (2005) 345 366 www.elsevier.com/locate/laa Generalized matrix period in max-plus algebra Monika Molnárová Department of Mathematics, Faculty of Electrical Engineering,
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationThe System of Linear Equations. Direct Methods. Xiaozhou Li.
1/16 The Direct Methods xiaozhouli@uestc.edu.cn http://xiaozhouli.com School of Mathematical Sciences University of Electronic Science and Technology of China Chengdu, China Does the LU factorization always
More informationJordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS
Jordan Journal of Mathematics and Statistics JJMS) 53), 2012, pp.169-184 A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS ADEL H. AL-RABTAH Abstract. The Jacobi and Gauss-Seidel iterative
More informationPhys 201. Matrices and Determinants
Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1
More informationDirect Methods for Solving Linear Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le
Direct Methods for Solving Linear Systems Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le 1 Overview General Linear Systems Gaussian Elimination Triangular Systems The LU Factorization
More informationMatrix Completion Problems for Pairs of Related Classes of Matrices
Matrix Completion Problems for Pairs of Related Classes of Matrices Leslie Hogben Department of Mathematics Iowa State University Ames, IA 50011 lhogben@iastate.edu Abstract For a class X of real matrices,
More informationLinear Equations and Matrix
1/60 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Gaussian Elimination 2/60 Alpha Go Linear algebra begins with a system of linear
More informationMin-Rank Conjecture for Log-Depth Circuits
Min-Rank Conjecture for Log-Depth Circuits Stasys Jukna a,,1, Georg Schnitger b,1 a Institute of Mathematics and Computer Science, Akademijos 4, LT-80663 Vilnius, Lithuania b University of Frankfurt, Institut
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationMatrix Algebra. Matrix Algebra. Chapter 8 - S&B
Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
More informationMarkov Chains, Stochastic Processes, and Matrix Decompositions
Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral
More informationMATH 1210 Assignment 4 Solutions 16R-T1
MATH 1210 Assignment 4 Solutions 16R-T1 Attempt all questions and show all your work. Due November 13, 2015. 1. Prove using mathematical induction that for any n 2, and collection of n m m matrices A 1,
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More information2.1 Gaussian Elimination
2. Gaussian Elimination A common problem encountered in numerical models is the one in which there are n equations and n unknowns. The following is a description of the Gaussian elimination method for
More informationAnalysis of Algorithms I: All-Pairs Shortest Paths
Analysis of Algorithms I: All-Pairs Shortest Paths Xi Chen Columbia University The All-Pairs Shortest Paths Problem. Input: A directed weighted graph G = (V, E) with an edge-weight function w : E R. Output:
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More informationNew Transience Bounds for Max-Plus Linear Systems
New Transience Bounds for Max-Plus Linear Systems Bernadette Charron-Bost 1 Matthias Függer 2 Thomas Nowak 3 1 CNRS, LIX, École polytechnique, 91128 Palaiseau, France 2 ECS Group, TU Wien, 1040 Wien, Austria
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 22 All-Pairs Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 All Pairs
More informationTHE BOOLEAN IDEMPOTENT MATRICES. Hong Youl Lee and Se Won Park. 1. Introduction
J. Appl. Math. & Computing Vol. 15(2004), No. 1-2. pp. 475-484 THE BOOLEAN IDEMPOTENT MATRICES Hong Youl Lee and Se Won Park Abstract. In general, a matrix A is idempotent if A 2 = A. The idempotent matrices
More informationLecture 8: Determinants I
8-1 MATH 1B03/1ZC3 Winter 2019 Lecture 8: Determinants I Instructor: Dr Rushworth January 29th Determinants via cofactor expansion (from Chapter 2.1 of Anton-Rorres) Matrices encode information. Often
More informationACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS
ACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS WALTER D. MORRIS, JR. ABSTRACT. We call a directed acyclic graph a CIdigraph if a certain affine semigroup ring defined by it is a complete intersection.
More informationc 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March
SIAM REVIEW. c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp. 93 97, March 1995 008 A UNIFIED PROOF FOR THE CONVERGENCE OF JACOBI AND GAUSS-SEIDEL METHODS * ROBERTO BAGNARA Abstract.
More informationSYMBOLIC AND EXACT STRUCTURE PREDICTION FOR SPARSE GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING
SYMBOLIC AND EXACT STRUCTURE PREDICTION FOR SPARSE GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING LAURA GRIGORI, JOHN R. GILBERT, AND MICHEL COSNARD Abstract. In this paper we consider two structure prediction
More informationThis section is an introduction to the basic themes of the course.
Chapter 1 Matrices and Graphs 1.1 The Adjacency Matrix This section is an introduction to the basic themes of the course. Definition 1.1.1. A simple undirected graph G = (V, E) consists of a non-empty
More informationLecture 7: Shortest Paths in Graphs with Negative Arc Lengths. Reading: AM&O Chapter 5
Lecture 7: Shortest Paths in Graphs with Negative Arc Lengths Reading: AM&O Chapter Label Correcting Methods Assume the network G is allowed to have negative arc lengths but no directed negativelyweighted
More informationarxiv: v1 [cs.sc] 29 Jul 2009
An Explicit Construction of Gauss-Jordan Elimination Matrix arxiv:09075038v1 [cssc] 29 Jul 2009 Yi Li Laboratory of Computer Reasoning and Trustworthy Computing, University of Electronic Science and Technology
More informationKey words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.
May 7, DETERMINING WHETHER A MATRIX IS STRONGLY EVENTUALLY NONNEGATIVE LESLIE HOGBEN 3 5 6 7 8 9 Abstract. A matrix A can be tested to determine whether it is eventually positive by examination of its
More informationMath 4377/6308 Advanced Linear Algebra
1.4 Linear Combinations Math 4377/6308 Advanced Linear Algebra 1.4 Linear Combinations & Systems of Linear Equations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/
More informationAn Introduction to NeRDS (Nearly Rank Deficient Systems)
(Nearly Rank Deficient Systems) BY: PAUL W. HANSON Abstract I show that any full rank n n matrix may be decomposento the sum of a diagonal matrix and a matrix of rank m where m < n. This decomposition
More informationSolving Consistent Linear Systems
Solving Consistent Linear Systems Matrix Notation An augmented matrix of a system consists of the coefficient matrix with an added column containing the constants from the right sides of the equations.
More informationExample: Current in an Electrical Circuit. Solving Linear Systems:Direct Methods. Linear Systems of Equations. Solving Linear Systems: Direct Methods
Example: Current in an Electrical Circuit Solving Linear Systems:Direct Methods A number of engineering problems or models can be formulated in terms of systems of equations Examples: Electrical Circuit
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationNumerical Linear Algebra
Numerical Linear Algebra Direct Methods Philippe B. Laval KSU Fall 2017 Philippe B. Laval (KSU) Linear Systems: Direct Solution Methods Fall 2017 1 / 14 Introduction The solution of linear systems is one
More informationLinear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4
Linear Algebra Section. : LU Decomposition Section. : Permutations and transposes Wednesday, February 1th Math 01 Week # 1 The LU Decomposition We learned last time that we can factor a invertible matrix
More informationMatrix Multiplication
3.2 Matrix Algebra Matrix Multiplication Example Foxboro Stadium has three main concession stands, located behind the south, north and west stands. The top-selling items are peanuts, hot dogs and soda.
More informationMobius Inversion of Random Acyclic Directed Graphs
Mobius Inversion of Random Acyclic Directed Graphs By Joel E. Cohen Suppose a random acyclic digraph has adjacency matrix A with independent columns or independent rows. Then the mean Mobius inverse of
More informationOn The Best Principal. Submatrix Problem
On The Best Principal Submatrix Problem by Seth Charles Lewis A thesis submitted to University of Birmingham for the degree of Doctor of Philosophy (PhD) School of Mathematics University of Birmingham
More informationWilliam Stallings Copyright 2010
A PPENDIX E B ASIC C ONCEPTS FROM L INEAR A LGEBRA William Stallings Copyright 2010 E.1 OPERATIONS ON VECTORS AND MATRICES...2 Arithmetic...2 Determinants...4 Inverse of a Matrix...5 E.2 LINEAR ALGEBRA
More informationDETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY
DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY SFI FINANCIAL ALGEBRA PROJECT AT UCC: BH, AM & EO S 1. Definitions and basics In this working paper we have n currencies, labeled 1 through n inclusive and
More informationFormula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column
Math 20F Linear Algebra Lecture 18 1 Determinants, n n Review: The 3 3 case Slide 1 Determinants n n (Expansions by rows and columns Relation with Gauss elimination matrices: Properties) Formula for the
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationConditioning of the Entries in the Stationary Vector of a Google-Type Matrix. Steve Kirkland University of Regina
Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix Steve Kirkland University of Regina June 5, 2006 Motivation: Google s PageRank algorithm finds the stationary vector of a stochastic
More information7.2 Linear equation systems. 7.3 Linear least square fit
72 Linear equation systems In the following sections, we will spend some time to solve linear systems of equations This is a tool that will come in handy in many di erent places during this course For
More informationStatistics 992 Continuous-time Markov Chains Spring 2004
Summary Continuous-time finite-state-space Markov chains are stochastic processes that are widely used to model the process of nucleotide substitution. This chapter aims to present much of the mathematics
More informationRegular Expressions. Definitions Equivalence to Finite Automata
Regular Expressions Definitions Equivalence to Finite Automata 1 RE s: Introduction Regular expressions are an algebraic way to describe languages. They describe exactly the regular languages. If E is
More informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a beginning course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc I will review some of these terms here,
More information