Block Lanczos algorithm (original) (raw)
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. It is based on, and bears a strong resemblance to, the Lanczos algorithm for finding eigenvalues of large sparse real matrices.
| Property | Value |
|---|---|
| dbo:abstract | 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 quadratic sieve and number field sieve, and its development has been entirely driven by this application. It is based on, and bears a strong resemblance to, the Lanczos algorithm for finding eigenvalues of large sparse real matrices. (en) |
| dbo:wikiPageID | 14572979 (xsd:integer) |
| dbo:wikiPageLength | 1940 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1094555967 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Number_field_sieve dbr:Algorithm dbr:Integer_factorization dbr:Matrix_(mathematics) dbr:Eigenvalue dbr:Computer_science dbr:Tuple dbr:Lanczos_algorithm dbr:Finite_field dbr:Quadratic_sieve dbc:Numerical_linear_algebra dbr:Block_Wiedemann_algorithm dbr:Nullspace |
| dbp:wikiPageUsesTemplate | dbt:Reflist dbt:Linear-algebra-stub |
| dct:subject | dbc:Numerical_linear_algebra |
| gold:hypernym | dbr:Algorithm |
| rdf:type | dbo:Software |
| rdfs:comment | 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. It is based on, and bears a strong resemblance to, the Lanczos algorithm for finding eigenvalues of large sparse real matrices. (en) |
| rdfs:label | Block Lanczos algorithm (en) |
| owl:sameAs | freebase:Block Lanczos algorithm wikidata:Block Lanczos algorithm https://global.dbpedia.org/id/4a5Yu |
| prov:wasDerivedFrom | wikipedia-en:Block_Lanczos_algorithm?oldid=1094555967&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Block_Lanczos_algorithm |
| is dbo:wikiPageRedirects of | dbr:Block_lanczos_algorithm_for_nullspace_of_a_matrix_over_a_finite_field dbr:Block_Lanczos_algorithm_for_nullspace_of_a_matrix_over_a_finite_field |
| is dbo:wikiPageWikiLink of | dbr:Peter_Montgomery_(mathematician) dbr:List_of_numerical_analysis_topics dbr:Block_lanczos_algorithm_for_nullspace_of_a_matrix_over_a_finite_field dbr:Block_Lanczos_algorithm_for_nullspace_of_a_matrix_over_a_finite_field |
| is foaf:primaryTopic of | wikipedia-en:Block_Lanczos_algorithm |