Some fast algorithms multiplying a matrix by its adjoint

DOI10.1016/j.jsc.2022.08.009zbMath1505.65192arXiv2101.01025OpenAlexW3120503253WikidataQ114154420 ScholiaQ114154420MaRDI QIDQ2674011

Clément Pernet, Jean-Guillaume Dumas, Alexandre Sedoglavic

Publication date: 22 September 2022

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.01025

zbMATH Keywords

quaternionsadjointmatrix multiplicationanti-homomorphismskew-unitary matrix

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical linear algebra (65F99)

Uses Software

• FFLAS-FFPACK
• OpenBLAS

Cites Work

• Unnamed Item
• On the additive complexity of 2 \(\times 2\) matrix multiplication
• An introduction to geometric complexity theory
• On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
• On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
• On the complexity of quaternion multiplication
• Gaussian elimination is not optimal
• Powers of tensors and fast matrix multiplication
• Efficient complex matrix multiplication
• Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
• Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
• Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix
• On fast multiplication of a matrix by its transpose
• Note on Representing a Prime as a Sum of Two Squares