DC FieldValueLanguage
dc.contributor.authorMedina, Jesusen_US
dc.contributor.authorStepanović, Vanjaen_US
dc.contributor.authorTepavčević, Andrejaen_US
dc.date.accessioned2023-06-05T08:50:41Z-
dc.date.available2023-06-05T08:50:41Z-
dc.date.issued2023-
dc.identifier.issn0020-0255-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/5029-
dc.description.abstractIn this paper, we are solving matrix equations where the operation on matrices might not be a standard composition, but it can be any convenient binary operation. We use fuzzy (lattice valued) techniques in which a particular fuzzy weak equivalence relation and its compatibility with the matrix operation plays the central role. This fuzzy weak equivalence relation is weakly reflexive, symmetric, transitive, and compatible with the matrix operation. We obtain approximate solutions of two main types of matrix equations. We also tackle the question of the uniqueness of solutions (which are unique up to the fuzzy weak equivalence relation).en_US
dc.publisherElsevieren_US
dc.relation.ispartofInformation Sciencesen_US
dc.subjectLattice valued | Linear equation | Matrix equations | Weak fuzzy equivalence relationen_US
dc.titleSolutions of matrix equations with weak fuzzy equivalence relationsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ins.2023.01.145-
dc.identifier.scopus2-s2.0-85147982910-
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage634-
dc.relation.lastpage645-
dc.relation.volume629-
dc.description.rank~M21a-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
crisitem.author.orcid0000-0002-5716-604X-
Show simple item record

SCOPUSTM   
Citations

2
checked on Sep 8, 2024

Page view(s)

1
checked on Sep 7, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.