ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic

Venkaiah, VCh and Sen, SK (1988) Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic. In: Journal of Computational and Applied Mathematics, 21 (1). pp. 27-40.

[img] PDF
Computing_a_matrix.pdf - Published Version
Restricted to Registered users only

Download (854Kb) | Request a copy
Official URL: http://dx.doi.org/10.1016/0377-0427(88)90385-8

Abstract

A symmetric solution X satisfying the matrix equation XA = AtX is called a symmetrizer of the matrix A. A general algorithm to compute a matrix symmetrizer is obtained. A new multiple-modulus residue arithmetic called floating-point modular arithmetic is described and implemented on the algorithm to compute an error-free matrix symmetrizer.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Elsevier science.
Keywords: Error-free matrix symmetrizer;Euclid's algorithm; floating-point modular arithmetic;Gauss elimination; nonsymmetric eigenvalue problem;roots of polynomial equation.
Department/Centre: Division of Physical & Mathematical Sciences > Mathematics
Date Deposited: 07 Sep 2010 05:50
Last Modified: 19 Sep 2010 06:16
URI: http://eprints.iisc.ernet.in/id/eprint/32073

Actions (login required)

View Item View Item