Multiplication of two matrices, Mathematics

Need assignment help, Explain Multiplication of two Matrices.

Posted Date: 2/12/2013 4:38:22 AM | Location : United States





Multiplication of two matrices

i. Multiplication is only possible if the first matrix has the similar number of columns as the second matrix has rows. If A is the order a×b, then B has to be of the order b×c. If the A×B = D, then D must be of the order a×c.

ii. The general method of multiplication is which the elements in row m of the first matrix are multiplied by the corresponding elements in columns n of the second matrix and the products acquired are then added providing a single number.

Posted by Amy | Posted Date: 2/12/2013 4:39:17 AM


Related Discussions:- Multiplication of two matrices, Assignment Help, Ask Question on Multiplication of two matrices, Get Answer, Expert's Help, Multiplication of two matrices Discussions

Write discussion on Multiplication of two matrices
Your posts are moderated
Related Questions
discuss the sequencing decision problem for n jobs on two and three machines

please suggest me that how can i get the term papers topics?

1. His favorite current carrot drink contain 40%. but h eneeds add to 80 quarts wife brought his perfect drink mix.

ABC is a right-angled isosceles triangle, right-angled at B. AP, the bisector of ∠BAC, intersects BC at P. Prove that AC 2 = AP 2 + 2(1+√2)BP 2 Ans:    AC = √2AB (Sinc

The perimeter of a rectangle is 104 inches. The width is 6 inches less than 3 times the length. Find out the width of the rectangle. Let l = the length of the rectangle and let

Prove that the Poset has a unique least element Prove that if (A, ) has a least element, then (A,≤)  has a unique least element. Ans: Let (A, ≤) be a poset. Suppose the po


what is market,what is marketing

hi i would like to ask you what is the answer for [-9]=[=5] grade 7

Define a complete lattice and give one example. Ans:  A lattice (L, ≤) is said to be a complete lattice if, and only if every non-empty subset S of L has a greatest lower bound