Block Lanczos algorithm
id:
block-lanczos-algorithm-270-6797044
title:
Block Lanczos algorithm
text:
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. The block Lanczos algorithm is amongst the most efficient methods known for finding nullspaces, which is the final stage in integer factorization algorithms such as the
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Block_Lanczos_algorithm
date created:
date modified:
2023-10-24T20:23:53Z
main entity:
{"identifier":"Q4927153","url":"https://www.wikidata.org/entity/Q4927153"}
image:
fields total:
13
integrity:
13