• Title/Summary/Keyword: Discrete orthogonal polynomials

Search Result 10, Processing Time 0.026 seconds

ASYMPTOTICS OF ORTHOGONAL POLYNOMIALS CORRESPONDING TO POLYNOMIAL SZEGŐ MEASURE WITH AN INFINITE DISCRETE PART

  • Benghia, Fatima Zohra;Belabbaci, Youcef
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.34 no.3
    • /
    • pp.271-283
    • /
    • 2021
  • The asymptotics behavior orthogonal polynomials have been in the spotlight since the result of G. Szegő in 1921. In this paper we study the pointwise asymptotics inside the unit disk for orthogonal polynomials with respect to a polynomial Szegő measure with an infinite masses points.

DISCRETE SOBOLEV ORTHOGONAL POLYNOMIALS AND SECOND ORDER DIFFERENCE EQUATIONS

  • Jung, H.S.;Kwon, K.H.;Lee, D.W.
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.2
    • /
    • pp.381-402
    • /
    • 1999
  • Let {Rn($\chi$)}{{{{ { } atop {n=0} }}}} be a discrete Sobolev orthogonal polynomials (DSOPS) relative to a symmetric bilinear form (p,q)={{{{ INT _{ } }}}} pqd$\mu$0 +{{{{ INT _{ } }}}} p qd$\mu$1, where d$\mu$0 and d$\mu$1 are signed Borel measures on . We find necessary and sufficient conditions for {Rn($\chi$)}{{{{ { } atop {n=0} }}}} to satisfy a second order difference equation 2($\chi$) y($\chi$)+ 1($\chi$) y($\chi$)= ny($\chi$) and classify all such {Rn($\chi$)}{{{{ { } atop {n=0} }}}}. Here, and are forward and backward difference operators defined by f($\chi$) = f($\chi$+1) - f($\chi$) and f($\chi$) = f($\chi$) - f($\chi$-1).

  • PDF

GENERALIZED Δ-COHERENT PAIRS

  • Kwon, K.H.;Lee, J.H.;F. Marcellan
    • Journal of the Korean Mathematical Society
    • /
    • v.41 no.6
    • /
    • pp.977-994
    • /
    • 2004
  • A pair of quasi-definite linear functionals {u$_{0}$, u$_1$} is a generalized $\Delta$-coherent pair if monic orthogonal polynomials (equation omitted) relative to u$_{0}$ and u$_1$, respectively, satisfy a relation (equation omitted) where $\sigma$$_{n}$ and T$_{n}$ are arbitrary constants and $\Delta$p = p($\chi$+1) - p($\chi$) is the difference operator. We show that if {u$_{0}$, u$_1$} is a generalized $\Delta$-coherent pair, then u$_{0}$ and u$_{1}$ must be discrete-semiclassical linear functionals. We also find conditions under which either u$_{0}$ or u$_1$ is discrete-classical.ete-classical.

THE DISCRETE SLOAN ITERATE FOR CAUCHY SINGULAR INTEGRAL EQUATIONS

  • KIM, SEKI
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.2 no.2
    • /
    • pp.81-95
    • /
    • 1998
  • The superconvergence of the Sloan iterate obtained from a Galerkin method for the approximate solution of the singular integral equation based on the use of two sets of orthogonal polynomials is investigated. The discrete Sloan iterate using Gaussian quadrature to evaluate the integrals in the equation becomes the Nystr$\ddot{o}$m approximation obtained by the same rules. Consequently, it is impossible to expect the faster convergence of the Sloan iterate than the discrete Galerkin approximation in practice.

  • PDF

A DIFFERENCE EQUATION FOR MULTIPLE KRAVCHUK POLYNOMIALS

  • Lee, Dong-Won
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.6
    • /
    • pp.1429-1440
    • /
    • 2007
  • Let ${K^{(\vec{p};N)}_{\vec{n}}(x)}$ be a multiple Kravchuk polynomial with respect to r discrete Kravchuk weights. We first find a lowering operator for multiple Kravchuk polynomials ${K^{(\vec{p};N)}_{\vec{n}}(x)}$ in which the orthogonalizing weights are not involved. Combining the lowering operator and the raising operator by Rodrigues# formula, we find a (r+1)-th order difference equation which has the multiple Kravchuk polynomials ${K^{(\vec{p};N)}_{\vec{n}}(x)}$ as solutions. Lastly we give an explicit difference equation for ${K^{(\vec{p};N)}_{\vec{n}}(x)}$ for the case of r=2.

MARKOV-BERNSTEIN TYPE INEQUALITIIES FOR POLYNOMIALS

  • Kwon, K.H.;Lee, D.W.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.36 no.1
    • /
    • pp.63-78
    • /
    • 1999
  • Let $\mu$(x) be an increasing function on the real line with finite moments of all oeders. We show that for any linear operator T on the space of polynomials and any interger n $\geq$ 0, there is a constant $\gamma n(T)\geq0$, independent of p(x), such that $\parallel T_p\parallel\leq\gamma n(T)\parallel P\parallel$, for any polynomial p(x) of degree $\leq$ n, where We find a formular for the best possible value $\Gamma_n(T)\;of\;\gamma n(T)$ and estimations for $\Gamma_n(T)$. We also give several illustrating examples when T is a differentiation or a difference operator and $d\mu$(x) is an orthogonalizing measure for classical or discrete orthogonal polynomials.

  • PDF

Krawtchouk Polynomial Approximation for Binomial Convolutions

  • Ha, Hyung-Tae
    • Kyungpook Mathematical Journal
    • /
    • v.57 no.3
    • /
    • pp.493-502
    • /
    • 2017
  • We propose an accurate approximation method via discrete Krawtchouk orthogonal polynomials to the distribution of a sum of independent but non-identically distributed binomial random variables. This approximation is a weighted binomial distribution with no need for continuity correction unlike commonly used density approximation methods such as saddlepoint, Gram-Charlier A type(GC), and Gaussian approximation methods. The accuracy obtained from the proposed approximation is compared with saddlepoint approximations applied by Eisinga et al. [4], which are the most accurate method among higher order asymptotic approximation methods. The numerical results show that the proposed approximation in general provide more accurate estimates over the entire range for the target probability mass function including the right-tail probabilities. In addition, the method is mathematically tractable and computationally easy to program.

Multi-objective Optimization in Discrete Design Space using the Design of Experiment and the Mathematical Programming (실험계획법과 수리적방법을 이용한 이산설계 공간에서의 다목적 최적설계)

  • Lee, Dong-Woo;Baek, Seok-Heum;Lee, Kyoung-Young;Cho, Seok-Swoo;Joo, Won-Sik
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.10
    • /
    • pp.2150-2158
    • /
    • 2002
  • A recent research and development has the requirement for the optimization to shorten design time of modified or new product model and to obtain more precise engineering solution. General optimization problem must consider many conflicted objective functions simultaneously. Multi-objective optimization treats the multiple objective functions and constraints with design change. But, real engineering problem doesn't describe accurate constraint and objective function owing to the limit of representation. Therefore this study applies variance analysis on the basis of structure analysis and DOE to the vertical roller mill fur portland cement and proposed statistical design model to evaluate the effect of structural modification with design change by performing practical multi-objective optimization considering mass, stress and deflection.