Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
A multiple-modulus residue arithmetic is introduced and applied to computing an error-free matrix symmetrizer (i.e., a symmetric nonsingular X satisfying \(XA=A\) tX). In particular, when \(A=(a_{ij})\) is a lower Hessenberg matrix, with nonzero codiagonal elements, then the method recovers the following simple and elegant recursive algorithm to compute a symmetrizer, suggested by Datta (unpublished): Let x 1,x 2,...,x n be the rows of a symmetrizer X to be computed. Step 1: Choose \(x\quad n=(\alpha,0,...,0),\) where \(\alpha\neq 0\) is arbitrary; Step 2 Compute \(x^{n-1},x^{n-2},...,x\) 1 recursively from \(x\quad i=(1/a_{i,i+1})\times (x^{i+1}A-a_{i+1,i+1}x^{i+1}-a_{i+2,\quad i+1}x^{i+2}-...-a_{n,i+1}x\quad n),\) \(i=n-1,...,1\); Step 3: Print x 1,x 2,...,x n and stop.
- On a modified Kovarik algorithm for symmetric matrices
- Approximating Matrices with Multiple Symmetries
- Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm
- Computing the eigenvalues of modified symmetric matrices
- On computing an equivalent symmetric matrix for a nonsymmetric matrix
- Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm
- Error-free matrix symmetrizers and equivalent symmetric matrices
- scientific article; zbMATH DE number 2033416
- Exact computations of the inertia symmetric integer matrices
- scientific article; zbMATH DE number 1782563
- Exact Inversion of a Rational Polynomial Matrix Using Finite Field Transforms
- Exact reduction of a polynomial matrix to the Smith normal form
- scientific article; zbMATH DE number 3874496 (Why is no real title available?)
- scientific article; zbMATH DE number 3809382 (Why is no real title available?)
- scientific article; zbMATH DE number 3443466 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- On the similarity transformation between a matrix and its transpose
- 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
- The role of symmetric matrices in the study of general matrices
- Solving linear programming problems exactly
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays
- A direct heuristic algorithm for linear programming
- 2ⁿ in scientific computation and beyond
- Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm
- Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.
- scientific article; zbMATH DE number 2033416 (Why is no real title available?)
- 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
This page was built for publication: Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097642)
