𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A method of constructing Krall's polynomials

✍ Scribed by Alexei Zhedanov


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
142 KB
Volume
107
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis


We propose a method of constructing orthogonal polynomials Pn(x) (Krall's polynomials) that are eigenfunctions of higher-order di erential operators. Using this method we show that recurrence coe cients of Krall's polynomials Pn(x) are rational functions of n. Let P (a; b; M ) n (x) be polynomials obtained from the Jacobi polynomials P (a; b) n (x) by the following procedure. We add an arbitrary concentrated mass M at the endpoint of the orthogonality interval with respect to the weight function of the ordinary Jacobi polynomials. We ΓΏnd necessary conditions for the parameters a; b in order for the polynomials P (a; b; M ) n (x) to obey a higher-order di erential equation. The main result of the paper is the following. Let a be a positive integer and bΒΏ -1=2 an arbitrary real parameter. Then the polynomials P (a; b; M ) n (x) are Krall's polynomials satisfying a di erential equation of order 2a + 4.


πŸ“œ SIMILAR VOLUMES


Recurrent Methods for Constructing Irred
✍ Mels K. Kyuregyan πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 283 KB

The paper is devoted to some results concerning the constructive theory of the synthesis of irreducible polynomials over Galois "elds GF(q), q"2Q. New methods for the construction of irreducible polynomials of higher degree over GF(q) from a given one are worked out. The complexity of calculations d

Method for construction of characteristi
✍ Kakali Datta; Asok K. Mukherjee πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 157 KB πŸ‘ 1 views

A new method for construction of characteristic polynomials CP of complicated graphs having arbitrary edge and vertex weights has been developed. The method first converts the graph into isospectral linear chains with weighted vertices and edges and then builds up the CP coefficients recursively. Tw

A method of constructing programmed moti
✍ A.N. Kvitko πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 442 KB

An algorithm is proposed for constructing a control function for which the solution of a non-linear system of differential equations will go from its initial state to an arbitrarily small neighbourhood of a given final state. The problem of interorbital flight is considered.