期刊文献+

Research of optimization to solve nonlinear equation based on granular computing

Research of optimization to solve nonlinear equation based on granular computing
下载PDF
导出
摘要 In this article,a real number is defined as a granulation and the real space is transformed into real granular space[1].In the entironment,solution of nonlinear equation is denoted by granulation in real granular space.Hence,the research of whole optimization to solve nonlinear equation based on granular computing is proposed[2].In classical case,we solve usually accurate solution of problems.If can't get accurate solution,also finding out an approximate solution to close to accurate solution.But in real space,approximate solution to close to accurate solution is very vague concept.In real granular space,all of the approximate solutions to close to accurate solution are constructed a set,it is a granulation in real granular space.Hence,this granulation is an accurate solution to solve problem in some sense,such,we avoid to say vaguely "approximate solution to close to accurate solution".We introduce the concept of granulation in one dimension real space.Any positive real number a together with moving infinite small distance ε will be constructed an interval [a-ε,a+ε],we call it as granulation in real granular space,denoted by ε(a)or [a].We will discuss related properties and operations[3] of the granulations.Let one dimension real space be R,where each real number a will be generated a granulation,hence we get a granular space R based on real space R.Obviously,R∈R.Infinite small number in real space R is only 0,and there are three infinite small granulations in real number granular space R:[0],[ε] and [-ε].As the graph in Fig.1 shows.In Fig.1,[-ε] is a negative infinite small granulation,[ε] is a positive infinite small granulation,[0] is a infinite small granulation.[a] is a granulation of real number a generating,it could be denoted by interval [a-ε,a+ε] in real space [3-5].Fig.1 Real granulations [0] and [a] Let f(x)=0 be a nonlinear equation,its graph in interval [-3,10] is showed in Fig.2.Where-3≤x≤10 Relation ρ(f| |,ε)is defined as follows:(x1,x2)∈ρ(f| |,ε)iff |f(x1)-f(x2)| < ε Where ε is any given small real number.We have five approximate solution sets on the nonlinear equation f(x)=0 by ρ(f| |,ε)∧|f(x)|[a,b]max,to denote by granulations [(xi1+xi2)/2],[(xi3+xi4)/2],[(xi5+xi6)/2],[(xi7+xi8)/2] and [(xi9+xi10)/2] respectively,where |f(x)|[a,b]max denotes local maximum on x∈[a,b].This is whole optimum on nonlinear equation in interval [-3,10].We will get best optimization solution on nonlinear equation via computing f(x)to use the five solutions denoted by granulation in one dimension real granular space[2,5]. Extended abstract: In this article, a real number is defined as a granulation and the real space is transformed into real granular space. In the entironment, solution of nonlinear equation is denoted by granulation in real granular space. Hence, the research of whole optimization to solve nonlinear equation based on granular computing is proposed. In classical case, we solve usually accurate solution of problems. If can't get accurate solution, also finding out an approximate solution to clause to accurate solution. But in real space, approximate solution to close to accurate solution is very vague concept. In real granular space, all of the approximate solutions to close to accurate solution are constructed a set, it is a granulation in real granular space. Hence, this granulation is an accurate solution to solve problem in some sense, such, we avoid to say vaguely "approximate solution to close to accurate solution". We introduce the concept of granulation in one dimension real space. Any positive real number a together with moving infinite small distance ε will be constructed an interval [α-ε,α-ε], we call it as granulation in real granular space, denoted by ε(α) or [a]. We will discuss related properties and operations of the granulations. Let one dimension real space be R, where each real number a will be generated a granulation, hence we get a granular space R^* based on real space R. Obviously, R∈R^* . Infinite small number in real space R is only 0, and there are three infinite small granulations in real number granular space R^+ : [0], [ε] and [-ε]. As the graph in Fig. 1 shows. In Fig. 1, [-ε] is a negative infinite small granulation,[ε] is a positive infinite small granulation, [0] is a infinite small granulation. [α] is a granulation of real number a generating, it could be denoted by interval [α-ε,α+ε] in real space [3-5]. Let f(x)=0 be a nonlinear equation, its graph in interval [-3,10] is showed in Fig. 2 Where - 3≤x≤ 10 Relation p(f|| ,ε) is defined as follows: (x1,x2) ∈p(f||,ε) iff |f(x1)-f(x2)] 〈ε Where e is any given small real number. We have five approximate solution sets on the nonlinear equation f(x)= 0 by ρ(f|| ,ε) ∧|f(x) [a,b]max to denote by granulations [(xi1 +xi2 )/2], [(xi3 +xi4 )/2], [(xi5 +xi6 )/2], [(xi7 +xi8 )/2] and [(xi9 +xi10 )/2] respectively, where |f(x) |[a,b]max denotes local maximum on x ∈ [a,b]. This is whole optimum on nonlinear equation in interval [- 3,10]. We will get best optimization solution on nonlinear equation via computing f(x) to use the five solutions denoted by granulation in one dimension real granular space[2,5].
作者 LIU Qing
出处 《重庆邮电大学学报(自然科学版)》 2008年第3期370-371,共2页 Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
关键词 最优化设计 非线性方程 粒度 计算方法 nonlinear equation granular computing granular space
  • 相关文献

参考文献1

二级参考文献63

  • 1刘清,黄兆华.G-逻辑及其归结推理[J].计算机学报,2004,27(7):865-873. 被引量:28
  • 2刘清,孙辉.从Rough集的发展前景看粒计算的研究趋势[J].南昌工程学院学报,2006,25(5):1-10. 被引量:6
  • 3Skowron A, Stepaniuk J. Information granules and Rough neureomputing//Sankar K Pal, Polkowski L, Skowron A eds. Rough Neuroeomputing: Techniques for Computing with Words, Cognitive Technologies. Berlin: Springer-Verlag, 2003:43-84
  • 4Skowron A, Swiniarski R. Information granulation and pattern recognition// Sankar K Pal, Polkowski L, Skowron A eds. Rough Neurocomputing: Techniques for Computing with Words, Cognitive Technologies. Berlin: Springer-Vetlag, 2003: 43-636
  • 5Skowron A. Toward intelligent systems: Calculi of information granules. Bulletin of International Rough Set Society, 2001, 5(1-2): 9-30
  • 6Skowron A, Stepaniuk J, Peters, James F. Extracting patterns using information granules. Bulletin of International Rough Set Society, 2001, 5(1-2): 135-142
  • 7Nguyen H S, Skowron A, Stepaniuk J. Granular computing, A Rough set approach. Computational Intelligence: An International Journal, 2001, 17(3): 514-544
  • 8Polkowski L, Skowron A. Constructing Rough metrological granules of classifying rules and classify algorithms//Studies in Fuzziness and Soft Computing 89. Berlin: Physica-Verlag, 2002: 57-70
  • 9Polkwski L. Towards Rough set foundations, metrological approach//Lecture in Artificial Intelligence 3066. Berlin: Springer-Verlag, 2004:8-25
  • 10Polkwski L. A Calculus on granules from Rough inclusions in information systems//Proceedings of the International Forum on Theory of GrC from Rough Set Perspective, Journal of Nanchang Institute of Technology, 25(2), Nanchang, China, 2006:22-27

共引文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部