opus:fall2012:bkrishe3:discretepart3
Table of Contents
discrete Keyword 3
finite state machine.
Definition
It is conceived as an abstract machine that can be in one of a finite number of states. The machine is in only one state at a time; the state it is in at any given time is called the current state. It can change from one state to another when initiated by a triggering event or condition, this is called a transition.
References
discrete Keyword 3 Phase 2
Matrix Multiplication
Definition
The multiplication of two or more matrices to produce a new matrix.
References
http://en.wikipedia.org/wiki/Matrix_multiplication#Powers_of_matrices
- Reference 1
- Reference 2
- Reference 3
Demonstration
Suppose MM1
using the inner product approach: InnerMM
while the outer product approach gives: OuterMM
Source Link: http://en.wikipedia.org/wiki/Matrix_multiplication#Algorithms_for_efficient_matrix_multiplication
opus/fall2012/bkrishe3/discretepart3.txt · Last modified: 2012/11/29 14:41 by bkrishe3