About: Compartmental systems and computation their stationary probability vectors

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Compartmental systems and computation their stationary probability vectors Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://siamla2012.webs.upv.es/
Description	To compute stationary probability vectors of Markov chains whose transition matrices are cyclic of index p may be a difficult task if p becomes large. A class of iterative aggregation/disaggregation methods (IAD) is proposed to overcome the difficulty. It is shown that the rate of convergence of the proposed IAD processes is governed by the maximal modulus of the eigenvalues laying out of the peripheral spectrum of the smoothing matrix. The examined generators of Markov chains come from compartmental systems and cause that the transition matrices under consideration may depend upon the appropriate stationary probability vectors. The nonlinearity represents further difficulties in computation. To compute stationary probability vectors of Markov chains whose transition matrices are cyclic of index p may be a difficult task if p becomes large. A class of iterative aggregation/disaggregation methods (IAD) is proposed to overcome the difficulty. It is shown that the rate of convergence of the proposed IAD processes is governed by the maximal modulus of the eigenvalues laying out of the peripheral spectrum of the smoothing matrix. The examined generators of Markov chains come from compartmental systems and cause that the transition matrices under consideration may depend upon the appropriate stationary probability vectors. The nonlinearity represents further difficulties in computation. (en)
Title	Compartmental systems and computation their stationary probability vectors Compartmental systems and computation their stationary probability vectors (en)
skos:prefLabel	Compartmental systems and computation their stationary probability vectors Compartmental systems and computation their stationary probability vectors (en)
skos:notation	RIV/68407700:21110/12:00196695!RIV14-MSM-21110___
http://linked.open...avai/predkladatel	Fakulta stavební
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Marek, Ivo
http://linked.open.../riv/druhVysledku	O - Ostatní výsledky nezařaditelné do žádného z výše uvedených druhů výsledku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta stavební
http://linked.open...dnocenehoVysledku	128114
http://linked.open...ai/riv/idVysledku	RIV/68407700:21110/12:00196695
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	iterative aggregation/disaggregation methods; matrix (en)
http://linked.open.../riv/klicoveSlovo	matrix iterative aggregation/disaggregation methods
http://linked.open...ontrolniKodProRIV	[125CAEF8F79B]
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Marek, Ivo
http://localhost/t...ganizacniJednotka	21110

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software