Bound state solutions of schrödinger equation for a more general exponential screened coulomb potential via Nikiforov-Uvarov method

The arbitrary angular momentum solutions of the Schrödinger equation for a diatomic molecule with the general exponential screened coulomb potential of the form V(r) = (- a / r){1+ (1+ b )e-2b } has been presented. The energy eigenvalues and the corresponding eigenfunctions are calculated analytically by the use of Nikiforov-Uvarov (NU) method which is related to the solutions in terms of Jacobi polynomials. The bounded state eigenvalues are calculated numerically for the 1s state of N2 CO and NO

Excessive functions, Appell polynomials and optimal stopping

The main topic of the thesis is optimal stopping. This is treated in two research articles. In the first article we introduce a new approach to optimal stopping of general strong Markov processes. The approach is based on the representation of excessive functions as expected suprema. We present a variety of examples, in particular, the Novikov-Shiryaev problem for Lévy processes. In the second article on optimal stopping we focus on differentiability of excessive functions of diffusions and apply these results to study the validity of the principle of smooth fit. As an example we discuss optimal stopping of sticky Brownian motion. The third research article offers a survey like discussion on Appell polynomials. The crucial role of Appell polynomials in optimal stopping of Lévy processes was noticed by Novikov and Shiryaev. They described the optimal rule in a large class of problems via these polynomials. We exploit the probabilistic approach to Appell polynomials and show that many classical results are obtained with ease in this framework. In the fourth article we derive a new relationship between the generalized Bernoulli polynomials and the generalized Euler polynomials.

Measuring higher order optical aberrations of the human eye: techniques and applications

In the present paper we discuss the development of "wave-front", an instrument for determining the lower and higher optical aberrations of the human eye. We also discuss the advantages that such instrumentation and techniques might bring to the ophthalmology professional of the 21st century. By shining a small light spot on the retina of subjects and observing the light that is reflected back from within the eye, we are able to quantitatively determine the amount of lower order aberrations (astigmatism, myopia, hyperopia) and higher order aberrations (coma, spherical aberration, etc.). We have measured artificial eyes with calibrated ametropia ranging from +5 to -5 D, with and without 2 D astigmatism with axis at 45º and 90º. We used a device known as the Hartmann-Shack (HS) sensor, originally developed for measuring the optical aberrations of optical instruments and general refracting surfaces in astronomical telescopes. The HS sensor sends information to a computer software for decomposition of wave-front aberrations into a set of Zernike polynomials. These polynomials have special mathematical properties and are more suitable in this case than the traditional Seidel polynomials. We have demonstrated that this technique is more precise than conventional autorefraction, with a root mean square error (RMSE) of less than 0.1 µm for a 4-mm diameter pupil. In terms of dioptric power this represents an RMSE error of less than 0.04 D and 5º for the axis. This precision is sufficient for customized corneal ablations, among other applications.

Prime Rational Functions and Integral Polynomials

Let f(x) be a complex rational function. In this work, we study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we derive some conditions for the case of complex polynomials. We consider also the divisibility of integral polynomials, and we present a generalization of a theorem of Nieto. We show that if f(x) and g(x) are integral polynomials such that the content of g divides the content of f and g(n) divides f(n) for an integer n whose absolute value is larger than a certain bound, then g(x) divides f(x) in Z[x]. In addition, given an integral polynomial f(x), we provide a method to determine if f is irreducible over Z, and if not, find one of its divisors in Z[x].

A Generalization of a Theorem of Boyd and Lawton

Ce mémoire s’applique à étudier d’abord, dans la première partie, la mesure de Mahler des polynômes à une seule variable. Il commence en donnant des définitions et quelques résultats pertinents pour le calcul de telle hauteur. Il aborde aussi le sujet de la question de Lehmer, la conjecture la plus célèbre dans le domaine, donne quelques exemples et résultats ayant pour but de résoudre la question. Ensuite, il y a l’extension de la mesure de Mahler sur les polynômes à plusieurs variables, une démarche semblable au premier cas de la mesure de Mahler, et le sujet des points limites avec quelques exemples. Dans la seconde partie, on commence par donner des définitions concernant un ordre supérieur de la mesure de Mahler, et des généralisations en passant des polynômes simples aux polynômes à plusieurs variables. La question de Lehmer existe aussi dans le domaine de la mesure de Mahler supérieure, mais avec des réponses totalement différentes. À la fin, on arrive à notre objectif, qui sera la démonstration de la généralisation d’un théorème de Boyd-Lawton, ce dernier met en évidence une relation entre la mesure de Mahler des polynômes à plusieurs variables avec la limite de la mesure de Mahler des polynômes à une seule variable. Ce résultat a des conséquences en termes de la conjecture de Lehmer et sert à clarifier la relation entre les valeurs de la mesure de Mahler des polynômes à une variable et celles des polynômes à plusieurs variables, qui, en effet, sont très différentes en nature.

Orthogonal polynomials and recurrence equations, operator equations and factorization

This article surveys the classical orthogonal polynomial systems of the Hahn class, which are solutions of second-order differential, difference or q-difference equations. Orthogonal families satisfy three-term recurrence equations. Example applications of an algorithm to determine whether a three-term recurrence equation has solutions in the Hahn class - implemented in the computer algebra system Maple - are given. Modifications of these families, in particular associated orthogonal systems, satisfy fourth-order operator equations. A factorization of these equations leads to a solution basis.

Duplication coefficients via generating functions

In this paper, we solve the duplication problem P_n(ax) = sum_{m=0}^{n}C_m(n,a)P_m(x) where {P_n}_{n>=0} belongs to a wide class of polynomials, including the classical orthogonal polynomials (Hermite, Laguerre, Jacobi) as well as the classical discrete orthogonal polynomials (Charlier, Meixner, Krawtchouk) for the specific case a = −1. We give closed-form expressions as well as recurrence relations satisfied by the duplication coefficients.

Comparison of the computational cost of a Monte Carlo and deterministic algorithm for computing bilinear forms of matrix powers

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.

Simplified parameter adaptive control

A simple parameter adaptive controller design methodology is introduced in which steady-state servo tracking properties provide the major control objective. This is achieved without cancellation of process zeros and hence the underlying design can be applied to non-minimum phase systems. As with other self-tuning algorithms, the design (user specified) polynomials of the proposed algorithm define the performance capabilities of the resulting controller. However, with the appropriate definition of these polynomials, the synthesis technique can be shown to admit different adaptive control strategies, e.g. self-tuning PID and self-tuning pole-placement controllers. The algorithm can therefore be thought of as an embodiment of other self-tuning design techniques. The performances of some of the resulting controllers are illustrated using simulation examples and the on-line application to an experimental apparatus.

Wave trapping in a two-dimensional sound-soft or sound-hard acoustic waveguide of slowly-varying width

In this paper we derive novel approximations to trapped waves in a two-dimensional acoustic waveguide whose walls vary slowly along the guide, and at which either Dirichlet (sound-soft) or Neumann (sound-hard) conditions are imposed. The guide contains a single smoothly bulging region of arbitrary amplitude, but is otherwise straight, and the modes are trapped within this localised increase in width. Using a similar approach to that in Rienstra (2003), a WKBJ-type expansion yields an approximate expression for the modes which can be present, which display either propagating or evanescent behaviour; matched asymptotic expansions are then used to derive connection formulae which bridge the gap across the cut-off between propagating and evanescent solutions in a tapering waveguide. A uniform expansion is then determined, and it is shown that appropriate zeros of this expansion correspond to trapped mode wavenumbers; the trapped modes themselves are then approximated by the uniform expansion. Numerical results determined via a standard iterative method are then compared to results of the full linear problem calculated using a spectral method, and the two are shown to be in excellent agreement, even when $\epsilon$, the parameter characterising the slow variations of the guide’s walls, is relatively large.

On the structure of infinity-harmonic maps

Let H ∈ C 2(ℝ N×n ), H ≥ 0. The PDE system arises as the Euler-Lagrange PDE of vectorial variational problems for the functional E ∞(u, Ω) = ‖H(Du)‖ L ∞(Ω) defined on maps u: Ω ⊆ ℝ n → ℝ N . (1) first appeared in the author's recent work. The scalar case though has a long history initiated by Aronsson. Herein we study the solutions of (1) with emphasis on the case of n = 2 ≤ N with H the Euclidean norm on ℝ N×n , which we call the “∞-Laplacian”. By establishing a rigidity theorem for rank-one maps of independent interest, we analyse a phenomenon of separation of the solutions to phases with qualitatively different behaviour. As a corollary, we extend to N ≥ 2 the Aronsson-Evans-Yu theorem regarding non existence of zeros of |Du| and prove a maximum principle. We further characterise all H for which (1) is elliptic and also study the initial value problem for the ODE system arising for n = 1 but with H(·, u, u′) depending on all the arguments.

The univalent polynomial of Suffridge as a summability kernel

A positive summability trigonometric kernel {K(n)(theta)}(infinity)(n=1) is generated through a sequence of univalent polynomials constructed by Suffridge. We prove that the convolution {K(n) * f} approximates every continuous 2 pi-periodic function f with the rate omega(f, 1/n), where omega(f, delta) denotes the modulus of continuity, and this provides a new proof of the classical Jackson`s theorem. Despite that it turns out that K(n)(theta) coincide with positive cosine polynomials generated by Fejer, our proof differs from others known in the literature.

A full family of multimodal maps on the circle

We exhibit a family of trigonometric polynomials inducing a family of 2m-multimodal maps on the circle which contains all relevant dynamical behavior.

Landau and Kolmogoroff type polynomial inequalities

Let 0of A and B we establish Kolmogoroff type inequalitiesparallel to f((f))parallel to(2) less than or equal to A parallel to f(m)parallel to + B parallel to f parallel to/ A theta(k) + B mu(k),with certain constants theta(k)e mu(k), which hold for every f is an element of pi(n) (pi(n) denotes the space of real algebraic polynomials of degree not exceeding n).For the particular case j=1 and m=2, we provide a complete characterisation of the positive constants A and B, for which the corresponding Landau type polynomial inequalities parallel to f'parallel to less than or equal toA parallel to f parallel to + B parallel to f parallel to/ A theta(k) + B mu(k)hold. In each case we determine the corresponding extremal polynomials for which equalities are attained.

Schur-SzegA composition of entire functions

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