...
首页> 外文期刊>Moscow University Computational Mathematics and Cybernetics >A Finite Rational Algorithm that Verifies the Diagonalizability of a Square Matrix by Congruence
【24h】

A Finite Rational Algorithm that Verifies the Diagonalizability of a Square Matrix by Congruence

机译:一种通过同余性检验方矩阵对角化性的有限有理算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Let A be a square matrix of order n whose entries are rational or rational Gaussian numbers. A method is described that verifies the possibility of diagonalizing A by means of congruence and uses a finite number of arithmetic (and, in the complex case, conjugation) operations.
机译:设A为n阶方阵,其项为有理数或有理高斯数。描述了一种方法,该方法通过同余验证对角线A的可能性,并使用有限数量的算术(在复杂情况下为共轭)运算。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号