title: Vector multiplication algorithm
body: <p>Let <strong>A,B</strong> be matrixes of R^n space and <strong>b</strong> belong to R^n.Describe a fast algorithm to compute A^-2*B*A^-3*b.How many computations will the algorithm make?</p>
  
  <p>This is an exam question I have for numerical analysis.I tried brute forcing an algorithm but i believe that the answer is more mathematical.</p>
  
  <p>We haven't yet talked about Big O notations so the question asks for strictly the actions of the algorithm.How would you go about answering this question?</p>