摘要
本文在文 [1 ]的基础上定义了关键因子的概念 ,提出了一次同余组的关键因子求解算法 ,并给出了解的舍入误差估计 .通过实例说明了该算法的求解过程 ,分析了该算法在计算机求解时相对于传统解法的优点 .
This paper suggests a definition of the key fact or , a solution to the counting method of first-degree congruent equations, and an estimation of its rounding errors. It also analyses the advantages of the compu tational solution (to this matter) over traditional solution by siting examples of the solution process.
出处
《工科数学》
2001年第4期41-43,共3页
Journal of Mathematics For Technology
关键词
孙子定理
一次同余组
关键数
关键因子
舍入误差
算法
Chineses remainder theorem
congruence of first d egree
key number
key factor
rounding error
