Block Lanczos algorithm
In computer science, the block Lanczos algorithm is an algorithm for finding the nullspace of a matrix over a finite field, using only multiplication of the matrix by long, thin matrices. Such matrices are considered as vectors of tuples of finite-field entries, and so tend to be called 'vectors' in descriptions of the algorithm.
Link from a Wikipage to another Wikipage
primaryTopic
Block Lanczos algorithm
In computer science, the block Lanczos algorithm is an algorithm for finding the nullspace of a matrix over a finite field, using only multiplication of the matrix by long, thin matrices. Such matrices are considered as vectors of tuples of finite-field entries, and so tend to be called 'vectors' in descriptions of the algorithm.
has abstract
In computer science, the block ...... ly driven by this application.
@en
Wikipage page ID
14,572,979
page length (characters) of wiki page
Wikipage revision ID
1,000,189,854
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In computer science, the block ...... descriptions of the algorithm.
@en
label
Block Lanczos algorithm
@en