1. If 2 1 show that if 2 1 where is a constant, then 2. How many flops are required to compute it in the order Show that computing T A can be done in approximately 2 flops. Determine the...

1.

If


<sub>2

1</sub>

show that if

<sub>2

1</sub>

where

is a constant, then

2.

How many flops are required to compute it in the order

Show that computing

^T

A can be done in approximately

²

flops.

Determine the structure of each row of

^T

and consider each row of

^T

A as the inner product of a row of

^T
with all columns of

Show that the

^T

can be done in

flops by first computing

^T

and then

^T
.