\(\mathbb F _2 \) Lanczos revisited (Q2469540): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The development of the number field sieve / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Approximate Probabilistic Model for Structured Gaussian Elimination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving linear equations over GF(2): Block Lanczos algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3846497 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2757235 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Dimension of the Hull / rank | |||
Normal rank |
Latest revision as of 16:26, 27 June 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