Skip to search formSkip to main contentSkip to account menu

Block Lanczos algorithm

Known as: Block lanczos algorithm for nullspace of a matrix over a finite field 
In computer science, the block Lanczos algorithm is an algorithm for finding the nullspace of a matrix over a finite field, using only multiplication… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
In the present work we describe HPEC (High Performance Eigenvalues Computation), a parallel software package for the evaluation… 
2005
2005
Blocked versions of the Lanczos procedure have been successfully applied to sample nullspace elements of very large sparse… 
2003
2003
An electronic connector is configured to removably receive either a circuit card of a first type, having one row of contacts per… 
2000
2000
preconditioned 为计算大稀少的对称的矩阵的一些 eigenpairs 的反复的方法在这份报纸被介绍。把 preconditioning 技术与块 Lanczos… 
1996
1996
In this paper, an effective method for the time domain simulation of dispersive coupled transmission lines with measured or… 
1995
1995
In this paper we propose a parallel block Lanczos algorithm suitable for MIMD distributed memory message passing architectures… 
1994
1994
Abstract In this paper we propose a block Lanczos algorithm suitable for MIMD distributed memory message passing architectures… 
1990
1990
In this paper we describe a block Lanczos algorithm that is used as the key building block of a software package for the… 
1989
1989
  • Y. Kim
  • 1989
  • Corpus ID: 119022061
Abstract : We use a Lanczos algorithm for computing a few of the smallest eigenvalues and the corresponding eigenvectors of a…