摘要
一、引言任何方阵均满足它的特征方程(Cayley—Hamilton定理)意味着任何非奇异方阵的逆均可用该方阵的幂和其特征多项式系数表出.(以下简称CH定理,CH法),这种方法的计算量高达O(n^4),不宜用于实际计算.自从并行计算机出现之后,有时一项工作的计算时间比计算量更为重要,快速算法应运而生,csanky提出以并行观点重新研究CH法,他在逆阵计算复杂性理论上给出一个惊人的结果,用O(log^2n)步可解任何非奇n阶方阵的求逆问题.
The Cayley-Hamilton method for matrix inversion interests many research work, since using parallel computers. Our present intention is to describe a simplest C-H algorithm and to provide a more complete analysis of the unstability of the method. We consider that C-H method will not be an usable numerical method for real parallel computers.
基金
国家自然科学基金资助
