Sparse Matrix Computations over Small Fields: A Simpler Block Lanczos Algorithm and Its Analysis

Simple item page
dc.contributor.authorEberly, Wayneen_US
dc.date.accessioned2013-05-29T20:57:08Z
dc.date.available2013-05-29T20:57:08Z
dc.date.issued2013-05-29
dc.description.abstractA 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.en_US
dc.description.refereedNoen_US
dc.identifier.department2013-1036-03en_US
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30595
dc.identifier.urihttp://hdl.handle.net/1880/49494
dc.language.isoengen_US
dc.publisher.corporateUniversity of Calgaryen_US
dc.publisher.facultyScienceen_US
dc.subjectAlgorithmsen_US
dc.subjectPerformanceen_US
dc.subjectReliabilityen_US
dc.subject.otherAlgebraic algorithms, analysis of algotithmsen_US
dc.titleSparse Matrix Computations over Small Fields: A Simpler Block Lanczos Algorithm and Its Analysisen_US
dc.typetechnical reporten_US
thesis.degree.disciplineComputer Scienceen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2013-1036-03.pdf
Size:
583.02 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Science Research & Publications