Résolution réelle de systèmes polynomiaux flous

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 metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01766553
Contributor : Philippe Aubry <>
Submitted on : Friday, April 13, 2018 - 4:59:41 PM
Last modification on : Sunday, March 31, 2019 - 1:22:21 AM

File

systemesFlous_Francais_2018-02...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01766553, version 1

Citation

Philippe Aubry, Jérémy Marrez, Annick Valibouze. Résolution réelle de systèmes polynomiaux flous. 2018. ⟨hal-01766553⟩

Share

Metrics

Record views

321

Files downloads

71