New Fast Algorithms for Matrix Operations

DOI10.1137/0209027zbMath0446.68034OpenAlexW2120489629MaRDI QIDQ3891765

Pan, Victor Y.

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209027

zbMATH Keywords

bilinear formsarithmetic complexitytrilinear formfast algorithms for matrix operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (21)

On the arithmetic complexity of Strassen-like matrix multiplications ⋮ Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation ⋮ Flip Graphs for Matrix Multiplication ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Relations between exact and approximate bilinear algorithms. Applications ⋮ The bit-operation complexity of matrix multiplication and of all pair shortest path problem ⋮ On the algorithmic complexity of associative algebras ⋮ New combinations of methods for the acceleration of matrix multiplication ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication ⋮ HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs ⋮ Computing lower bounds on tensor rank over finite fields ⋮ Fast matrix multiplication without APA-algorithms ⋮ On the asymptotic complexity of rectangular matrix multiplication ⋮ Further Limitations of the Known Approaches for Matrix Multiplication ⋮ Optimization techniques for small matrix multiplication ⋮ On the synthesis of fast algorithms for signal processing ⋮ Equivalent polyadic decompositions of matrix multiplication tensors ⋮ Randomised algorithms ⋮ Two new algorithms for matrix multiplication and vector convolution ⋮ The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations

This page was built for publication: New Fast Algorithms for Matrix Operations