作　　者： ; ;

机构地区： 黔南民族师范学院数学系

出　　处： 《科技信息》 2012年第27期194-195,共2页

摘　　要： 本文研究问题的条件和算法的稳定性描述。抽象地描述了数值计算问题及其算法,并依此给出扰动理论下绝对条件数、相对条件数和算法的稳定性等概念的定义,通过典型实例给以其解释和分析,以明晰它们的区别和关系,建立病态问题和算法的稳定性的分析基础,给出问题求解的方法和步骤。 In this paper, we studied the description of conditions of problem and algorithm stability. Firstly numerical calculation and its algorithms are described in abstract. Hereby, the definition of absolute condition number, relative condition number and algorithm stability are presented under perturbation theory, and then interpret and analyse them through some typical example in order to tell the connections and differences among them and construct the ar^alysis base for ill-conditioned problems and algorithm stability, after that methods and steps of how to deal with this problem is finally provided.

关 键 词： 数值计算 条件数 数值稳定性

领　　域： [理学] [理学]