LinBox and future high performance computer algebra

Authors:
Bruce W. Char;B. David Saunders;Bryan Youse
Affiliations:
Drexel University, Philadelphia, PA;University of Delaware, Newark, DE;University of Delaware, Newark, DE
Venue:
Proceedings of the 2007 international workshop on Parallel symbolic computation
Year:
2007

Citing 6
Cited 0

Integer Smith form via the valence: experience with large sparse matrices from homology

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
On efficient sparse integer matrix Smith normal form computations

Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
Smith normal form of dense integer matrices fast algorithms into practice

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Spiral: A Generator for Platform-Adapted Libraries of Signal Processing Algorithms

International Journal of High Performance Computing Applications
High-performance implementations of the Descartes method

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Targeting multi-core architectures for linear algebra applications

Proceedings of the 2006 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computer chip design is entering an era in which further increases in computational power will come by increased on-chip parallelism through multi-core architectures rather than by increasing clock speed. If high performance computer algebra tools are to be offered, they must keep pace with this reality. LinBox is a library for exact linear algebra computation with integer matrices and matrices over finite fields. We discuss how LinBox design can be adapted for distributed and multi-core computation.