Facultatea de Matematică şi Informatică / Faculty of Methematics and Informatics

Permanent URI for this communityhttps://msuir.usm.md/handle/123456789/12

Browse

Author: search.filters.author.Lazari, AlexandruEnd date: 2009

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    PROBABILITĂŢILE LIMITĂ DE TRANSFER ALE SISTEMELOR ALEATORII DISCRETE
    (CEP USM, 2009) Lazari, Alexandru
    In this article we study discrete random systems with finite set of states. A polynomial time algorithm for determining the limit matrix of probabilities in Markov processes is proposed and grounded.
  • Thumbnail Image
    Item
    CARACTERISTICILE PROBABILISTICE ALE TIMPULUI DE EVOLUŢIE AL SISTEMELOR ALEATOARE DISCRETE
    (CEP USM, 2009) Lazari, Alexandru
    In this article it is being studied a class of random discrete systems, developing polynomial algorithms for determining the basic characteristics of time evolution of their own. It is a generalized problem for the case when the transfer time of the system in the next state is also a random variable with known distribution law. The developed algorithms are based on probabilistic method of determining the characteristics of random variables, knowing the generating function or characteristic function of them. Algorithms are being presented for numerical derivation of functions composed and rational fractions that appear later in main algorithms. It makes a brief foray into the theory of homogeneous linear recurring series to argue theoretically developed algorithms.
  • Thumbnail Image
    Item
    ALGORITMI EFICIEN Ţ I PENTRU REZOLVAREA SISTEMELOR DE ECUAŢII CE APAR LA DISCRETIZAREA ECUAŢIILOR INTEGRALE SINGULARE
    (CEP USM, 2008) Capcelea, Maria; Capcelea, Titu; Lazari, Alexandru
    It is marked out the class of iterative algorithms for solvin g of systems of equations which are obtained when discre- tizing SIE with discontinuous coefficients. These algorithms permit essential reducing of computational cost for finding an approximate solution, at that not losing in the quality of other numerical characteristics - they are numerically stable and allow us to check precision in the course of iterations without calculation of approximation of a solution.