Computer aided solving the high-order transition probability matrix of the finite Markov chain (Q2369093): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3862765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to compute the probability of a run in binary fourth-order Markovian trials. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical path integration of a non-homogeneous Markov process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution models of grazing animals between two grassland resource points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer aided proof for the global stability of Lotka-Volterra systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for symbolic integration with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for integral of trigonometric functions with mechanization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for solving DAEs with mechanization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for solving nonlinear singular perturbation problems with mechanization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanization for solving SPP by reducing order method / rank
 
Normal rank

Latest revision as of 13:15, 24 June 2024

scientific article
Language Label Description Also known as
English
Computer aided solving the high-order transition probability matrix of the finite Markov chain
scientific article

    Statements

    Computer aided solving the high-order transition probability matrix of the finite Markov chain (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    A known explicit expression of the powers of a stochastic matrix \(P\) with all different eigenvalues is extended to the case without the nonequal restriction. An algorithm of mechanization programmed in Maple by using computer algebra is designed for computing \(P^n\). Examples with stochastic matrices possessing all different eigenvalues are shown.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Markov chain
    0 references
    transition probability matrix
    0 references
    algorithm
    0 references
    mechanization
    0 references
    numerical examples
    0 references
    stochastic matrix
    0 references
    0 references