Suppose we decided to do a series of matrix-vector multiplications in the following order. First, we transform the original ten 2D coordinates (‘A’, ‘B’, ..., ‘J’) with M1, then again transform the resulting coordinates by M2, and finally the second transformed coordinates by M3. Is it possible to save some computational effort (with fewer matrix-vector multiplications)? If the answer is ‘yes’, then how can you achieve that and explain how? If the answer is ‘no’, then explain why?

Transcribed Image Text:

1 Suppose, you are given a 2x2 transformation matrix M3 = -[-0.5 -0.5]. 1 the house after applying this transformation on the 2D coordinates? condade A wodnale F G H B C D A yoones 4 a What would be the shape of Please write down the transformed coordinates or show them on the empty graph above. What type of transformation does this matrix signify? 1 Suppose, you are given a 2x2 transformation matrix M3 = -[-0.5 -0.5]. 1 the house after applying this transformation on the 2D coordinates? condade A wodnale F G H B C D A yoones 4 a What would be the shape of Please write down the transformed coordinates or show them on the empty graph above. What type of transformation does this matrix signify?

Answer rating: 100% (QA)

a Yes it is possible to save some computational effort by perform... View the full answer