Ten serwis zostanie wyłączony 2025-02-11.
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  recurrence relations
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
In this paper we generalize Jacobsthal quaternions to \((s,p)\)\dywiz Jacobsthal quaternions. We give some of their properties, among others the Binet formula, the generating function and the matrix representation of these quaternions. We will show how a~graph interpretation can be used in proving some identities for quaternions.
2
Content available remote Linearization of Arbitrary products of classical orthogonal polynomials
88%
|
|
tom 27
|
nr 2
187-196
EN
A procedure is proposed in order to expand $w=\prod^N_{j=1} P_{i_j}(x)=\sum^M_{k=0} L_ k P_ k(x)$ where $P_i(x)$ belongs to aclassical orthogonal polynomial sequence (Jacobi, Bessel, Laguerre and Hermite) ($M=\sum^N_{j=1} i_j$). We first derive a linear differential equation of order $2^N$ satisfied by w, fromwhich we deduce a recurrence relation in k for the linearizationcoefficients $L_k$. We develop in detail the two cases $[P_i(x)]^N$, $P_ i(x)P_ j(x)P_ k(x)$ and give the recurrencerelation in some cases (N=3,4), when the polynomials $P_i(x)$are monic Hermite orthogonal polynomials.
EN
We propose a method for determining the steady-state characteristics of a multichannel closed queueing system with exponential distribution of the time generation of service requests and the second order Erlang distributions of the service times. Recurrence relations to compute the steady-state distribution of the number of customers are obtained. The developed algorithms are tested on examples using simulation models constructed with the assistance of the GPSS World tools.
EN
We propose a method of study the M/E2/3/∞ queueing systems: standard system and systems with the threshold and hysteretic strategies of the random dropping of customers in order to control the input flow. Recurrence relations to compute the stationary distribution of the number of customers and the steady-state characteristics are obtained. The developed algorithms are tested on examples using simulation models constructed with the assistance of the GPSS World tools.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.