Approximate matrices of systems of max-min fuzzy relational equations

• URL: http://arxiv.org/abs/2504.16042v1
• Date: Tue, 22 Apr 2025 17:09:02 GMT
• Title: Approximate matrices of systems of max-min fuzzy relational equations
• Authors: Ismaïl Baaj,
• Abstract summary: We address the inconsistency of a system of max-min fuzzy relational equations by modifying the matrix governing the system in order to achieve consistency.<n>Our method yields consistent systems that approximate the original inconsistent system.<n>We show that our method allows us to directly compute matrices of consistent systems that use the same right-hand side vector as the inconsistent system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this article, we address the inconsistency of a system of max-min fuzzy relational equations by minimally modifying the matrix governing the system in order to achieve consistency. Our method yields consistent systems that approximate the original inconsistent system in the following sense: the right-hand side vector of each consistent system is that of the inconsistent system, and the coefficients of the matrix governing each consistent system are obtained by modifying, exactly and minimally, the entries of the original matrix that must be corrected to achieve consistency, while leaving all other entries unchanged. To obtain a consistent system that closely approximates the considered inconsistent system, we study the distance (in terms of a norm among $L_1$, $L_2$ or $L_\infty$) between the matrix of the inconsistent system and the set formed by the matrices of consistent systems that use the same right-hand side vector as the inconsistent system. We show that our method allows us to directly compute matrices of consistent systems that use the same right-hand side vector as the inconsistent system whose distance in terms of $L_\infty$ norm to the matrix of the inconsistent system is minimal (the computational costs are higher when using $L_1$ norm or $L_2$ norm). We also give an explicit analytical formula for computing this minimal $L_\infty$ distance. Finally, we translate our results for systems of min-max fuzzy relational equations and present some potential applications.

Related papers

• On learning capacities of Sugeno integrals with systems of fuzzy relational equations [0.0]
  We introduce a method for learning a capacity underlying a Sugeno integral according to training data based on systems of fuzzy relational equations. We show how to obtain the greatest approximate $q$-maxitive capacity and the lowest approximate $q$-minitive capacity, using recent results to handle the inconsistency of systems of fuzzy relational equations.
  arXiv  Detail & Related papers  (2024-08-14T18:40:01Z)
• Stochastic Optimal Control Matching [53.156277491861985]
  Our work introduces Optimal Control Matching (SOCM), a novel Iterative Diffusion Optimization (IDO) technique for optimal control. The control is learned via a least squares problem by trying to fit a matching vector field. Experimentally, our algorithm achieves lower error than all the existing IDO techniques for optimal control.
  arXiv  Detail & Related papers  (2023-12-04T16:49:43Z)
• Maximal Consistent Subsystems of Max-T Fuzzy Relational Equations [0.0]
  We study the inconsistency of a system of $max-T$ fuzzy relational equations of the form $A Box_Tmax x = b$, where $T$ is a t-norm among $min$, the product or Lukasiewicz's t-norm. For an inconsistent $max-T$ system, we construct a canonical maximal consistent subsystem. We show how to iteratively get all its maximal consistent subsystems.
  arXiv  Detail & Related papers  (2023-11-06T12:41:21Z)
• Optimization of Time-Dependent Decoherence Rates and Coherent Control for a Qutrit System [77.34726150561087]
  Incoherent control makes the decoherence rates depending on time in a specific controlled manner. We consider the problem of maximizing the Hilbert-Schmidt overlap between the system's final state $rho(T)$ and a given target state $rho_rm target.
  arXiv  Detail & Related papers  (2023-08-08T01:28:50Z)
• Chebyshev distances associated to the second members of systems of Max-product/Lukasiewicz Fuzzy relational equations [0.0]
  We study the inconsistency of a system of $max$-product fuzzy relational equations and of a system of $max$-Lukasiewicz fuzzy relational equations. We compute the Chebyshev distance associated to the second member of a system of $max$-product fuzzy relational equations and that associated to the second member of a system of $max$-Lukasiewicz relational fuzzy equations.
  arXiv  Detail & Related papers  (2023-01-30T09:18:20Z)
• On the solvability of weakly linear systems of fuzzy relation equations [0.0]
  Systems of fuzzy relation equations and inequalities in which an unknown fuzzy relation is on the one side of the equation or inequality are linear systems. This paper describes the set of fuzzy relations that solve weakly linear systems to a certain degree and provides ways to compute them.
  arXiv  Detail & Related papers  (2022-05-25T16:59:48Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Fast Differentiable Matrix Square Root and Inverse Square Root [65.67315418971688]
  We propose two more efficient variants to compute the differentiable matrix square root and the inverse square root. For the forward propagation, one method is to use Matrix Taylor Polynomial (MTP), and the other method is to use Matrix Pad'e Approximants (MPA) A series of numerical tests show that both methods yield considerable speed-up compared with the SVD or the NS iteration.
  arXiv  Detail & Related papers  (2022-01-29T10:00:35Z)
• Fast Differentiable Matrix Square Root [65.67315418971688]
  We propose two more efficient variants to compute the differentiable matrix square root. For the forward propagation, one method is to use Matrix Taylor Polynomial (MTP) The other method is to use Matrix Pad'e Approximants (MPA)
  arXiv  Detail & Related papers  (2022-01-21T12:18:06Z)
• Sublinear Time Approximation of Text Similarity Matrices [50.73398637380375]
  We introduce a generalization of the popular Nystr"om method to the indefinite setting. Our algorithm can be applied to any similarity matrix and runs in sublinear time in the size of the matrix. We show that our method, along with a simple variant of CUR decomposition, performs very well in approximating a variety of similarity matrices.
  arXiv  Detail & Related papers  (2021-12-17T17:04:34Z)
• Multi-objective discovery of PDE systems using evolutionary approach [77.34726150561087]
  In the paper, a multi-objective co-evolution algorithm is described. The single equations within the system and the system itself are evolved simultaneously to obtain the system. In contrast to the single vector equation, a component-wise system is more suitable for expert interpretation and, therefore, for applications.
  arXiv  Detail & Related papers  (2021-03-11T15:37:52Z)
• Solving the Robust Matrix Completion Problem via a System of Nonlinear Equations [28.83358353043287]
  We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*inmathbbRmtimes n$. The algorithm is highly parallelizable and suitable for large scale problems. Numerical simulations show that the simple method works as expected and is comparable with state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-03-24T17:28:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.