Computing real solutions of fuzzy polynomial systems

被引:2
作者
Aubry, Philippe [1 ]
Marrez, Jeremy [1 ]
Valibouze, Annick [1 ,2 ]
机构
[1] Sorbonne Univ, CNRS, Lab Informat Paris 6, LIP6, F-75005 Paris, France
[2] Sorbonne Univ, CNRS, Lab Probabilites Stat & Modelisat, LPSM, F-75005 Paris, France
关键词
Fuzzy numbers; Fuzzy systems; Fuzzy mathematical programming; Polynomial systems; NUMERICAL-SOLUTION; LINEAR-SYSTEMS; EQUATIONS; RESOLUTION; APPROXIMATION; OPERATIONS;
D O I
10.1016/j.fss.2020.01.004
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents an efficient algorithm called SolveFuzzySystem, or SFS, for finding real solutions of polynomial systems whose coefficients are symmetrical L-R fuzzy numbers with bounded support for which the spread functions L and R are bijective. The real solutions of such a system are deduced from solutions of some polynomial systems with real coefficients. This algorithm is based on new results that are universal because they are independent from the spread functions. These theoretical results include the management of the fuzzy system's solutions signs. An implementation in the Fuzzy package of the free computer algebra software SageMath and a parallel version of the algorithm are described. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:55 / 76
页数:22
相关论文
共 33 条