Efficient parallelizations of Hermite and Smith normal form algorithms-Reference-Cited by-同舟云学术

Efficient parallelizations of Hermite and Smith normal form algorithms

Published:2009-06 Issue:6 Volume:35 Page:345-357
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Jäger Gerold,Wagner Clemens

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference37 articles.

1. Algorithm 287: matrix triangulation with integer arithmetic [F1];Blankinship;Commun. ACM,1966

2. Algorithms for Hermite and Smith normal matrices and linear diophantine equations;Bradley;Math. Comput.,1971

3. R.P. Brent, Parallel algorithms in linear algebra, in: Proc. Second NEC Research Symposium on Algorithms and Architectures, 1993, pp. 54–72.

4. S. Chatterjee, S. Sen, Cache-efficient matrix transposition, in: Proc. Sixth International Symposium on High-Performance Computer Architecture, IEEE Computer Society, 2000, pp. 195–205.

5. Parallel matrix transpose algorithms on distributed memory concurrent computers;Choi;Parallel Comput.,1995

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From Additive Flowers to Additive Automata Networks;Automata and Complexity;2022

2. Computation of cubical homology, cohomology, and (co)homological operations via chain contraction;Advances in Computational Mathematics;2014-04-10

3. On the existence of solutions in systems of linear Diophantine equations;Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas;2011-06-25