Directory UMM :Data Elmu:jurnal:J-a:Journal of Computational And Applied Mathematics:Vol102.Issue1.1999:
Teks penuh
Gambar
Dokumen terkait
In this way, we can construct the Stratonovich–Taylor–Hall (STH) schemes which are more ecient than those Stratonovich–Taylor (ST) schemes as they involve only the minimum numbers
Necessary and sucient conditions for membership in k -UCV, as well as sharp growth and distortion theorems for k -uniformly convex functions are given.. The obtained results
However, it is easily veried that both coecient problems are equivalent to the Fourier coecient problem of ∈ Aut T represented by Fourier series (1.5).. Horizontally convex domains
Implemented with a variable stepsize strategy using embedding techniques, two explicit pseudo two-step RK methods derived from this class are shown to be superior to the currently
The coecients of this equation are given in terms of the polynomials and which appear in the q-Pearson dierence equation D q ( ) = dening the weight of the q-classical
A case of particular interest is the one for which n grows faster than n: Rescaling the argument z appropriately the resulting asymptotic forms are described by elementary
For classical orthogonal polynomials of a discrete variable, the recurrence coecients are known explicitly and Theorem 8.1 can be used to obtain the zero distributions... Then is
The laws of those isotropic random walks converge in distribution to the normal distribution and the transition probabilities of the S n are closely related with a sequence
