We present a new C++ library design for linear algebra computations on high performance architectures. The template numerical toolkit (TNT) for linear algebra is a successor to the Lapack++, Sparselib++, and IM L++ pack ages, providing support for direct and iterative solvers. Its goal is to formally integrate these ideas into a generic algorithm library supporting user-defined data types and data neutrality. The design of the core library uses compo nents from the C++ standard template library (STL) and the basic parallel extensions defined in High Performance C++ (HPC++).
No takes yet. Share an insight, caveat, or question.
Roldan Pozo (1997) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: