Generic matrix multiplication and memory management in linBox

Authors:
Erich Kaltofen;Dmitriy Morozov;George Yuhasz
Affiliations:
North Carolina State University, Raleigh, NC;Duke University, Durham, NC;North Carolina State University, Raleigh, NC
Venue:
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Year:
2005

Citing 5
Cited 2

Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

Journal of Symbolic Computation - Special issue on computational algebraic complexity
The C++ Programming Language, Third Edition

The C++ Programming Language, Third Edition
C++ Standard Template Library

C++ Standard Template Library
FFPACK: finite field linear algebra package

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Smith normal form of dense integer matrices fast algorithms into practice

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

Some recent progress in exact linear algebra and related questions

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
LINBOX founding scope allocation, parallel building blocks, and separate compilation

ICMS'10 Proceedings of the Third international congress conference on Mathematical software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the design and implementation of two components in the LinBox library. The first is an implementation of black box matrix multiplication as a lazy matrix-times-matrix product. The implementation uses template meta-programming to set the intermediate vector type used during application of the matrix product. We also describe an interface mechanism that allows incorporation of external components with native memory management such as garbage collection into LinBox. An implementation of the interface based on SACLIB's field arithmetic procedures is presented.