Early Termination over Small Fields II: On the Reliability of Block Krylov-Based Algorithms in a Generic Case

Simple item page
dc.contributor.authorEberly, Wayneen_US
dc.date.accessioned2014-07-15T16:06:00Z
dc.date.available2014-07-15T16:06:00Z
dc.date.issued2014-07-15
dc.description.abstractBlock 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.en_US
dc.description.refereedNoen_US
dc.identifier.department2014-1060-11en_US
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30587
dc.identifier.urihttp://hdl.handle.net/1880/50165
dc.language.isoengen_US
dc.publisher.corporateUniversity of Calgaryen_US
dc.publisher.facultyScienceen_US
dc.subjectAlgorithmsen_US
dc.subjectPerformanceen_US
dc.subjectReliabilityen_US
dc.subjectTheoryen_US
dc.subject.otherBlack box matrix computations, lookahead in biconditional Lanczos algorithms, early termination in Wiedemann algorithms, randomized algorithms, computations over finite fieldsen_US
dc.titleEarly Termination over Small Fields II: On the Reliability of Block Krylov-Based Algorithms in a Generic Caseen_US
dc.typetechnical reporten_US
thesis.degree.disciplineComputer Scienceen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2014-1060-11.pdf
Size:
420.71 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