Chapter Introduction

Similar documents
The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs

Interpolation & Polynomial Approximation. Cubic Spline Interpolation II

For example, the system. 22 may be represented by the augmented matrix

Dense Matrix Algorithms

Chapter 8 Dense Matrix Algorithms

Matrices. A Matrix (This one has 2 Rows and 3 Columns) To add two matrices: add the numbers in the matching positions:

Numerical Algorithms

EXTENSION. a 1 b 1 c 1 d 1. Rows l a 2 b 2 c 2 d 2. a 3 x b 3 y c 3 z d 3. This system can be written in an abbreviated form as

0_PreCNotes17 18.notebook May 16, Chapter 12

Lecture 5: Matrices. Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur

Iterative Methods for Linear Systems

(Sparse) Linear Solvers

Linear Equation Systems Iterative Methods

Hypercubes. (Chapter Nine)

Solving Systems Using Row Operations 1 Name

3-8 Solving Systems of Equations Using Inverse Matrices. Determine whether each pair of matrices are inverses of each other. 13.

(Sparse) Linear Solvers

Matrix multiplication

1 2 (3 + x 3) x 2 = 1 3 (3 + x 1 2x 3 ) 1. 3 ( 1 x 2) (3 + x(0) 3 ) = 1 2 (3 + 0) = 3. 2 (3 + x(0) 1 2x (0) ( ) = 1 ( 1 x(0) 2 ) = 1 3 ) = 1 3

Arrays, Matrices and Determinants

Chemical Engineering 541

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.

10/26/ Solving Systems of Linear Equations Using Matrices. Objectives. Matrices

Matrix Multiplication

Methods of solving sparse linear systems. Soldatenko Oleg SPbSU, Department of Computational Physics

Robot Mapping. Least Squares Approach to SLAM. Cyrill Stachniss

Graphbased. Kalman filter. Particle filter. Three Main SLAM Paradigms. Robot Mapping. Least Squares Approach to SLAM. Least Squares in General

Preconditioning for linear least-squares problems

Homework # 2 Due: October 6. Programming Multiprocessors: Parallelism, Communication, and Synchronization

ICRA 2016 Tutorial on SLAM. Graph-Based SLAM and Sparsity. Cyrill Stachniss

Comparison of different solvers for two-dimensional steady heat conduction equation ME 412 Project 2

TUTORIAL 1 Introduction to Matrix Calculation using MATLAB TUTORIAL 1 INTRODUCTION TO MATRIX CALCULATION USING MATLAB

Semistandard Young Tableaux Polytopes. Sara Solhjem Joint work with Jessica Striker. April 9, 2017

3. Replace any row by the sum of that row and a constant multiple of any other row.

Addition/Subtraction flops. ... k k + 1, n (n k)(n k) (n k)(n + 1 k) n 1 n, n (1)(1) (1)(2)

Course Number 432/433 Title Algebra II (A & B) H Grade # of Days 120

2 ATTILA FAZEKAS The tracking model of the robot car The schematic picture of the robot car can be seen on Fig.1. Figure 1. The main controlling task

Matrix Multiplication

4 Integer Linear Programming (ILP)

Test Review Stations ANSWERS. Unit 2 Matrices & Game Theory

Scanning Real World Objects without Worries 3D Reconstruction

Contents. F10: Parallel Sparse Matrix Computations. Parallel algorithms for sparse systems Ax = b. Discretized domain a metal sheet

CS 177. Lists and Matrices. Week 8

Figure (5) Kohonen Self-Organized Map

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #16 Loops: Matrix Using Nested for Loop

Matrix Inverse 2 ( 2) 1 = 2 1 2

COMP 558 lecture 19 Nov. 17, 2010

Iterative Algorithms I: Elementary Iterative Methods and the Conjugate Gradient Algorithms

Sparse Matrices. sparse many elements are zero dense few elements are zero

Arrays in Java Multi-dimensional Arrays

Aim. Structure and matrix sparsity: Part 1 The simplex method: Exploiting sparsity. Structure and matrix sparsity: Overview

Numerical Linear Algebra

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi

Exam 2 Review. 2. What the difference is between an equation and an expression?

To add or subtract, just add or subtract the numbers in the same column and row and place answer accordingly.

CS6015 / LARP ACK : Linear Algebra and Its Applications - Gilbert Strang

Algebraic Graph Theory- Adjacency Matrix and Spectrum

MA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces

Vector: A series of scalars contained in a column or row. Dimensions: How many rows and columns a vector or matrix has.

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology, Madras. Lecture No.

What is Multigrid? They have been extended to solve a wide variety of other problems, linear and nonlinear.

A B C D E F G H I J K L M 1 Student Test 1 Test 2 Test 3 Test 4 Total AVG. Joe Smith

MAT 343 Laboratory 1 Matrix and Vector Computations in MATLAB

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity

Chapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.

Alternating Projections

Face Recognition Using Long Haar-like Filters

EXTENDED ALGORITHM FOR DESIGN-MATRIX REORGANIZATION

Lecture 3: Camera Calibration, DLT, SVD

A Study on Triangular Type 2 Triangular Fuzzy Matrices

Least Squares and SLAM Pose-SLAM

AMS526: Numerical Analysis I (Numerical Linear Algebra)

Advanced Formulas and Functions in Microsoft Excel

Project Report. 1 Abstract. 2 Algorithms. 2.1 Gaussian elimination without partial pivoting. 2.2 Gaussian elimination with partial pivoting

Allocating Storage for 1-Dimensional Arrays

CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh HW#3 Due at the beginning of class Thursday 03/02/17

On Fiedler s characterization of tridiagonal matrices over arbitrary fields

AH Matrices.notebook November 28, 2016

Parallelizing LU Factorization

CHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT

Using Spam Farm to Boost PageRank p. 1/2

The Structural Representation of Proximity Matrices With MATLAB

Chapter 4. Matrix and Vector Operations

Introduction to MATLAB

Figure 6.1: Truss topology optimization diagram.

I How does the formulation (5) serve the purpose of the composite parameterization

BaSICS OF excel By: Steven 10.1

Chapter 14: Matrix Iterative Methods

Dynamic Programming. Outline and Reading. Computing Fibonacci

Computing the rank of big sparse matrices modulo p using gaussian elimination

Discrete Mathematics, Spring 2004 Homework 8 Sample Solutions

Data Mining: STATISTICA

Advanced Techniques for Mobile Robotics Graph-based SLAM using Least Squares. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz

Exercise Set Decide whether each matrix below is an elementary matrix. (a) (b) (c) (d) Answer:

Visual Tracking (1) Feature Point Tracking and Block Matching

Matrix Multiplication on an Experimental Parallel System With Hybrid Architecture

What is linear programming (LP)? NATCOR Convex Optimization Linear Programming 1. Solving LP problems: The standard simplex method

Math 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.

A Study of Numerical Methods for Simultaneous Equations

Chapter 13. Boundary Value Problems for Partial Differential Equations* Linz 2002/ page

Transcription:

Chapter 4.1 Introduction After reading this chapter, you should be able to 1. define what a matrix is. 2. identify special types of matrices, and 3. identify when two matrices are equal. What does a matrix look like? Matrices are everywhere. If you have used a spreadsheet such as Excel or written numbers in a table, you have used a matrix. Matrices make presentation of numbers clearer and make calculations easier to program. Look at the matrix below about the sale of tires in a Blowoutr us store given by quarter and make of tires. Tirestone Michigan Copper Q1 Q2 Q3 Q4 25 2 3 2 5 1 15 25 6 16 7 27 If one wants to know how many Copper tires were sold in Quarter 4, we go along the row Copper and column Q4 and find that it is 27. So what is a matrix? A matrix is a rectangular array of elements. The elements can be symbolic expressions or/and numbers. Matrix is denoted by a a12... a1 n a21 a... a2n [ A] am1 am2... amn Row i of has n elements and is 4.1.1

4.1.2 Chapter 4.1 [ a a... a ] i1 i2 in and column j of has m elements and is a1 j a2 j amj Each matrix has rows and columns and this defines the size of the matrix. If a matrix has m rows and n columns, the size of the matrix is denoted by m n. The matrix may also be denoted by [ ] to show that is a matrix with m rows and n columns. A m n Each entry in the matrix is called the entry or element of the matrix and is denoted by where i is the row number and j is the column number of the element. The matrix for the tire sales example could be denoted by the matrix as 25 2 3 2 5 1 15 25. 6 16 7 27 There are 3 rows and 4 columns, so the size of the matrix is 3 4. In the above matrix, a 27. 34 a ij What are the special types of matrices? Vector: A vector is a matrix that has only one row or one column. There are two types of vectors row vectors and column vectors. Row Vector: If a matrix [B] has one row, it is called a row vector [ B] [ b1 b2 bn ] and n is the dimension of the row vector. Example 1 Give an example of a row vector. [ B ] [25 2 3 2 ] is an example of a row vector of dimension 5. Column vector: If a matrix [C] has one column, it is called a column vector

Introduction 4.1.3 c1 [ C] c m and m is the dimension of the vector. Example 2 Give an example of a column vector. 25 [C] 5 6 is an example of a column vector of dimension 3. Submatrix: If some row(s) or/and column(s) of a matrix are deleted (no rows or columns may be deleted), the remaining matrix is called a submatrix of. Example 3 Find some of the submatrices of the matrix 4 6 2 3 1 2 4 6 2 4 6 2,, [ 4 6 2 ], [ 4 ], 3 1 2 3 1 2 are some of the submatrices of. Can you find other submatrices of? Square matrix: If the number of rows m of a matrix is equal to the number of columns n of a matrix, that is, m n, then [ A ] is called a square matrix. The entries a, a,..., ann are called the diagonal elements of a square matrix. Sometimes the diagonal of the matrix is also called the principal or main of the matrix. Example 4 Give an example of a square matrix.

4.1.4 Chapter 4.1 25 2 3 5 1 15 6 15 7 is a square matrix as it has the same number of rows and columns, that is, 3. The diagonal elements of are a, a 1, a 7. Upper triangular matrix: 25 33 A n n matrix for which a ij, i > j for all i, j is called an upper triangular matrix. That is, all the elements below the diagonal entries are zero. Example 5 Give an example of an upper triangular matrix. 1 7.1 6 155 is an upper triangular matrix. Lower triangular matrix: A n n matrix for which a ij, j > i for all i, j is called a lower triangular matrix. That is, all the elements above the diagonal entries are zero. Example 6 Give an example of a lower triangular matrix. 1.3 1.6 2.5 1 is a lower triangular matrix. Diagonal matrix: A square matrix with all non-diagonal elements equal to zero is called a diagonal matrix, that is, only the diagonal entries of the square matrix can be non-zero, (, i j ). a ij Example 7 Give examples of a diagonal matrix.

Introduction 4.1.5 3 2.1 5 is a diagonal matrix. Any or all the diagonal entries of a diagonal matrix can be zero. For example 3 2.1 is also a diagonal matrix. Identity matrix: A diagonal matrix with all diagonal elements equal to 1 is called an identity matrix, (, i j for all i, j and a 1 for all i ). a ij ii Example 8 Give an example of an identity matrix. 1 1 1 is an identity matrix. Zero matrix: 1 A matrix whose all entries are zero is called a zero matrix, ( a for all i and j ). ij Example 9 Give examples of a zero matrix. [B]

4.1.6 Chapter 4.1 [C] [ D ] [ ] are all examples of a zero matrix. Tridiagonal matrices: A tridiagonal matrix is a square matrix in which all elements not on the following are zero - the major diagonal, the diagonal above the major diagonal, and the diagonal below the major diagonal. Example 1 Give an example of a tridiagonal matrix. 2 4 2 3 9 5 3 is a tridiagonal matrix. 2 6 Do non-square matrices have diagonal entries? Yes, for a m n matrix [ A ], the diagonal entries are a, a..., a k 1, k 1, akk where k min{ m, n}. Example What are the diagonal entries of 3.2 5 6 7 2.9 3.2 5.6 7.8 The diagonal elements of are a.2 and a 7. Diagonally Dominant Matrix: A 3 n n square matrix is a diagonally dominant matrix if n a ii a ij for i 1,2,..., n and i j 1 j

Introduction 4.1.7 n a ii > a ij for at least one i, i j 1 j that is, for each row, the absolute value of the diagonal element is greater than or equal to the sum of the absolute values of the rest of the elements of that row, and that the inequality is strictly greater than for at least one row. Diagonally dominant matrices are important in ensuring convergence in iterative schemes of solving simultaneous linear equations. Example 12 Give examples of diagonally dominant matrices and not diagonally dominant matrices. 15 6 7 2 4 2 3 2 6 is a diagonally dominant matrix as a 15 15 a12 + a13 6 + 7 13 a 4 a + a 2 + 2 4 a 4 21 23 33 6 6 a31 + a32 3 + 2 5 and for at least one row, that is Rows 1 and 3 in this case, the inequality is a strictly greater than inequality. 15 6 9 [B] 2 4 2 3 2 5.1 is a diagonally dominant matrix as b b 15 15 b12 + b13 6 + 9 4 b + b 2 + 2 15 4 4 21 23 33 5.1 5.1 b31 + b32 3 + 2 b 5 The inequalities are satisfied for all rows and it is satisfied strictly greater than for at least one row (in this case it is Row 3). 25 5 1 [ C ] 64 8 1 144 12 1 is not diagonally dominant as c 8 c + c 64 + 1 65 8 21 23

4.1.8 Chapter 4.1 When are two matrices considered to be equal? Two matrices and [B] are equal if the size of and [B] is the same (number of rows and columns of are same as that of [B]) and a b for all i and j. ij ij Example 13 What would make 2 3 6 7 to be equal to b 3 [ B ] 6 b The two matrices and [B] ould be equal if b 2 and b 7. Key Terms: Matrix Vector Submatrix Square matrix Equal matrices Zero matrix Identity matrix Diagonal matrix Upper triangular matrix Lower triangular matrix Tri-diagonal matrix Diagonally dominant matrix