Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Computing real solutions of polynomial fuzzy systems

Abstract : This paper presents an efficient algorithm called SolvingFuzzySystem, or SFS, for finding real solutions of polynomial systems whose coefficients are fuzzy numbers with finite support and bijective spread functions. The real solutions of a given fuzzy 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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Annick Valibouze Connect in order to contact the contributor
Submitted on : Monday, December 18, 2017 - 10:37:49 PM
Last modification on : Sunday, June 26, 2022 - 5:33:38 AM


Files produced by the author(s)


  • HAL Id : hal-01666957, version 1



Philippe Aubry, Jérémy Marrez, Annick Valibouze. Computing real solutions of polynomial fuzzy systems. 2017. ⟨hal-01666957⟩



Record views


Files downloads