\(\mathbb F _2 \) Lanczos revisited (Q2469540): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2007.09.016 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1997286685 / rank | |||
Normal rank |
Revision as of 20:35, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(\mathbb F _2 \) Lanczos revisited |
scientific article |
Statements
\(\mathbb F _2 \) Lanczos revisited (English)
0 references
6 February 2008
0 references
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.
0 references
symmetric matrix
0 references
binary field
0 references
block Lanczos algorithm
0 references