Files and links (1)
SubmittedOpen Access (License Unspecified), Open
Journal article
Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors
ACM communications in computer algebra, v 50(4), pp 173-175
01 Dec 2016
Abstract
The exact probability, dependent on the matrix structure, is given that the block Wiedemann algorithm correctly computes the leading invariant factors of a matrix. A tight lower bound, structure independent, is derived.
Metrics
Details
- Title
- Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors
- Creators
- Gavin Harrison - Drexel UniversityJeremy Johnson - Drexel UniversityB. David Saunders - University of Delaware
- Publication Details
- ACM communications in computer algebra, v 50(4), pp 173-175
- Publisher
- Assoc Computing Machinery
- Number of pages
- 3
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Computer Science (Computing)
- Web of Science ID
- WOS:000397339600012
- Scopus ID
- 2-s2.0-85014393074
- Other Identifier
- 991019168154204721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Mathematics, Applied