On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping

DOI10.1016/0304-3975(78)90038-5zbMath0418.68036OpenAlexW2031905258MaRDI QIDQ1131837

Hans F. de Groote

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90038-5

zbMATH Keywords

matrix computationsautomorphism groups operating on the variety of optimal algorithms of a bilinear mappingvarieties of algorithms for the computation of bilinear mappings

Mathematics Subject Classification ID

Related Items (21)

Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u/<Q(u)^{\ell}>\), \(\ell >1\)] ⋮ Commutative algebras of minimal rank ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication ⋮ Some fast algorithms multiplying a matrix by its adjoint ⋮ On the complexity of the multiplication of matrices of small formats ⋮ Dimension of tensor network varieties ⋮ Tensor surgery and tensor rank ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of \(xy\) and \(yx\) where \(x,y\in M_2(K)\) ⋮ Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication ⋮ On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication ⋮ Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u/\langle{} u^ n \rangle\)] ⋮ Towards a geometric approach to Strassen's asymptotic rank conjecture ⋮ New ways to multiply \(3 \times 3\)-matrices ⋮ The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices ⋮ On the additive complexity of 2 \(\times 2\) matrix multiplication ⋮ Fundamental invariants of orbit closures ⋮ Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 ⋮ The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices ⋮ On symmetries of tensor decompositions for the commutator of \(2 \times 2\) matrices ⋮ Equivalent polyadic decompositions of matrix multiplication tensors ⋮ Rank and optimal computation of generic tensors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of quaternion multiplication
• Transformations on tensor spaces
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• On semi-automorphisms of division algebras
• Semi -automorphisms of rings
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• Le théorème de von Staudt en géométrie projective quaternionienne.

This page was built for publication: On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping