Efficient vector and parallel manipulation of tensor products

Authors:
Paul E. Buis;Wayne R. Dyksen
Affiliations:
Ball State Univ., Muncie, IN;Ball State Univ., Muncie, IN
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1996

Citing 5
Cited 3

Tensor product generalized ADI methods for separable elliptic problems

SIAM Journal on Numerical Analysis
An extended set of FORTRAN basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs

ACM Transactions on Mathematical Software (TOMS)
LAPACK's user's guide

LAPACK's user's guide
Efficient Computer Manipulation of Tensor Products

ACM Transactions on Mathematical Software (TOMS)

Efficient descriptor-vector multiplications in stochastic automata networks

Journal of the ACM (JACM)
Hierarchical Structuring of Superposed GSPNs

IEEE Transactions on Software Engineering
Hierarchical Structuring of Superposed GSPNs

PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present efficient vector and parallel methods formanipulating tensor products of matrices. We consider bothcomputing the matrix-vector product (A1Ä¼ÄAK)x and solving the systemof linear equations (A1Ä¼ÄAK)x=b. The methods describedare independent of K. We accompany this article with acompanion algorithm which describes an implementation of a completeset of tensor product routines based on LAPACK and the Level 2 and3 Basic Linear Algebra Subprograms (BLAS) which providevectorization and parallelization.