Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "aproksymacja" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
Accuracy estimation of the approximated Atangana-Baleanu operator
Autorzy:
Oprzędkiewicz, Krzysztof
Mitkowski, Wojciech
Powiązania:
https://bibliotekanauki.pl/articles/122484.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
Caputo operator
Mittag-Leffler function
ORA approximation
aproksymacja ORA
funkcja Mittag-Lefflera
Opis:
In the paper, the accuracy analysis of the approximation of the Atangana-Baleanu (AB) operator is presented. The AB operator is the nonsingular kernel operator proposed by Atangana and Baleanu. It is obtained by replacing the exponential function in the Caputo-Fabrizio operator by the Mittag-Leffler function. The Laplace transform of the AB operator requires approximating the factor sa. This is done using the well-known Oustaloup Recursive Approximaion (ORA) approximation. The step and frequency responses of the approximation are compared to the analytical responses. As the cost function, the FIT function available in MATLAB was applied. Results of simulations show that the use of ORA allows us to obtain the accurate approximant of the AB operator.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 4; 53-62
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Calculating steady-state probabilities of single-channel closed queueing systems using hyperexponential approximation
Autorzy:
Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:
https://bibliotekanauki.pl/articles/1839796.pdf
Data publikacji:
2020
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
single-channel closed queueing system
arbitrary distributions
hyperexponential approximation
system kolejkowania
rozkład prawdopodobieństwa
aproksymacja wykładnicza
Opis:
In this paper we propose a method for calculating steady-state probability distributions of the single-channel closed queueing systems with arbitrary distributions of customer generation times and service times. The approach based on the use of fictitious phases and hyperexponential approximations with parameters of the paradoxical and complex type by the method of moments. We defined conditions for the variation coefficients of the gamma distributions and Weibull distributions, for which the best accuracy of calculating the steady-state probabilities is achieved in comparison with the results of simulation modeling.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 113-120
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Calculating steady-state probabilities of single-channel closed queueing systems using hyperexponential approximation
Autorzy:
Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:
https://bibliotekanauki.pl/articles/122348.pdf
Data publikacji:
2020
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
single-channel closed queueing system
arbitrary distributions
hyperexponential approximation
system kolejkowania
rozkład prawdopodobieństwa
aproksymacja wykładnicza
Opis:
In this paper we propose a method for calculating steady-state probability distributions of the single-channel closed queueing systems with arbitrary distributions of customer generation times and service times. The approach based on the use of fictitious phases and hyperexponential approximations with parameters of the paradoxical and complex type by the method of moments. We defined conditions for the variation coefficients of the gamma distributions and Weibull distributions, for which the best accuracy of calculating the steady-state probabilities is achieved in comparison with the results of simulation modeling.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 113-120
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Calculating steady-state probabilities of queueing systems using hyperexponential approximation
Autorzy:
Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:
https://bibliotekanauki.pl/articles/122829.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
non-Markovian queueing system
hyperexponential approximation
complex and paradoxical parameters of distribution
system kolejkowy
aproksymacja
rozkład hiperesponencjalny
Opis:
This article proposes an analysis of the results of the application of hyperexponential approximations with parameters of the paradoxical and complex type for calculating the steady-state probabilities of the G/G/n/m queueing systems with the number of channels n = 1, 2 and 3. The steady-state probabilities are solutions of a system of linear algebraic equations obtained by the method of fictitious phases. Approximation of arbitrary distributions is carried out using the method of moments. We verified the obtained numerical results using potential method and simulation models, constructed by means of GPSS World.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 2; 111-122
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The limit properties diffusion process in a semi-Markov environment
Autorzy:
Chabanyuk, Y.
Rosa, W.
Powiązania:
https://bibliotekanauki.pl/articles/122295.pdf
Data publikacji:
2018
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
stochastic approximation procedure
compensating operator
asymptotic normality of the stochastic procedure
small parameter
martingale characterization
Markov processes
semi-Markov processes
aproksymacja stochastyczna
procedura stochastyczna
proces Markova
proces semi-Markova
stochastyczny proces dyfuzji
Opis:
In this paper we consider the stochastic diffusion process with semi-Markov switchings in an averaging scheme. We present results and conditions on convergence to the classic diffusion process, in case with semi-Markov process perturbation is uniformly ergodic. We used small parameter scheme to get the main result.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 1; 5-14
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Investigation of G-networks with restart at a non-stationary mode and their application
Autorzy:
Matalytski, Mikhail
Naumenko, Victor
Kopats, Dmitry
Powiązania:
https://bibliotekanauki.pl/articles/122538.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
queueing network
G-network
positive and negative customers
non-stationary regime
multiple type customers
signals
restart
nonstationary state probabilities
successive approximation method
sieć kolejkowa
sieć G
sygnały
metoda aproksymacji
aproksymacja
teoria kolejek
pozytywny klient
negatywny klient
Opis:
This article discusses the question of restarting the script, when restart is used by many users of the information network, which can be modelled as a G-network. Negative claims simulate the crash of the script and the re-sending of the request. Investigation of an open queuing network (QN) with several types of positive customers with the phase type of distribution of their service time and one type of negative customers have been carried out. Negative customers are signals whose effect is to restart one customers in a queue. A technique is proposed for finding the probability of states. It is based on the use of a modified method of successive approximations, combined with the method of a series. The successive approximations converge with time to a stationary distribution of state probabilities, the form of which is indicated in the article, and the sequence of approximations converges to the solution of the difference-differential equations (DDE) system. The uniqueness of this solution is proved. Any successive approximation is representable in the form of a convergent power series with an infinite radius of convergence, the coefficients of which satisfy recurrence relations, which is convenient for computer calculations. A model example illustrating the finding of time-dependent probabilities of network states using the proposed technique is also presented.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 2; 41-51
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies