Efficient vector and parallel manipulation of tensor products
- 1 March 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 22 (1) , 18-23
- https://doi.org/10.1145/225545.225548
Abstract
We present efficient vector and parallel methods for manipulating tensor products of matrices. We consider both computing the matrix-vector product (A 1 ļÄA K )x and solving the system of linear equations (A 1 ļÄA K )x=b. The methods described are independent of K . We accompany this article with a companion algorithm which describes an implementation of a complete set of tensor product routines based on LAPACK and the Level 2 and 3 Basic Linear Algebra Subprograms (BLAS) which provide vectorization and parallelization.Keywords
This publication has 6 references indexed in Scilit:
- An extended set of FORTRAN basic linear algebra subprogramsACM Transactions on Mathematical Software, 1988
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programsACM Transactions on Mathematical Software, 1988
- A proposal for a set of level 3 basic linear algebra subprogramsACM SIGNUM Newsletter, 1987
- Tensor Product Generalized ADI Methods for Separable Elliptic ProblemsSIAM Journal on Numerical Analysis, 1987
- Tensor spline approximationLinear Algebra and its Applications, 1980
- Efficient Computer Manipulation of Tensor ProductsACM Transactions on Mathematical Software, 1979