On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
type: Item
instance of: scholarly article
title: On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
zbMATH Open document ID: 0418.68036
DOI: 10.1016/0304-3975(78)90038-5
published in: Theoretical Computer Science
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 15A63
Mathematics Subject Classification ID: 65F99
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 3651740
zbMATH Keywords: varieties of algorithms for the computation of bilinear mappings
zbMATH Keywords: matrix computations
zbMATH Keywords: automorphism groups operating on the variety of optimal algorithms of a bilinear mapping
author: Hans F. de Groote
MaRDI profile type: Publication
full work available at URL: 0304-3975(78)90038-5
OpenAlex ID: W2031905258
cites work: Le théorème de von Staudt en géométrie projective quaternionienne.
cites work: On semi-automorphisms of division algebras
cites work: Q5661659
cites work: Q5611784
cites work: Q4094392
cites work: Q3278687
cites work: On the complexity of quaternion multiplication
cites work: Q4339908
cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
cites work: Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
cites work: Semi -automorphisms of rings
cites work: Gaussian elimination is not optimal
cites work: Q4047029
cites work: Transformations on tensor spaces
cites work: On multiplication of 2 \(\times\) 2 matrices
description: scientific article; zbMATH DE number 3651740