| 基于Rough集的牛顿迭代法求方程近似解算法 |
| |
| 引用本文： | 周永权,刘宣会.基于Rough集的牛顿迭代法求方程近似解算法[J].计算机工程与设计,2004,25(3):356-357,361. |
| |
| 作者姓名： | 周永权 刘宣会 |
| |
| 作者单位： | 广西民族学院,数学与计算机科学系,广西,南宁,530006 |
| |
| 基金项目： | 广西自然科学基金项目(桂科基0141034)，广西高校百名中青年学科带头人项目。 |
| |
| 摘 要： | Rough集理论作为一种新型的数学工具已广泛应用于各个领域。提出一种基于Rough集的牛顿迭代法求方程近似解算法，该算法将Rough理论中的下近似和上近似与牛顿迭代法有机地结合起来，寻找方程的近似解，其优点在于所求方程的根是一个精确的区间，该区间中任意实数都可作为所求方程的近似解，避免了一般方法求方程的近似解，把求得的近似数作为近似解，算法计算简单，易推广到其它的近似计算中，同时，有助于人们深刻理解Rough集理论本质。
|
| 关 键 词： | Rough集 代数方程 牛顿迭代法 近似解 区间 人工智能 |
| 文章编号： | 1000-7024(2004)03-0356-02 |
Algorithm of seeking approximate roots based on rough set and Newton interative method for equation |
| |
| ZHOU Yong-quan,LIU Xuan-hui.Algorithm of seeking approximate roots based on rough set and Newton interative method for equation[J].Computer Engineering and Design,2004,25(3):356-357,361. |
| |
| Authors: | ZHOU Yong-quan LIU Xuan-hui |
| |
| Abstract: | A algorithm of seeking approximate roots based on rough set and Newton interative method for an algebra equation, the algorithm describes the process of seeking approximate roots of an equation using the lower approximate and the upper approximate root is a precise interval which is consists of the lower approximate and the upper approximate of rough set, the algorithm is simple and will widely used the other approximate computation fields. These conclusion are helpful for people to understand the essence of rough set theory. |
| |
| Keywords: | rough set algebra equation Newton interative method approximate root interval |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
