\(\mathbb F _2 \) Lanczos revisited (Q2469540): Difference between revisions

The authors propose a new variant of the block Lanczos algorithm for finding vectors in the kernel of a symmetric matrix over the binary field \(\mathbb{F}_2\). The runtime of the new algorithm is essentially identical to Montgomery's. Detailedly, the sequence of subspaces produced is decidedly different. In fact, the sequence of subspaces produced by Montgomery's algorithm are pairwise \(A\)-orthogonal, while the subspaces produced in this paper are pairwise orthogonal. Perhaps this variation will eventually prove useful in proving some rigorous results.