In this paper an accurate method to construct the bidiagonal factorization of collocation and Wronskian matrices Jacobi polynomials is obtained used compute with high relative accuracy their eigenvalues, singular values inverses. The particular cases Legendre polynomials, Gegenbauer Chebyshev first second kind rational are considered. Numerical examples included.

In this paper, we propose a successive approximation method based on fuzzy wavelet like operator to approximate the solution of linear fuzzy Fredholm integral equations of the second kind with arbitrary kernels. We give the convergence conditions and an error estimate. Also, we investigate the numerical stability of the computed values with respect to small perturbations in the first iteration....

In his Ph.D. Thesis of 1897, Dickson introduced certain permutation polynomials whose Galois groups are essentially the dihedral groups. These are now called Dickson polynomials of the first kind, to distinguish them from their variations introduced by Schur in 1923, which are now called Dickson polynomials of the second kind. In the last few decades there have been extensive investigations of ...

In practice, we often encounter situations where a sample size is not defined in advance and can be random value. The randomness of the crucially changes asymptotic properties underlying statistic. present paper second order Chebyshev--Edgeworth Cornish--Fisher expansions based Student's $t$- Laplace distributions their quantiles are derived for median with special kind.

The goal of this paper is to derive Hermite–Hadamard–Fejér-type inequalities for higher-order convex functions and a general three-point integral formula involving harmonic sequences polynomials w-harmonic functions. In special cases, estimates are derived various classical quadrature formulae such as the Gauss–Legendre Gauss–Chebyshev first second kind.

The paper presents the automated design of active RC and programmable filters. The approximating function is derived using Chebyshev orthogonal polynomials of the first kind. Optimization is performed using symbolic manipulation of expressions inputted into computer algebra system. The code is in the form of template notebook, and the user should specify the minimal number of numeric values, su...

Abstract. A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on n letters avoiding (1, 2, 3) and a layered permutation on k letters. In the most interesting case of two layers, the generating function depends onl...