All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

90 018 (0,285s)

Result

Iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices can be finitely terminating

Some classes of stochastic matrices are descibed for which general iterative aggregation/disaggregation (IAD) methods for computing stationary probability vectors are terminating after a finite number of IAD sweaps....

BA - Obecná matematika

  • 2001
  • Jx
Result

Convergence issues in the theory and practice of iterative aggregation/disaggregation methods

In the paper we solve convergence conditions for the IAD methods for computation stationary probability distribution vector of a stochastic matrix....

BA - Obecná matematika

  • 2009
  • Jx
Result

Aggregation method for computing stationary probability vector

BA - Obecná matematika

  • 1994
  • X
Result

Compartmental systems and computation their stationary probability vectors

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 propose...

BA - Obecná matematika

  • 2012
  • O
  • Link
Result

An aggregation/disaggregation iterative method for computing stationary probability vectors of Markov type operators

BA - Obecná matematika

  • 1996
  • Jx
Result

Global convergence of an aggregation/disaggregation iterative method for computing stationary probability vectors of stochastic matrices

BA - Obecná matematika

  • 1995
  • Jx
Result

Convergence analysis of an aggregation-disaggregation iterative method for computation stationary probability vectors of stochastic matrices

BA - Obecná matematika

  • 1998
  • Jx
Result

Iterative Aggregation - Disaggregation Methods and Ordering Algorithms

We present some modifications of two-level methods for computing stationary probability distribution vector of large discrete time Markov chains. The approach considered is an iterative aggregation - disaggregation...

BA - Obecná matematika

  • 2008
  • D
Result

Tarjan's algorithm in computing PageRank

As a core problem in computing PageRank a stationary probability distribution vector is solved. We show, that using Tarjan's reordering in connection to iterative aggregation-disaggregation method can speed up the ...

BC - Teorie a systémy řízení

  • 2005
  • A
Result

Local convergence analysis of iterative aggregation-disaggregation methods with polynomial correction

We study the iterative aggregation - disaggregation methods for computing stationary probability distribution vector of a stochastic matrix. A correction step is considered to be a polynomial in the matrix. Several...

BA - Obecná matematika

  • 2007
  • Jx
  • 1 - 10 out of 90 018