Matrix period in max-drast fuzzy algebra

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F12%3A50000479" target="_blank" >RIV/62690094:18450/12:50000479 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Matrix period in max-drast fuzzy algebra

Popis výsledku v původním jazyce

Computation of matrix power period in max-drast fuzzy algebra is described. Matrix power sequences occur in the theory of complex fuzzy systems with transition matrix in max-t algebra, where t is a given triangular fuzzy norm. Behavior of matrix powers in max-min algebra has been well described in literature. The matrix powers in max-drast algebra behave differently. Though, in some cases their properties are rather closely related. Description of the system in max-drast algebra reflects extreme demandson reliability of the system in sense of total reliability of the path between two nodes in the corresponding directed graph. Getting from node i to j reliably means that all edges in the path are weighted by 1, such a path is called strong. The path iscalled weak if there is exactly one uncertainty represented by a weak edge (having positive weight smaller than 1) in the path. Inadmissible path contains two or more weak edges. New elements do not appear in the matrices during the comp

Název v anglickém jazyce

Matrix period in max-drast fuzzy algebra

Popis výsledku anglicky

Computation of matrix power period in max-drast fuzzy algebra is described. Matrix power sequences occur in the theory of complex fuzzy systems with transition matrix in max-t algebra, where t is a given triangular fuzzy norm. Behavior of matrix powers in max-min algebra has been well described in literature. The matrix powers in max-drast algebra behave differently. Though, in some cases their properties are rather closely related. Description of the system in max-drast algebra reflects extreme demandson reliability of the system in sense of total reliability of the path between two nodes in the corresponding directed graph. Getting from node i to j reliably means that all edges in the path are weighted by 1, such a path is called strong. The path iscalled weak if there is exactly one uncertainty represented by a weak edge (having positive weight smaller than 1) in the path. Inadmissible path contains two or more weak edges. New elements do not appear in the matrices during the comp

Druh

D - Stať ve sborníku

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

<a href="/cs/project/EE2.3.20.0001" target="_blank" >EE2.3.20.0001: Informační, kognitivní a interdisciplinární podpora výzkumu</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Mathematical methods in economics : proceedings of 30th international conference

ISBN

978-80-7248-779-0

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

213-218

Název nakladatele

Slezská univerzita. Obchodně podnikatelská fakulta

Místo vydání

Karviná

Místo konání akce

Karviná

Datum konání akce

11. 9. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—