Volume 21, pp. 20-27, 2005.

QR factorizations using a restricted set of rotations

Dianne P. O'Leary and Stephen S. Bullock


Any matrix $A$ of dimension $m \times n$ ($m \ge n$) can be reduced to upper triangular form by multiplying by a sequence of $mn-n(n+1)/2$ appropriately chosen rotation matrices. In this work, we address the question of whether such a factorization exists when the set of allowed rotation planes is restricted. We introduce the rotation graph as a tool to devise elimination orderings in QR factorizations. Properties of this graph characterize sets of rotation planes that are sufficient (or sufficient under permutation) and identify rotation planes to add to complete a deficient set. We also devise a constructive way to determine all feasible rotation sequences for performing the QR factorization using a restricted set of rotation planes. We present applications to quantum circuit design and parallel QR factorization.

Full Text (PDF) [147 KB], BibTeX

Key words

QR decomposition, Givens rotations, plane rotations, parallel QR decomposition, quantum circuit design, qudits

AMS subject classifications

65F25, 81R05, 65F05, 65F20, 81P68

< Back