Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/49494
Title: Sparse Matrix Computations over Small Fields: A Simpler Block Lanczos Algorithm and Its Analysis
Authors: Eberly, Wayne
Keywords: Algorithms, Performance, Reliability
Issue Date: 29-May-2013
Abstract: A simpli ed \block Lanczos" algorithm is presented and its correctness established. While its e ciency in the general case is not proved, preconditioning used for similar algo- rithms is also su cient here. Results concerning reliability and e ciency may be of more general interest because they may serve to (somewhat) better explain the performance of other block algorithms, including block Wiedemann algo- rithms and algorithms that use rectangular blocking.
URI: http://hdl.handle.net/1880/49494
Appears in Collections:Eberly, Wayne

Files in This Item:
File Description SizeFormat 
2013-1036-03.pdf583.02 kBAdobe PDFView/Open


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