959 resultados para Laguerre orthogonal polynomials
Resumo:
We investigate infinite families of integral quadratic polynomials {fk (X)} k∈N and show that, for a fixed k ∈ N and arbitrary X ∈ N, the period length of the simple continued fraction expansion of √fk (X) is constant. Furthermore, we show that the period lengths of √fk (X) go to infinity with k. For each member of the families involved, we show how to determine, in an easy fashion, the fundamental unit of the underlying quadratic field. We also demonstrate how the simple continued fraction ex- pansion of √fk (X) is related to that of √C, where √fk (X) = ak*X^2 +bk*X + C. This continues work in [1]–[4].
Resumo:
A group-theoretic method of obtaining more general class of generating functions from a given class of partial quasi-bilateral generating functions involving Hermite, Laguerre and Gegenbaur polynomials are discussed.
Resumo:
∗ Research partially supported by INTAS grant 97-1644
Resumo:
In this paper we survey work on and around the following conjecture, which was first stated about 45 years ago: If all the zeros of an algebraic polynomial p (of degree n ≥ 2) lie in a disk with radius r, then, for each zero z1 of p, the disk with center z1 and radius r contains at least one zero of the derivative p′ . Until now, this conjecture has been proved for n ≤ 8 only. We also put the conjecture in a more general framework involving higher order derivatives and sets defined by the zeros of the polynomials.
Resumo:
* The author was supported by NSF Grant No. DMS 9706883.
Resumo:
Here we prove results about Riesz summability of classical Laguerre series, locally uniformly or on the Lebesgue set of the function f such that (∫(1 + x)^(mp) |f(x)|^p dx )^(1/p) < ∞, for some p and m satisfying 1 ≤ p ≤ ∞, −∞ < m < ∞.
Resumo:
In the paper new non-conventional growing neural network is proposed. It coincides with the Cascade- Correlation Learning Architecture structurally, but uses ortho-neurons as basic structure units, which can be adjusted using linear tuning procedures. As compared with conventional approximating neural networks proposed approach allows significantly to reduce time required for weight coefficients adjustment and the training dataset size.
Resumo:
Mathematics Subject Classification: 42B35, 35L35, 35K35
Resumo:
Mathematics Subject Classification: 33C45.
Resumo:
2000 Mathematics Subject Classification: 26A33, 33C45
Resumo:
2000 Mathematics Subject Classification: 42B20, 42B25, 42B35
Resumo:
Mathematics Subject Class.: 33C10,33D60,26D15,33D05,33D15,33D90
Resumo:
Let p(z) be an algebraic polynomial of degree n ¸ 2 with real coefficients and p(i) = p(¡i). According to Grace-Heawood Theorem, at least one zero of the derivative p0(z) is on the disk with center in the origin and radius cot(¼=n). In this paper is found the smallest domain containing at leas one zero of the derivative p0(z).
Resumo:
AMS Subject Classification 2010: 11M26, 33C45, 42A38.
Resumo:
2000 Mathematics Subject Classification: 12D10