Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/50165
Title: Early Termination over Small Fields II: On the Reliability of Block Krylov-Based Algorithms in a Generic Case
Authors: Eberly, Wayne
Keywords: Algorithms, Performance, Reliability, Theory
Issue Date: 15-Jul-2014
Abstract: Block Hankel matrices, generated according to a particular distribution, arise in the analysis of Block Wiedemann and Block Lanczos algorithms. It is shown that if the input matrix A has entries in a small finite field Fq and satisfies a condition that holds generically, then the expected nullities of these matrices are low — as needed to establish the efficiency and reliability of these algorithms. A sparse matrix preconditioner, that ensures that the above-mentioned condition holds with high probability, is also contributed.
URI: http://hdl.handle.net/1880/50165
Appears in Collections:Eberly, Wayne

Files in This Item:
File Description SizeFormat 
2014-1060-11.pdf420.71 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.