一类具有最大-最小组合的特殊模糊关系方程的最佳近似解的一个简单方法

Yak-Kuen Wu, Chia-Cheng Liu, Yung-Yih Lur, S. Guu
{"title":"一类具有最大-最小组合的特殊模糊关系方程的最佳近似解的一个简单方法","authors":"Yak-Kuen Wu, Chia-Cheng Liu, Yung-Yih Lur, S. Guu","doi":"10.1109/CSO.2010.19","DOIUrl":null,"url":null,"abstract":"Fuzzy relational equations have played an important role in fuzzy modeling and applied to many practical problems. Most theories of fuzzy relational equations based on a premise that the solution set is not empty. However, this is often not the case in practical applications. Recently, Chakraborty et al. presented an efficient algorithm to solve the best approximate solution for the fuzzy relational equations, XoA=I, with max-min composition, where I denotes the identity matrix. In this paper, new theoretical results are proposed for solving this particular problem. Hence, one simple procedure can be presented to find the best approximate solution quickly. A numerical example is provided to illustrate the procedure.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"One Simple Procedure to Finding the Best Approximate Solution for a Particular Fuzzy Relational Equation with Max-min Composition\",\"authors\":\"Yak-Kuen Wu, Chia-Cheng Liu, Yung-Yih Lur, S. Guu\",\"doi\":\"10.1109/CSO.2010.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fuzzy relational equations have played an important role in fuzzy modeling and applied to many practical problems. Most theories of fuzzy relational equations based on a premise that the solution set is not empty. However, this is often not the case in practical applications. Recently, Chakraborty et al. presented an efficient algorithm to solve the best approximate solution for the fuzzy relational equations, XoA=I, with max-min composition, where I denotes the identity matrix. In this paper, new theoretical results are proposed for solving this particular problem. Hence, one simple procedure can be presented to find the best approximate solution quickly. A numerical example is provided to illustrate the procedure.\",\"PeriodicalId\":427481,\"journal\":{\"name\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2010.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Joint Conference on Computational Science and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2010.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

模糊关系方程在模糊建模中起着重要的作用,并应用于许多实际问题。大多数模糊关系方程理论都建立在一个前提上,即解集不为空。然而,在实际应用中通常不是这样。最近,Chakraborty等人提出了一种求解模糊关系方程XoA=I的最优近似解的高效算法,其中I表示单位矩阵。本文提出了新的理论结果来解决这一特殊问题。因此,可以提出一个简单的方法来快速找到最佳近似解。最后给出了一个数值算例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
One Simple Procedure to Finding the Best Approximate Solution for a Particular Fuzzy Relational Equation with Max-min Composition
Fuzzy relational equations have played an important role in fuzzy modeling and applied to many practical problems. Most theories of fuzzy relational equations based on a premise that the solution set is not empty. However, this is often not the case in practical applications. Recently, Chakraborty et al. presented an efficient algorithm to solve the best approximate solution for the fuzzy relational equations, XoA=I, with max-min composition, where I denotes the identity matrix. In this paper, new theoretical results are proposed for solving this particular problem. Hence, one simple procedure can be presented to find the best approximate solution quickly. A numerical example is provided to illustrate the procedure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信