Rosen 5th ed., §2.7 ~18 slides, ~1 lecture

Slides:



Advertisements
Similar presentations
CSNB143 – Discrete Structure
Advertisements

Chapter Matrices Matrix Arithmetic
1 Matrices Rosen 6 th ed., §3.8 2 Matrices A matrix is a rectangular array of numbers.A matrix is a rectangular array of numbers. An m  n (“m by n”)
Economics 2301 Matrices Lecture 13.
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
Part 3 Chapter 8 Linear Algebraic Equations and Matrices PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The.
化工應用數學 授課教師: 郭修伯 Lecture 9 Matrices
Matrices MSU CSE 260.
MATRICES. Matrices A matrix is a rectangular array of objects (usually numbers) arranged in m horizontal rows and n vertical columns. A matrix with m.
CE 311 K - Introduction to Computer Methods Daene C. McKinney
A matrix having a single row is called a row matrix. e.g.,
Compiled By Raj G. Tiwari
ECON 1150 Matrix Operations Special Matrices
Presentation on Matrices and some special matrices In partial fulfillment of the subject Vector calculus and linear algebra ( ) Submitted by: Agarwal.
2015 년 봄학기 강원대학교 컴퓨터과학전공 문양세 이산수학 (Discrete Mathematics) 행렬 (Matrices)
8.1 Matrices & Systems of Equations
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Lecture 7 Matrices CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Chapter 4 – Matrix CSNB 143 Discrete Mathematical Structures.
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/21 Module.
Matrices Matrices A matrix (say MAY-trix) is a rectan- gular array of objects (usually numbers). An m  n (“m by n”) matrix has exactly m horizontal.
2009/9 1 Matrices(§3.8)  A matrix is a rectangular array of objects (usually numbers).  An m  n (“m by n”) matrix has exactly m horizontal rows, and.
Module #9: Matrices Rosen 5 th ed., §2.7 Now we are moving on to matrices, section 7.
Discrete Mathematics 1 Kemal Akkaya DISCRETE MATHEMATICS Lecture 16 Dr. Kemal Akkaya Department of Computer Science.
Chapter 6 Systems of Linear Equations and Matrices Sections 6.3 – 6.5.
Meeting 18 Matrix Operations. Matrix If A is an m x n matrix - that is, a matrix with m rows and n columns – then the scalar entry in the i th row and.
Matrices Section 2.6. Section Summary Definition of a Matrix Matrix Arithmetic Transposes and Powers of Arithmetic Zero-One matrices.
Module #9 – Number Theory 1/5/ Algorithms, The Integers and Matrices.
Matrices and Determinants
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
MATRIX A set of numbers arranged in rows and columns enclosed in round or square brackets is called a matrix. The order of a matrix gives the number of.
CS 450: COMPUTER GRAPHICS TRANSFORMATIONS SPRING 2015 DR. MICHAEL J. REALE.
Section 2.4. Section Summary  Sequences. o Examples: Geometric Progression, Arithmetic Progression  Recurrence Relations o Example: Fibonacci Sequence.
2 - 1 Chapter 2A Matrices 2A.1 Definition, and Operations of Matrices: 1 Sums and Scalar Products; 2 Matrix Multiplication 2A.2 Properties of Matrix Operations;
Module #9 – Number Theory 6/11/20161 Chapter 3 Algorithms, Integers and Matrices.
Matrices. Variety of engineering problems lead to the need to solve systems of linear equations matrixcolumn vectors.
MATRICES A rectangular arrangement of elements is called matrix. Types of matrices: Null matrix: A matrix whose all elements are zero is called a null.
1 Matrix Math ©Anthony Steed Overview n To revise Vectors Matrices.
Linear Algebra by Dr. Shorouk Ossama.
Matrices Introduction.
MTH108 Business Math I Lecture 20.
2. Matrix Methods
CSE15 Discrete Mathematics 03/01/17
Lecture 08a: MATRICES Sec 2.7
CSE 504 Discrete Mathematics & Foundations of Computer Science
CSNB 143 Discrete Mathematical Structures
Linear Algebraic Equations and Matrices
MATRICES.
Matrices.
Discrete Structures – CNS2300
Applied Discrete Mathematics Week 5: Mathematical Reasoning
Linear Algebraic Equations and Matrices
L6 matrix operations.
L5 matrix.
Sequences and Summations
Matrix Algebra.
MATRICES MATRIX OPERATIONS.
CSE 541 – Numerical Methods
Section 2.4 Matrices.
Matrices Introduction.
CS100: Discrete structures
Matrix Algebra.
[MATRICES ].
Discrete Mathematics and its Applications
Rosen 5th ed., §2.7 ~18 slides, ~1 lecture
[MATRICES ].
Applied Discrete Mathematics Week 4: Functions
Module #9: Basic Number Theory
Matrices and Determinants
Presentation transcript:

Rosen 5th ed., §2.7 ~18 slides, ~1 lecture Module #9: Matrices Rosen 5th ed., §2.7 ~18 slides, ~1 lecture 9/21/2018 (c)2001-2003, Michael P. Frank

§2.7 Matrices A matrix (say MAY-trix) is a rectan- gular array of objects (usually numbers). An mn (“m by n”) matrix has exactly m horizontal rows, and n vertical columns. Plural of matrix = matrices (say MAY-trih-sees) An nn matrix is called a square matrix, whose order is n. Not our meaning! a 32 matrix Note: The singular form of “matrices” is “matrix,” not “MAY-trih-see”! 9/21/2018 (c)2001-2003, Michael P. Frank

Applications of Matrices Tons of applications, including: Solving systems of linear equations Computer Graphics, Image Processing Models within Computational Science & Engineering Quantum Mechanics, Quantum Computing Many, many more… 9/21/2018 (c)2001-2003, Michael P. Frank

Matrix Equality Two matrices A and B are equal iff they have the same number of rows, the same number of columns, and all corresponding elements are equal. 9/21/2018 (c)2001-2003, Michael P. Frank

Row and Column Order The rows in a matrix are usually indexed 1 to m from top to bottom. The columns are usually indexed 1 to n from left to right. Elements are indexed by row, then column. 9/21/2018 (c)2001-2003, Michael P. Frank

Matrices as Functions An mn matrix A = [ai,j] of members of a set S can be encoded as a partial function fA: ℕℕ→S, such that for i<m, j<n, fA(i, j) = ai,j. By extending the domain over which fA is defined, various types of infinite and/or multidimensional matrices can be obtained. 9/21/2018 (c)2001-2003, Michael P. Frank

Matrix Sums The sum A+B of two matrices A, B (which must have the same number of rows, and the same number of columns) is the matrix (also with the same shape) given by adding corresponding elements. A+B = [ai,j+bi,j] 9/21/2018 (c)2001-2003, Michael P. Frank

Matrix Products For an mk matrix A and a kn matrix B, the product AB is the mn matrix: I.e., element (i,j) of AB is given by the vector dot product of the ith row of A and the jth column of B (considered as vectors). Note: Matrix multiplication is not commutative! 9/21/2018 (c)2001-2003, Michael P. Frank

Matrix Product Example An example matrix multiplication to practice in class: 9/21/2018 (c)2001-2003, Michael P. Frank

Identity Matrices The identity matrix of order n, In, is the order-n matrix with 1’s along the upper-left to lower-right diagonal and 0’s everywhere else. 9/21/2018 (c)2001-2003, Michael P. Frank

Review: §2.6 Matrices, so far Matrix sums and products: A+B = [ai,j+bi,j] Identity matrix of order n: In = [ij], where ij=1 if i=j and ij=0 if ij. 9/21/2018 (c)2001-2003, Michael P. Frank

Matrix Inverses For some (but not all) square matrices A, there exists a unique multiplicative inverse A-1 of A, a matrix such that A-1A = In. If the inverse exists, it is unique, and A-1A = AA-1. We won’t go into the algorithms for matrix inversion... 9/21/2018 (c)2001-2003, Michael P. Frank

Matrix Multiplication Algorithm procedure matmul(matrices A: mk, B: kn) for i := 1 to m for j := 1 to n begin cij := 0 for q := 1 to k cij := cij + aiqbqj end {C=[cij] is the product of A and B} (m)· What’s the  of its time complexity? (n)·( Answer: (mnk) (1)+ (k) · (1)) 9/21/2018 (c)2001-2003, Michael P. Frank

Powers of Matrices If A is an nn square matrix and p0, then: Ap  AAA···A (A0  In) Example: p times 9/21/2018 (c)2001-2003, Michael P. Frank

Matrix Transposition If A=[aij] is an mn matrix, the transpose of A (often written At or AT) is the nm matrix given by At = B = [bij] = [aji] (1in,1jm) Flip across diagonal 9/21/2018 (c)2001-2003, Michael P. Frank

Symmetric Matrices A square matrix A is symmetric iff A=At. I.e., i,jn: aij = aji . Which is symmetric? 9/21/2018 (c)2001-2003, Michael P. Frank

Zero-One Matrices Useful for representing other structures. E.g., relations, directed graphs (later in course) All elements of a zero-one matrix are 0 or 1 Representing False & True respectively. The meet of A, B (both mn zero-one matrices): AB : [aijbij] = [aij bij] The join of A, B: AB : [aijbij] 9/21/2018 (c)2001-2003, Michael P. Frank

Boolean Products Let A=[aij] be an mk zero-one matrix, & let B=[bij] be a kn zero-one matrix, The boolean product of A and B is like normal matrix , but using  instead + in the row-column “vector dot product.” A⊙B 9/21/2018 (c)2001-2003, Michael P. Frank

Boolean Powers For a square zero-one matrix A, and any k0, the kth Boolean power of A is simply the Boolean product of k copies of A. A[k]  A⊙A⊙…⊙A k times 9/21/2018 (c)2001-2003, Michael P. Frank