There are several examples in our book where we are supposed to transform vectors into scalar multiples of the first unit vector using either Givens-rotations or Householder reflections.
What is the time complexity of these methods, respectively? Can we use results for the time-complexity of Q-R decomposition using Givens or Householder somehow (they both lie in $O(nm^2)$?