On the solvability of weakly linear systems of fuzzy relation equations

• URL: http://arxiv.org/abs/2205.15292v1
• Date: Wed, 25 May 2022 16:59:48 GMT
• Title: On the solvability of weakly linear systems of fuzzy relation equations
• Authors: Stefan Stanimirovic, Ivana Micic
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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. They are the most studied ones, and a vast literature on linear systems focuses on finding solutions and solvability criteria for such systems. The situation is quite different with the so-called weakly linear systems, in which an unknown fuzzy relation is on both sides of the equation or inequality. Precisely, the scholars have only given the characterization of the set of exact solutions to such systems. This paper describes the set of fuzzy relations that solve weakly linear systems to a certain degree and provides ways to compute them. We pay special attention to developing the algorithms for computing fuzzy preorders and fuzzy equivalences that are solutions to some extent to weakly linear systems. We establish additional properties for the set of such approximate solutions over some particular types of complete residuated lattices. We demonstrate the advantage of this approach via many examples that arise from the problem of aggregation of fuzzy networks.

Related papers

• Bipolar fuzzy relation equations systems based on the product t-norm [0.5735035463793009]
  Bipolar fuzzy relation equations arise as a generalization of fuzzy relation equations considering unknown variables together with their logical connective negations. This paper focuses on the study of bipolar fuzzy relation equations systems based on the max-product t-norm composition.
  arXiv  Detail & Related papers  (2024-09-24T09:09:13Z)
• Simplicial techniques for operator solutions of linear constraint systems [0.0]
  We use the theory of simplicial sets to develop a framework for studying operator solutions of linear systems. Within our framework, we introduce a new class of linear systems that come from simplicial sets. We provide significant evidence for a conjecture stating that for odd $d$ every linear system admitting a solution in a group admits a solution in $ZZ_d$.
  arXiv  Detail & Related papers  (2023-05-13T17:34:29Z)
• Identifiability and Asymptotics in Learning Homogeneous Linear ODE Systems from Discrete Observations [114.17826109037048]
  Ordinary Differential Equations (ODEs) have recently gained a lot of attention in machine learning. theoretical aspects, e.g., identifiability and properties of statistical estimation are still obscure. This paper derives a sufficient condition for the identifiability of homogeneous linear ODE systems from a sequence of equally-spaced error-free observations sampled from a single trajectory.
  arXiv  Detail & Related papers  (2022-10-12T06:46:38Z)
• Evaluating Error Bound for Physics-Informed Neural Networks on Linear Dynamical Systems [1.2891210250935146]
  This paper shows that one can mathematically derive explicit error bounds for physics-informed neural networks trained on a class of linear systems of differential equations. Our work shows a link between network residuals, which is known and used as loss function, and the absolute error of solution, which is generally unknown.
  arXiv  Detail & Related papers  (2022-07-03T20:23:43Z)
• A Deep Gradient Correction Method for Iteratively Solving Linear Systems [5.744903762364991]
  We present a novel approach to approximate the solution of large, sparse, symmetric, positive-definite linear systems of equations. Our algorithm is capable of reducing the linear system residual to a given tolerance in a small number of iterations.
  arXiv  Detail & Related papers  (2022-05-22T06:40:38Z)
• Consistency and Rate of Convergence of Switched Least Squares System Identification for Autonomous Switched Linear Systems [1.1470070927586016]
  We propose switched least squares method for the identification for switched linear systems. Our data-dependent rate of convergence shows that, almost surely, the system identification error is $mathcalObig(sqrtlog(T)/T big)$ where $T$ is the time horizon.
  arXiv  Detail & Related papers  (2021-12-20T18:56:29Z)
• Exact solutions of interacting dissipative systems via weak symmetries [77.34726150561087]
  We analytically diagonalize the Liouvillian of a class Markovian dissipative systems with arbitrary strong interactions or nonlinearity. This enables an exact description of the full dynamics and dissipative spectrum. Our method is applicable to a variety of other systems, and could provide a powerful new tool for the study of complex driven-dissipative quantum systems.
  arXiv  Detail & Related papers  (2021-09-27T17:45:42Z)
• 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)
• StarNet: Gradient-free Training of Deep Generative Models using Determined System of Linear Equations [47.72653430712088]
  We present an approach for training deep generative models based on solving determined systems of linear equations. A network that uses this approach, called a StarNet, has the following desirable properties.
  arXiv  Detail & Related papers  (2021-01-03T08:06:42Z)
• Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms [74.17312533172291]
  We describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) We then explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation)
  arXiv  Detail & Related papers  (2020-12-12T00:01:10Z)
• Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems [107.3868459697569]
  We introduce an eigendecomposition-free approach to training a deep network. We show that our approach is much more robust than explicit differentiation of the eigendecomposition. Our method has better convergence properties and yields state-of-the-art results.
  arXiv  Detail & Related papers  (2020-04-15T04:29:34Z)

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.