Computing real solutions of fuzzy polynomial systems

Philippe Aubry (1) , Jérémy Marrez (2, 1) , Annick Valibouze (3, 1)

1 APR - Algorithmes, Programmes et Résolution
2 ALMASTY - ALgorithms for coMmunicAtion SecuriTY
3 LPSM (UMR_8001) - Laboratoire de Probabilités, Statistique et Modélisation

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.

Mots clés: Fuzzy numbers; Fuzzy systems; Fuzzy mathematical programming; Polynomial systems

Domaines: Calcul formel [cs.SC]; Intelligence artificielle [cs.AI]

Philippe Aubry, Jérémy Marrez, Annick Valibouze. Computing real solutions of fuzzy polynomial systems. Fuzzy Sets and Systems, 2020, 399, pp.55 - 76. ⟨10.1016/j.fss.2020.01.004⟩. ⟨hal-02457332⟩