170
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm

Pages 954-969 | Received 14 Oct 2011, Accepted 20 Jul 2012, Published online: 18 Sep 2012
 

Abstract

By a theorem of Frobenius (F.G. Frobenius, Über die mit einer Matrix vertauschbaren Matrizen, Sitzungsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin (1910), pp. 3–15 (also in Gesammelte Abhandlungen, Band 3, Springer 1968. pp. 415–427)), every matrix A n,n over any field 𝔽 is the product of two symmetric ones. Using the algorithm of Huang and Nong (J. Huang and L. Nong, An iterative algorithm for solving finite-dimensional linear operator equations T(x) = f with applications, Linear Algebra Appl. 432 (2010), pp. 1176–1188) for linear systems, we develop an algorithm to compute a symmetric matrix S = S T  ∈ 𝔽 n,n for which SA is symmetric for any given square matrix A ∈ 𝔽 n,n where 𝔽 = ℝ or ℂ. The algorithm is implemented and tested in MATLAB.

AMS Subject Classifications::

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 670.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.