A constructive method for uniform approximation by means of integrated Lagrange interpolation polynomials in the spaceC 1[a,b]

Пусть интерполяционные уз лыa <x ₁ <x ₂ < ... <х _n <b являются корнямиn-го полинома системы полиномов {w _n(x)} _n ^∞ =1, ортогонально й с весомρ(х), 0 < ρ(х) ∈L[a, b], причем 1/ρ(x) ∈L[a, b]. Доказано, что еслиf(х) ∈С ¹ [a, b], то проинтегрированн ые полиномы $$Q_n (x) = \smallint _a^x L_{n - 1} (f',t)dt + f(a)$$ интерполяционных по линомов Лагранжа $$L_{n - 1} (f,x) = \sum\limits_{k = 1}^n {f'(x_k )\frac{{\omega _n (x)}}{{\omega '_n (x_k )(x - x_k )}}}$$ порядкаn?1 функцииf′(x) сходятся равномерно к функцииf(х) в замкнуто м интервале [а,b]. Во второй части стать и, где вместо условия 1/ρ(х) ∈L[a, b] предполагается, чтоρ(х) ∈С ²[а, b],ρ(х) > 0,ρ′ (х) > 0, доказываются подобные утверждени я для проинтегрированных интерполяционных по линомов Лагранжа и для прибли жений рациональными дробя ми. В работе даются неулу чшаемые порядковые о ценки и описываются примене ния полученных результа тов в теории дифферен циальных уравнений.     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.     

Filtering on manifolds

We coasider a partially observable diffusion process (x _t,y_t)t0 whose unobservable componentx _t lives on a submanifold M ofR ⁿ . We present some general conditions under which the conditional law ofx _t, given the observationsy _s ,s [0,t], admits a density w.r.t. a given measure on M. We characterize the analytical properties of this density by using appropriate Sobolev spaces.Research supported by the Hungarian National Foundation of Scientific Research No. 2290.     

Fractal dimension,attractors, and the boussinesq approximation in three dimensions

The Boussinesq approximation, where the viscosity depends polynomially on the shear rate, finds more and more frequent use in geological practice. In the paper, this modified Boussinesq approximation is investigated as a dynamical system for which the existence of a global attractor is proved. Finally, a new criterion for estimating the fractal dimension of invariant sets is formulated and its application to the problem under consideration is illustrated.     

Strong converse inequality for Kantorovich polynomials

For the Kantorovich polynomial approximationK _n (f, t), 1<p≤∞, we prove that, for somem, This equivalence includes a strong converse inequality of type B.     

On approximation by bivariate incomplete polynomials

In this paper we prove that given certain convex domains Δ on the plane, ε>0, andf∈C(Δ) such thatf=0 on θ²Δ={(θ² x,θ² y):(x,y)?Δ} (0<θ<1), a polynomialp(x, y) of the form $$p(x,y) = \sum\limits_{\theta n \leqslant k + l \leqslant n} {a_{kl} x^k y^l }$$ exists such that ∥f?p∥ _C(Δ) ≤ε. The admissible convex domains include triangles and parallelograms with a vertex at the origin and sections of unit disk.