All Questions
1 question
1
vote
1
answer
75
views
Efficient and stable QR factorization of partially orthonormal matrix
Let $U \in \mathbb{C}^{m \times n_U}$ be an orthonormal matrix, let $A \in \mathbb{C}^{m \times n_A}$, and $m \geq n_U + n_A$. I want to compute a QR factorization $X = \left[U A\right] = QR$, with $Q ...
- 12.5k