Muntz Systems and Orthogonal Muntz-Legendre Polynomials
نویسندگان
چکیده
منابع مشابه
Müntz Systems and Orthogonal Müntz - Legendre Polynomials
The Müntz-Legendre polynomials arise by orthogonalizing the Müntz system {xxo, xx¡, ...} with respect to Lebesgue measure on [0, 1]. In this paper, differential and integral recurrence formulae for the Müntz-Legendre polynomials are obtained. Interlacing and lexicographical properties of their zeros are studied, and the smallest and largest zeros are universally estimated via the zeros of Lague...
متن کاملOn orthonormal Muntz-Laguerre filters
Recently an upsurge in research relating to Laguerre filters for use in system optimization [1], system identification [2] and reduced-order modeling [3] has been noticed. The main reason for the good performance of Laguerre filters is that they form a uniformly bounded orthonormal basis in Hardy space [1]. Another reason, and this represents the novelty of the work carried out in this paper, i...
متن کاملNew Applications of the Muntz and Coffman Algorithm
Muntz and Coffman proposed an algorithm to solve the problem of scheduling preemptable tasks either with arbitrary precedences on two processors, or tasks with tree-like precedences on an arbitrary number of processors, for the schedule length criterion. In this work, we demonstrate that this well-known algorithm has interesting features which extend its application to many other scheduling pro...
متن کاملMüntz Systems and Müntz–legendre Polynomials
The Müntz–Legendre polynomials arise by orthogonalizing the Müntz system {xλ0 , xλ1 , . . . } with respect to the Lebesgue measure on [0, 1]. In this paper, differential and integral recurrence formulas for the Müntz–Legendre polynomials are obtained. Interlacing and lexicographical properties of their zeros are studied, and the smallest and largest zeros are universally estimated via the zeros...
متن کاملLegendre polynomials and supercongruences
Let p > 3 be a prime, and let Rp be the set of rational numbers whose denominator is not divisible by p. Let {Pn(x)} be the Legendre polynomials. In this paper we mainly show that for m,n, t ∈ Rp with m 6≡ 0 (mod p), P[ p 6 ](t) ≡ − (3 p ) p−1 ∑ x=0 (x3 − 3x + 2t p ) (mod p)
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1994
ISSN: 0002-9947
DOI: 10.2307/2154639