The eigenvalue decomposition of normal matrices by the skew-symmetric part

Mataigne, Simon;Gallivan, Kyle
(2026) The Electronic Journal of Linear Algebra — Vol. 42, p. 349-386 (2026)

Files

Mataigne_Gallivan_2026.pdf
  • Open Access
  • Adobe PDF
  • 1.03 MB
Download

Details

Authors
Abstract
(en) We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix A through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as the bidiagonal singular value decomposition and the symmetric eigenvalue decomposition. The advantages of this method stand for normal matrices with few real eigenvalues, such as random orthogonal matrices. We provide a stability and a complexity analysis of the method. The numerical performance is compared with existing algorithms. In most cases, the method has the same operation count as the Hessenberg factorization of a dense matrix. Finally, we provide experiments for the application of computing a Riemannian barycenter on the special orthogonal group.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Mataigne, S., & Gallivan, K. (2026). The eigenvalue decomposition of normal matrices by the skew-symmetric part. The Electronic Journal of Linear Algebra, 42, 349-386. https://doi.org/10.13001/ela.2026.9957 (Original work published 2026)