Distances between critical points and midpoints of zeros of hyperbolic polynomials

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Sharp Turán inequalities via very hyperbolic polynomials

We present new sharp inequalities for the Maclaurin coefficients of an entire function from the Laguerre-Pólya class. They are obtained by a new technique involving the so-called very hyperbolic polynomials. The results may be considered as extensions of the classical Turán inequalities. © 2010 Elsevier Inc.

Discriminant Sets of Families of Hyperbolic Polynomials of Degree 4 and 5

∗ Research partially supported by INTAS grant 97-1644

Even and Old Overdetermined Strata for Degree 6 Hyperbolic Polynomials

2000 Mathematics Subject Classification: 12D10.

Schur-SzegA composition of entire functions

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Schur-Szegö composition of entire functions

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

On Root Arrangements of Polynomial-Like Functions and their Derivatives

2000 Mathematics Subject Classification: 12D10.

Hyperbolic Fourth-R Quadratic Equation and Holomorphic Fourth-R Polynomials

MSC 2010: 30C10, 32A30, 30G35

Another connection between orthogonal polynomials and L-orthogonal polynomials

We consider a connection that exists between orthogonal polynomials associated with positive measures on the real line and orthogonal Laurent polynomials associated with strong measures of the class S-3 [0, beta, b]. Examples are given to illustrate the main contribution in this paper. (c) 2006 Elsevier B.V. All rights reserved.

Overdetermined Strata in General Families of Polynomials

2000 Mathematics Subject Classification: 12D10.

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.

Interference in hyperbolic space

The interference in a phase space algorithm of Schleich and Wheeler [Nature 326, 574 (1987)] is extended to the hyperbolic space underlying the group SU(1,1). The extension involves introducing the notion of weighted areas. Analytic expressions for the asymptotic forms for overlaps between the eigenstates of the generators of su(1,1) thus obtained are found to be in excellent agreement with the numerical results.[S1050-2947(98)08602-8].

On the loss of regularity for a class of weakly hyperbolic operators

In this paper we determine bounds for the optimal loss of regularity in the Sobolev scale for a class of weakly hyperbolic operators. (C) 2009 Elsevier Inc. All rights reserved.

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.