Algorithms for solving fuzzy relational equations in a probabilistic setting (Q803132): Difference between revisions
From MaRDI portal
Latest revision as of 09:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms for solving fuzzy relational equations in a probabilistic setting |
scientific article |
Statements
Algorithms for solving fuzzy relational equations in a probabilistic setting (English)
0 references
1990
0 references
The author discusses methods suitable for finding approximate solutions to fuzzy relational equations defined in finite universes of discource and taking the form of either a system of equations \(X_ k\cdot R=Y_ k\), \(k=1,2,...,K\) (with R being an unknown fuzzy relation), or a single equation \(X\cdot R=Y\) (with X being looked for). The key idea of the proposed algorithms is to incorporate some statistics concerning the solution of a single equation and utilize it in the final process of approximation of the unknown fuzzy relation (set). Numerical considerations support the established algorithms.
0 references
performance analysis
0 references
approximate solutions
0 references
fuzzy relational equations
0 references
algorithms
0 references
0 references