This paper deal with the estimation of the shape parameter (a) of Generalized Exponential (GE) distribution when the scale parameter (l) is known via preliminary test single stage shrinkage estimator (SSSE) when a prior knowledge (a₀) a vailable about the shape parameter as initial value due past experiences as well as suitable region (R) for testing this prior knowledge.

The Expression for the Bias, Mean squared error [MSE] and Relative Efficiency [R.Eff(×)] for the proposed estimator are derived. Numerical results about beha

This paper demonstrates the construction of a modern generalized Exponential Rayleigh distribution by merging two distributions with a single parameter. The "New generalized Exponential-Rayleigh distribution" specifies joining the Reliability function of exponential pdf with the Reliability function of Rayleigh pdf, and then adding a shape parameter for this distribution. Finally, the mathematical and statistical characteristics of such a distribution are accomplished

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity

          The present paper studies the generalized Φ-  recurrent of Kenmotsu type manifolds. This is done to determine the components of the covariant derivative of the Riemannian curvature tensor. Moreover, the conditions which make Kenmotsu type manifolds to be locally symmetric or generalized Φ- recurrent have been established. It is also concluded that the locally symmetric of Kenmotsu type manifolds are generalized recurrent under suitable condition and vice versa. Furthermore, the study establishes the relationship between the Einstein manifolds and locally symmetric of Kenmotsu type manifolds.