Characterization of generalized Bessel polynomials in terms of polynomial inequalities

Generalized Bessel polynomials (GBPs) are characterized as the extremal polynomials in certain inequalities in L-2 norm of Markov type. (C) 1998 Academic Press.

Landau and Kolmogoroff type polynomial inequalities II

Let 0 < j < m ≤ n. Kolmogoroff type inequalities of the form ∥f(j)∥2 ≤ A∥f(m)∥ 2 + B∥f∥2 which hold for algebraic polynomials of degree n are established. Here the norm is defined by ∫ f2(x)dμ(x), where dμ(x) is any distribution associated with the Jacobi, Laguerre or Bessel orthogonal polynomials. In particular we characterize completely the positive constants A and B, for which the Landau weighted polynomial inequalities ∥f′∥ 2 ≤ A∥f″∥2 + B∥f∥ 2 hold. © Dynamic Publishers, Inc.

A generic formula for the values at the boundary points of monic classical orthogonal polynomials

In a previous paper we have determined a generic formula for the polynomial solution families of the well-known differential equation of hypergeometric type σ(x)y"n(x)+τ(x)y'n(x)-λnyn(x)=0. In this paper, we give another such formula which enables us to present a generic formula for the values of monic classical orthogonal polynomials at their boundary points of definition.

Laguerre polynomials as Jensen polynomials of Laguerre-Polya entire functions

We prove that the only Jensen polynomials associated with an entire function in the Laguerre-Polya class that are orthogonal are the Laguerre polynomials. (C) 2009 Elsevier B.V. All rights reserved.

Polynomial Expansions for Solutions of Higher-Order Bessel Heat Equation in Quantum Calculus

Mathematics Subject Class.: 33C10,33D60,26D15,33D05,33D15,33D90

Combining Legendre's Polynomials and Genetic Algorithm in the Solution of Nonlinear Initial-Value Problems

This work develops a method for solving ordinary differential equations, that is, initial-value problems, with solutions approximated by using Legendre's polynomials. An iterative procedure for the adjustment of the polynomial coefficients is developed, based on the genetic algorithm. This procedure is applied to several examples providing comparisons between its results and the best polynomial fitting when numerical solutions by the traditional Runge-Kutta or Adams methods are available. The resulting algorithm provides reliable solutions even if the numerical solutions are not available, that is, when the mass matrix is singular or the equation produces unstable running processes.

CMB in a box: Causal structure and the Fourier-Bessel expansion

This paper makes two points. First, we show that the line-of-sight solution to cosmic microwave anisotropies in Fourier space, even though formally defined for arbitrarily large wavelengths, leads to position-space solutions which only depend on the sources of anisotropies inside the past light cone of the observer. This foretold manifestation of causality in position (real) space happens order by order in a series expansion in powers of the visibility gamma = e(-mu), where mu is the optical depth to Thomson scattering. We show that the contributions of order gamma(N) to the cosmic microwave background (CMB) anisotropies are regulated by spacetime window functions which have support only inside the past light cone of the point of observation. Second, we show that the Fourier-Bessel expansion of the physical fields (including the temperature and polarization momenta) is an alternative to the usual Fourier basis as a framework to compute the anisotropies. The viability of the Fourier-Bessel series for treating the CMB is a consequence of the fact that the visibility function becomes exponentially small at redshifts z >> 10(3), effectively cutting off the past light cone and introducing a finite radius inside which initial conditions can affect physical observables measured at our position (x) over right arrow = 0 and time t(0). Hence, for each multipole l there is a discrete tower of momenta k(il) (not a continuum) which can affect physical observables, with the smallest momenta being k(1l) similar to l. The Fourier-Bessel modes take into account precisely the information from the sources of anisotropies that propagates from the initial value surface to the point of observation-no more, no less. We also show that the physical observables (the temperature and polarization maps), and hence the angular power spectra, are unaffected by that choice of basis. This implies that the Fourier-Bessel expansion is the optimal scheme with which one can compute CMB anisotropies.

Strong Grobner bases for polynomials over a principal ideal ring

Grobner bases have been generalised to polynomials over a commutative ring A in several ways. Here we focus on strong Grobner bases, also known as D-bases. Several authors have shown that strong Grobner bases can be effectively constructed over a principal ideal domain. We show that this extends to any principal ideal ring. We characterise Grobner bases and strong Grobner bases when A is a principal ideal ring. We also give algorithms for computing Grobner bases and strong Grobner bases which generalise known algorithms to principal ideal rings. In particular, we give an algorithm for computing a strong Grobner basis over a finite-chain ring, for example a Galois ring.

Subspace wavepacket evolution with Newton polynomials

Time-dependent wavepacket evolution techniques demand the action of the propagator, exp(-iHt/(h)over-bar), on a suitable initial wavepacket. When a complex absorbing potential is added to the Hamiltonian for combating unwanted reflection effects, polynomial expansions of the propagator are selected on their ability to cope with non-Hermiticity. An efficient subspace implementation of the Newton polynomial expansion scheme that requires fewer dense matrix-vector multiplications than its grid-based counterpart has been devised. Performance improvements are illustrated with some benchmark one and two-dimensional examples. (C) 2001 Elsevier Science B.V. All rights reserved.

On the permutation behaviour of Dickson polynomials of the second kind

The known permutation behaviour of the Dickson polynomials of the second kind in characteristic 3 is expanded and simplified. (C) 2002 Elsevier Science (USA).

The compositional inverse of a class of permutation polynomials over a finite field

A new class of bilinear permutation polynomials was recently identified. In this note we determine the class of permutation polynomials which represents the functional inverse of the bilinear class.

On the requirements of interpolating polynomials for path motion constraints

In the framework of multibody dynamics, the path motion constraint enforces that a body follows a predefined curve being its rotations with respect to the curve moving frame also prescribed. The kinematic constraint formulation requires the evaluation of the fourth derivative of the curve with respect to its arc length. Regardless of the fact that higher order polynomials lead to unwanted curve oscillations, at least a fifth order polynomials is required to formulate this constraint. From the point of view of geometric control lower order polynomials are preferred. This work shows that for multibody dynamic formulations with dependent coordinates the use of cubic polynomials is possible, being the dynamic response similar to that obtained with higher order polynomials. The stabilization of the equations of motion, always required to control the constraint violations during long analysis periods due to the inherent numerical errors of the integration process, is enough to correct the error introduced by using a lower order polynomial interpolation and thus forfeiting the analytical requirement for higher order polynomials.

Recurrence relations for Clifford algebra-valued orthogonal polynomials

The theory of orthogonal polynomials of one real or complex variable is well established as well as its generalization for the multidimensional case. Hypercomplex function theory (or Clifford analysis) provides an alternative approach to deal with higher dimensions. In this context, we study systems of orthogonal polynomials of a hypercomplex variable with values in a Clifford algebra and prove some of their properties.

Ehrhart polynomials, successive minima, and an Ehrhart theory for rational dilates of a rational polytope

Magdeburg, Univ., Fak. für Mathematik, Diss., 2011

Low autocorrelation sequences and flat polynomials

Magdeburg, Univ., Fak. für Mathematik, Habil.-Schr., 2014