首页> 外文期刊>Kybernetika >AN ITERATIVE ALGORITHM FOR TESTING SOLVABILITY OF MAX-MIN INTERVAL SYSTEMS
【24h】

AN ITERATIVE ALGORITHM FOR TESTING SOLVABILITY OF MAX-MIN INTERVAL SYSTEMS

机译:检验最大最小区间系统可解性的一种迭代算法

获取原文
获取原文并翻译 | 示例
           

摘要

This paper is dealing with solvability of interval systems of linear equations in max-min algebra. Max-min algebra is the algebraic structure in which classical addition and multiplication are replaced by ⊕ and ⊕, where a ⊕ b = max{a, b}, a⊕b = min{a, b}. The notation A ⊕ x = b represents an interval system of linear equations, where A = [A, A] and b = [b, b] are given interval matrix and interval vector, respectively. We can define several types of solvability of interval systems. In this paper, we define the T4 and T5 solvability and give necessary and sufficient conditions for them.
机译:本文讨论的是最大-最小代数中线性方程组的区间系统的可解性。最大最小代数是代数结构,其中经典加法和乘法被⊕和replaced取代,其中a⊕b = max {a,b},a⊕b= min {a,b}。符号A x = b表示线性方程的间隔系统,其中A = [A,A]和b = [b,b]分别给定间隔矩阵和间隔矢量。我们可以定义区间系统的几种可解性。在本文中,我们定义了T4和T5的可溶性,并为其提供了必要和充分的条件。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号