Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic

DOI10.1016/0377-0427(88)90385-8zbMath0635.65046OpenAlexW2134760331MaRDI QIDQ1097642

V. Ch. Venkaiah, Syamal K. Sen

Publication date: 1988

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(88)90385-8

zbMATH Keywords

Gauss eliminationrecursive algorithmEuclid's algorithmsimilar matricesfloating-point modular arithmeticmultiple-modulus residue arithmeticerror-free matrix symmetrizernon-symmetric eigenvalue problem

Mathematics Subject Classification ID

Related Items (8)

Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison. ⋮ Solving linear programming problems exactly ⋮ Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays ⋮ A direct heuristic algorithm for linear programming ⋮ \(2^n\) in scientific computation and beyond ⋮ Max-min problems on the ranks and inertias of the matrix expressions \(A - BXC \pm (BXC)^{\ast}\) with applications ⋮ Error-free matrix symmetrizers and equivalent symmetric matrices ⋮ \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the similarity transformation between a matrix and its transpose
• The role of symmetric matrices in the study of general matrices
• Exact reduction of a polynomial matrix to the Smith normal form
• Exact Inversion of a Rational Polynomial Matrix Using Finite Field Transforms
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Residue Arithmetic Algorithms for Exact Computation ofg-Inverses of Matrices
• The Exact Solution of Systems of Linear Equations with Polynomial Coefficients

This page was built for publication: Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic