Some fast algorithms multiplying a matrix by its adjoint - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2023

Some fast algorithms multiplying a matrix by its adjoint


We present a non-commutative algorithm for the multiplication of a 2 × 2 block-matrix by its adjoint, defined by a matrix ring anti-homomorphism. This algorithm uses 5 block products (3 recursive calls and 2 general products)over C or in positive characteristic. The resulting algorithm for arbitrary dimensions is a reduction of multiplication of a matrix by its adjoint to general matrix product, improving by a constant factor previously known reductions. We prove also that there is no algorithm derived from bilinear forms using only four products and the adjoint of one of them. Second we give novel dedicated algorithms for the complex field and the quaternions to alternatively compute the multiplication taking advantage of the structure of the matrix-polynomial arithmetic involved. We then analyze the respective ranges of predominance of the two strategies. Finally we propose schedules with low memory footprint that support a fast and memory efficient practical implementation over a prime field.
Fichier principal
Vignette du fichier
aat_adjoint.pdf (669.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03095393 , version 1 (04-01-2021)



Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic. Some fast algorithms multiplying a matrix by its adjoint. Journal of Symbolic Computation, 2023, 115 (March–April), pp.285-315. ⟨10.1016/j.jsc.2022.08.009⟩. ⟨hal-03095393⟩
191 View
246 Download



Gmail Facebook Twitter LinkedIn More