Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm
From MaRDI portal
Publication:2850989
DOI10.1080/03081087.2012.716427zbMath1386.65126OpenAlexW2080263023MaRDI QIDQ2850989
Publication date: 1 October 2013
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2012.716427
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison. ⋮ Computation of large-dimension Jordan normal transform via popular platforms
Uses Software
Cites Work
- Error-free matrix symmetrizers and equivalent symmetric matrices
- On the similarity transformation between a matrix and its transpose
- An iterative algorithm for solving a finite-dimensional linear operator equation \(T(x)=f\) with applications
- Inertia and eigenvalue relations between symmetrized and symmetrizing matrices for the real and the general field case
- On the nonsingular symmetric factors of a real matrix
- The role of symmetric matrices in the study of general matrices
- Note on the Factorization of a Square Matrix into Two Hermitian or Symmetric Matrices
- The Factorization of a Square Matrix Into Two Symmetric Matrices
- On computing an equivalent symmetric matrix for a nonsymmetric matrix
This page was built for publication: Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm
