scholarly journals On the saturation order of approximation processes involving Jacobi polynomials

1989 ◽  
Vol 58 (1) ◽  
pp. 36-49 ◽  
Author(s):  
Sarjoo Prasad Yadav
2018 ◽  
Vol 26 (1) ◽  
pp. 37 ◽  
Author(s):  
O.V. Kozynenko

We consider the problem of approximation order of twice continuously differentiable functions of many variables by piecewise constants. We show that the saturation order of piecewise constant approximation in $$$L_p$$$ norm on convex partitions with $$$N$$$ cells is $$$N^{-2/(d+1)}$$$, where $$$d$$$ is the number of variables.


Mathematics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 74
Author(s):  
Waleed Mohamed Abd-Elhameed ◽  
Afnan Ali

The main purpose of the current article is to develop new specific and general linearization formulas of some classes of Jacobi polynomials. The basic idea behind the derivation of these formulas is based on reducing the linearization coefficients which are represented in terms of the Kampé de Fériet function for some particular choices of the involved parameters. In some cases, the required reduction is performed with the aid of some standard reduction formulas for certain hypergeometric functions of unit argument, while, in other cases, the reduction cannot be done via standard formulas, so we resort to certain symbolic algebraic computation, and specifically the algorithms of Zeilberger, Petkovsek, and van Hoeij. Some new linearization formulas of ultraspherical polynomials and third-and fourth-kinds Chebyshev polynomials are established.


Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 761
Author(s):  
Călin-Ioan Gheorghiu

In this paper, we continue to solve as accurately as possible singular eigenvalues problems attached to the Schrödinger equation. We use the conventional ChC and SiC as well as Chebfun. In order to quantify the accuracy of our outcomes, we use the drift with respect to some parameters, i.e., the order of approximation N, the length of integration interval X, or a small parameter ε, of a set of eigenvalues of interest. The deficiency of orthogonality of eigenvectors, which approximate eigenfunctions, is also an indication of the accuracy of the computations. The drift of eigenvalues provides an error estimation and, from that, one can achieve an error control. In both situations, conventional spectral collocation or Chebfun, the computing codes are simple and very efficient. An example for each such code is displayed so that it can be used. An extension to a 2D problem is also considered.


2021 ◽  
Vol 111 (2) ◽  
Author(s):  
Aleksey Kostenko

AbstractFor the discrete Laguerre operators we compute explicitly the corresponding heat kernels by expressing them with the help of Jacobi polynomials. This enables us to show that the heat semigroup is ultracontractive and to compute the corresponding norms. On the one hand, this helps us to answer basic questions (recurrence, stochastic completeness) regarding the associated Markovian semigroup. On the other hand, we prove the analogs of the Cwiekel–Lieb–Rosenblum and the Bargmann estimates for perturbations of the Laguerre operators, as well as the optimal Hardy inequality.


Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1573
Author(s):  
Waleed Mohamed Abd-Elhameed ◽  
Badah Mohamed Badah

This article deals with the general linearization problem of Jacobi polynomials. We provide two approaches for finding closed analytical forms of the linearization coefficients of these polynomials. The first approach is built on establishing a new formula in which the moments of the shifted Jacobi polynomials are expressed in terms of other shifted Jacobi polynomials. The derived moments formula involves a hypergeometric function of the type 4F3(1), which cannot be summed in general, but for special choices of the involved parameters, it can be summed. The reduced moments formulas lead to establishing new linearization formulas of certain parameters of Jacobi polynomials. Another approach for obtaining other linearization formulas of some Jacobi polynomials depends on making use of the connection formulas between two different Jacobi polynomials. In the two suggested approaches, we utilize some standard reduction formulas for certain hypergeometric functions of the unit argument such as Watson’s and Chu-Vandermonde identities. Furthermore, some symbolic algebraic computations such as the algorithms of Zeilberger, Petkovsek and van Hoeij may be utilized for the same purpose. As an application of some of the derived linearization formulas, we propose a numerical algorithm to solve the non-linear Riccati differential equation based on the application of the spectral tau method.


1996 ◽  
Vol 33 (01) ◽  
pp. 146-155 ◽  
Author(s):  
K. Borovkov ◽  
D. Pfeifer

In this paper we consider improvements in the rate of approximation for the distribution of sums of independent Bernoulli random variables via convolutions of Poisson measures with signed measures of specific type. As a special case, the distribution of the number of records in an i.i.d. sequence of length n is investigated. For this particular example, it is shown that the usual rate of Poisson approximation of O(1/log n) can be lowered to O(1/n 2). The general case is discussed in terms of operator semigroups.


2000 ◽  
Vol 24 (10) ◽  
pp. 649-661 ◽  
Author(s):  
Mohamed Atef Helal

This paper is mainly concerned with the motion of an incompressible fluid in a slowly rotating rectangular basin. The equations of motion of such a problem with its boundary conditions are reduced to a system of nonlinear equations, which is to be solved by applying the shallow water approximation theory. Each unknown of the problem is expanded asymptotically in terms of the small parameterϵwhich generally depends on some intrinsic quantities of the problem of study. For each order of approximation, the nonlinear system of equations is presented successively. It is worthy to note that such a study has useful applications in the oceanography.


Sign in / Sign up

Export Citation Format

Share Document