Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
作者:
Highlights:
•
摘要
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.
论文关键词:Error-free matrix symmetrizer,Euclid's algorithm,floating-point modular arithmetic,Gauss elimination,nonsymmetric eigenvalue problem,roots of polynomial equation
论文评审过程:Received 6 October 1986, Available online 1 April 2002.
论文官网地址:https://doi.org/10.1016/0377-0427(88)90385-8