算法的数值稳定性的比较

Comparisons Among Diverse Concepts of Numerical Stability of the Algorithms

对各种各样的数值稳定性概念进行了详细的叙述与比较，确定了它们之间的强弱关系，并对解线性方程组的情况进行了较详细的讨论．

Finding numerically stable algorithms is a primary task of numerical analysis,so that diverse concepts of numerical stability of the algorithms are given by many mathematians. In this paper, we investigate the relations among those concepts. We show that the equivalence relations, strong and weak relations among them for general algorithms. These relations, with respect to the algorithms for solving linear systems Au=b, are discussed in detail.