By Josh Zimmer Department of Mathematics and Computer Science The set ℤ p = {0,1,...,p-1} forms a finite field. There are p ⁴ possible 2×2 matrices in.

Slides:



Advertisements
Similar presentations
Applied Informatics Štefan BEREŽNÝ
Advertisements

Matrices A matrix is a rectangular array of quantities (numbers, expressions or function), arranged in m rows and n columns x 3y.
Y.M. Hu, Assistant Professor, Department of Applied Physics, National University of Kaohsiung Matrix – Basic Definitions Chapter 3 Systems of Differential.
Matrix Definition: An array of numbers in m rows and n colums is called an mxn matrix A square matrix of order n, is an (nxn) matrix.
Refresher: Vector and Matrix Algebra Mike Kirkpatrick Department of Chemical Engineering FAMU-FSU College of Engineering.
Mathematics. Matrices and Determinants-1 Session.
Symmetric and Skew Symmetric
Maths for Computer Graphics
Lecture 19 Quadratic Shapes and Symmetric Positive Definite Matrices Shang-Hua Teng.
Matrix Operations. Matrix Notation Example Equality of Matrices.
Chapter 3 Determinants and Matrices
Chapter 2 Matrices Definition of a matrix.
CSci 6971: Image Registration Lecture 2: Vectors and Matrices January 16, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart, RPI.
1 Neural Nets Applications Vectors and Matrices. 2/27 Outline 1. Definition of Vectors 2. Operations on Vectors 3. Linear Dependence of Vectors 4. Definition.
Lecture 20 SVD and Its Applications Shang-Hua Teng.
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
CALCULUS – II Matrix Multiplication by Dr. Eman Saad & Dr. Shorouk Ossama.
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
化工應用數學 授課教師: 郭修伯 Lecture 9 Matrices
Matrices CS485/685 Computer Vision Dr. George Bebis.
Arithmetic Operations on Matrices. 1. Definition of Matrix 2. Column, Row and Square Matrix 3. Addition and Subtraction of Matrices 4. Multiplying Row.
CE 311 K - Introduction to Computer Methods Daene C. McKinney
A matrix having a single row is called a row matrix. e.g.,
1 Statistical Analysis Professor Lynne Stokes Department of Statistical Science Lecture 5QF Introduction to Vector and Matrix Operations Needed for the.
Linear Algebra With Applications by Otto Bretscher. Page The Determinant of any diagonal nxn matrix is the product of its diagonal entries. True.
Compiled By Raj G. Tiwari
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
Hadamard matrices and the hadamard conjecture
Presentation on Matrices and some special matrices In partial fulfillment of the subject Vector calculus and linear algebra ( ) Submitted by: Agarwal.
Matrices. A matrix, A, is a rectangular collection of numbers. A matrix with “m” rows and “n” columns is said to have order m x n. Each entry, or element,
Lecture 7 Matrices CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
13.1 Matrices and Their Sums
Matrices Matrices For grade 1, undergraduate students For grade 1, undergraduate students Made by Department of Math.,Anqing Teachers college.
Linear algebra: matrix Eigen-value Problems Eng. Hassan S. Migdadi Part 1.
A Review of Some Fundamental Mathematical and Statistical Concepts UnB Mestrado em Ciências Contábeis Prof. Otávio Medeiros, MSc, PhD.
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.
Chapter 6 Systems of Linear Equations and Matrices Sections 6.3 – 6.5.
Notes 7.2 – Matrices I. Matrices A.) Def. – A rectangular array of numbers. An m x n matrix is a matrix consisting of m rows and n columns. The element.
Review of Matrix Operations Vector: a sequence of elements (the order is important) e.g., x = (2, 1) denotes a vector length = sqrt(2*2+1*1) orientation.
Matrices and Determinants
MATRICES Operations with Matrices Properties of Matrix Operations
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
STROUD Worked examples and exercises are in the text Programme 5: Matrices MATRICES PROGRAMME 5.
2.5 – Determinants and Multiplicative Inverses of Matrices.
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
STROUD Worked examples and exercises are in the text PROGRAMME 5 MATRICES.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
Linear Algebra Engineering Mathematics-I. Linear Systems in Two Unknowns Engineering Mathematics-I.
Introduction Types of Matrices Operations
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.
2.1 Matrix Operations 2. Matrix Algebra. j -th column i -th row Diagonal entries Diagonal matrix : a square matrix whose nondiagonal entries are zero.
Invers Matriks Positif dan Non-Positif Pertemuan 12
Linear Algebra With Applications by Otto Bretscher.
Matrices Introduction.
2. Matrix Methods
Matrices and Vector Concepts
12-1 Organizing Data Using Matrices
CS479/679 Pattern Recognition Dr. George Bebis
Review of Matrix Operations
L5 matrix.
2. Matrix Algebra 2.1 Matrix Operations.
CS485/685 Computer Vision Dr. George Bebis
6-4 Symmetric Matrices By毛.
Derivative of scalar forms
MATRICES Operations with Matrices Properties of Matrix Operations
Symmetric Matrices and Quadratic Forms
3.5 Perform Basic Matrix Operations
Eigenvalues and Eigenvectors
Subject :- Applied Mathematics
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Presentation transcript:

By Josh Zimmer Department of Mathematics and Computer Science The set ℤ p = {0,1,...,p-1} forms a finite field. There are p ⁴ possible 2×2 matrices in ℤ p. We will study matrices in special structures, such as: stochastic, rank-one, nilpotent, symmetric, skew-symmetric, and orthogonal. Special structured real matrices such as stochastic, rank-one, symmetric, skew-symmetric, orthogonal, and nilpotent matrices, have many interesting properties when they are in the real field. When a special structured matrix is over a finite field, ℤ p where p is a prime number, does it still have all properties as it does in the real field? In this paper, we study eigenvalue properties of 2×2 special structured matrices with entries in ℤ p A row (column) stochastic matrix is a matrix whose row sums (column sums) are equal to a constant k in ℤ p. A doubly stochastic matrix is both row and column stochastic. Let A r, A c and A d be respectively, row, column, and doubly stochastic matrices in ℤ p. Then: Eigenvalues are of the form: A 2×2 rank one matrix is of the form: A nilpotent matrix has the property A k =0 for k>0. It is known in the real field, nilpotent matrices are of the form: We find nilpotent matrices in ℤ p are: Real symmetric matrices (A T =A) always have eigenvalues in the real field. Let Skew-symmetric matrix is where A T =-A. In this case, the off- diagonal elements of A are not the same, but are the additive inverse (in ℤ p ) of each other. A is orthogonal if AA T =A T A=k²*I for k² in ℤ p. In the real field, eigenvalues of an orthogonal matrix are 1 and -1 All eigenvalues of rank-one matrices are of the form: λ 1 = v T u, λ 2 = 0 and are therefore in ℤ p λ 2 = trace of A – λ 1 All eigenvalues of nilpotent matrices are zero mod(p). For p = 2 Eigenvalues exist in ℤ p iff: Examples: (1) b=1 In this project, we study special structured 2x2 matrices in ℤ p. There are at most, 2p 3 +p 2 stochastic matrices, p 4 rank-one matrices, 3p nilpotent matrices, p 3 symmetric matrices, p skew-symmetric matrices, and p 2 symmetric orthogonal matrices in ℤ p. Due to the construction of stochastic, rank-one, and nilpotent matrices in ℤ p, they will always have eigenvalues in ℤ p. We have derived conditions, respectively, for symmetric, skew- symmetric, and symmetric orthogonal matrices, under which eigenvalues are in ℤ p. Currently, we are studying the eigenvalue properties of non- symmetric orthogonal matrices and other special structured matrices. Let λ 1 = k, (1) (2) Note: non-symmetric orthogonal matrices are still being investigated (1) (2) Examples: For p>2 where u and v are non-zero column vectors in ℤ p. There are p 4 possible rank one matrices in ℤ p. There are only p possible skew-symmetric matrices in ℤ p (2) There are at most 3p possible nilpotent matrices in ℤ p. There are at most p 2 orthogonal matrices in ℤ p There are at most 2p 3 +p 2 stochastic matrices in ℤ p. There are p 3 possible symmetric matrices in ℤ p Skew-symmetric matrices in ℤ p : b Ý p ? b Þ ¯ p m Symmetric orthogonal matrices are: Eigenvalues are λ 1 =k and λ 2 =-k. λ1 and λ2 are in ℤ p iff (a, b, k) are Pythagorean Triples P(λ)=λ 2 -(a+d) λ+(ad-b 2 ) λ 1, λ 2 in ℤ p iff D(a.b.b.d) = (a-d) 2 +4b 2 =n 2 <p iff (a-d, 2b, n) is a Pythagorean Triple