Multilinear algebra and parallel programming

DOI10.1007/BF00127843zbMath0748.65042OpenAlexW3006227194WikidataQ114852817 ScholiaQ114852817MaRDI QIDQ1186818

S. Singh

Publication date: 28 June 1992

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00127843

zbMATH Keywords

parallel programmingParallelizationCRAY Y-MPStrassen's matrix multiplication algorithmEncore Multimaxtensor product formalism

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Related Items

Automatic derivation and implementation of fast convolution algorithms ⋮ The ubiquitous Kronecker product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• A tensor product formulation of Strassen's matrix multiplication algorithm
• Lectures on the complexity of bilinear problems
• Gaussian elimination is not optimal
• A report on the performance of an implementation of Strassen's algorithm
• Extra High Speed Matrix Multiplication on the Cray-2
• Computational Complexity and Numerical Stability
• Exploiting fast matrix multiplication within the level 3 BLAS
• An Adaptation of the Fast Fourier Transform for Parallel Processing