Editing QR decomposition (section)

====Advantages and disadvantages====

The QR decomposition via Givens rotations is the most involved to implement, as the ordering of the rows required to fully exploit the algorithm is not trivial to determine. However, it has a significant advantage in that each new zero element <math>a_{ij}</math> affects only the row with the element to be zeroed (''i'') and a row above (''j''). This makes the Givens rotation algorithm more bandwidth efficient and parallelizable than the Householder reflection technique.