Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Consider vectors $a_i\in R^{m\times n}$ and $B\in R^{m\times p}$, with $n +p < m$, and assume that the columns of $(A, B)$ are linearly independent. To compute an orthobasis for $\text{ker}(A)$, it is sufficient to perform an SVD of $A=U\Lambda V^T$ and take the column vectors of $V$ corresponding to the zero singular values of the SVD. Now for the interesting question: suppose that I want to find an orthobasis for $\text{ker}(A)$ such that the $p+1, \ldots, m-n$ elements of this basis be orthogonal to the column vectors of $B$. It is possible to compute such basis efficiently by means of one or more decompositions?

Put it another way: How can I efficiently compute an orthobasis for $\text{ker}(A)$ such that its $p+1, \ldots, m-n$ elements are in $\text{ker}(B)$?

share|improve this question

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.