Error-free matrix symmetrizers and equivalent symmetric matrices

DOI10.1007/BF00047212MaRDI QIDQ756925zbMATH OpenOpenAlexFDO

Authors V. Ch. Venkaiah, Syamal K. Sen

Publication date 1990

Published in Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00047212

zbMATH Keywords

eigenvaluesequivalent symmetric matrixerror-free matrix symmetrizersfloating-point modular arithmeticHessenberg matricesmatrix equationmultiple modulus residue arithmeticnonsymmetric eigenvalue problemnumerical examplesparallel implementationQR transformation

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Review text

Given a matrix A, then the symmetric matrix X satisfying \(XA=A'X\) is called a symmetrizer of A. A procedure is given to determine X. Use is made of floating-point modular arithmetic. Computational results are given.

Recommendations

• On symmetrizing a matrix
• Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
• Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm
• Finite spectral procedures in linear algebra
• Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.

Cites work

• An algorithm for computing powers of a Hessenberg matrix and its applications
• Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
• Correction to convergence of the QR algorithm
• scientific article; zbMATH DE number 3874496 (Why is no real title available?)
• scientific article; zbMATH DE number 3428373 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• On computing an equivalent symmetric matrix for a nonsymmetric matrix
• On the similarity transformation between a matrix and its transpose
• Residue Arithmetic Algorithms for Exact Computation ofg-Inverses of Matrices
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• The role of symmetric matrices in the study of general matrices

Cited in

(14)

• Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
• On symmetrizing a matrix
• Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
• Solving linear programming problems exactly
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
• Finite spectral procedures in linear algebra
• Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays
• A direct heuristic algorithm for linear programming
• 2ⁿ in scientific computation and beyond
• Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound
• Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm
• Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.
• A transformation of matrix into symmetric matrix by row elementary operation and its algorithm
• Matrix Symmetrization

This page was built for publication: Error-free matrix symmetrizers and equivalent symmetric matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756925)