Computing real solutions of fuzzy polynomial systems - Archive ouverte HAL Access content directly
Journal Articles Fuzzy Sets and Systems Year : 2020

Computing real solutions of fuzzy polynomial systems


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.
Fichier principal
Vignette du fichier
2021_Fuzzy_AMV_FSS_VersionAuteur.pdf (389.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02457332 , version 1 (16-03-2021)



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⟩


120 View
103 Download



Gmail Facebook Twitter LinkedIn More