摘要
Rough集理论作为一种新型的数学工具已广泛应用于各个领域。提出一种基于Rough集的牛顿迭代法求方程近似解算法,该算法将Rough理论中的下近似和上近似与牛顿迭代法有机地结合起来,寻找方程的近似解,其优点在于所求方程的根是一个精确的区间,该区间中任意实数都可作为所求方程的近似解,避免了一般方法求方程的近似解,把求得的近似数作为近似解,算法计算简单,易推广到其它的近似计算中,同时,有助于人们深刻理解Rough集理论本质。
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.
出处
《计算机工程与设计》
CSCD
2004年第3期356-357,361,共3页
Computer Engineering and Design
基金
广西自然科学基金项目(桂科基0141034)
广西高校百名中青年学科带头人项目。
