Companion orthogonal polynomials: some applications

In this paper the recurrence relations of symmetric orthogonal polynomials whose measures are related to each other in a certain way are considered. Many of the relations satisfied by the coefficients of the recurrence relations are exposed. The results are applied to obtain, for example, information regarding certain Sobolev orthogonal polynomials and regarding the measures of certain orthogonal polynomial sequences with twin periodic recurrence coefficients. (C) 2001 IMACS. Published by Elsevier B.V. B.V. All rights reserved.

Monotonicity of the zeros of orthogonal polynomials through related measures

Relation between two sequences of orthogonal polynomials, where the associated measures are related to each other by a first degree polynomial multiplication (or division), is well known. We use this relation to study the monotonicity properties of the zeros of generalized orthogonal polynomials. As examples, the Jacobi, Laguerre and Charlier polynomials are considered. (c) 2005 Elsevier B.V. All rights reserved.

On linear combinations of L-orthogonal polynomials associated with distributions belonging to symmetric classes

This paper deals with the classes S-3(omega, beta, b) of strong distribution functions defined on the interval [beta(2)/b, b], 0 < beta < b <= infinity, where 2 omega epsilon Z. The classification is such that the distribution function psi epsilon S-3(omega, beta, b) has a (reciprocal) symmetry, depending on omega, about the point beta. We consider properties of the L-orthogonal polynomials associated with psi epsilon S-3(omega, beta, b). Through linear combination of these polynomials we relate them to the L-orthogonal polynomials associated with some omega epsilon S-3(1/2, beta, b). (c) 2004 Elsevier B.V. All rights reserved.

Modified Chebyshev algorithm: some applications

Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.

Companion orthogonal polynomials

We give some properties relating the recurrence relations of orthogonal polynomials associated with any two symmetric distributions d phi(1)(x) and d phi(2)(x) such that d phi(2)(x) = (I + kx(2))d phi(1)(x). AS applications of these properties, recurrence relations for many interesting systems of orthogonal polynomials are obtained.

On the two point Padé table for a distribution

Some additional recurrence relations for the denominator polynomials of two point Padé approximants are derived. An example in which the coefficients of one of the two series, from which the Padé approximants are derived, are moments of a distribution is considered. For this example, properties of the denominator polynomials, and their zeros, are described.

Zeros of a family of hypergeometric para-orthogonal polynomials on the unit circle

Para-orthogonal polynomials derived from orthogonal polynomials on the unit circle are known to have all their zeros on the unit circle. In this note we study the zeros of a family of hypergeometric para-orthogonal polynomials. As tools to study these polynomials, we obtain new results which can be considered as extensions of certain classical results associated with three term recurrence relations and differential equations satisfied by orthogonal polynomials on the real line. One of these results which might be considered as an extension of the classical Sturm comparison theorem, enables us to obtain monotonicity with respect to the parameters for the zeros of these para-orthogonal polynomials. Finally, a monotonicity of the zeros of Meixner-Pollaczek polynomials is proved. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Polinômios ortogonais e L-ortogonais associados a medidas relacionadas

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Analogia entre propriedades de alguns polinômios ortogonais em uma e em várias variáveis

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Influence of the magnetization damping on dynamic hysteresis loops in single domain particles

This article reports on the influence of the magnetization damping on dynamic hysteresis loops in single-domain particles with uniaxial anisotropy. The approach is based on the Neel-Brown theory and the hierarchy of differential recurrence relations, which follow from averaging over the realizations of the stochastic Landau-Lifshitz equation. A new method of solution is proposed, where the resulting system of differential equations is solved directly using optimized algorithms to explore its sparsity. All parameters involved in uniaxial systems are treated in detail, with particular attention given to the frequency dependence. It is shown that in the ferromagnetic resonance region, novel phenomena are observed for even moderately low values of the damping. The hysteresis loops assume remarkably unusual shapes, which are also followed by a pronounced reduction of their heights. Also demonstrated is that these features remain for randomly oriented ensembles and, moreover, are approximately independent of temperature and particle size. (C) 2012 American Institute of Physics. [doi:10.1063/1.3684629]

Longitudinal dynamic hysteresis in single-domain particles

We present results for longitudinal dynamic hysteresis in single domain particles with uniaxial anisotropy. The combined influence of temperature, field-sweeping frequency, and field amplitude is discussed in detail. A novel and efficient numerical method is proposed, based on the direct solution of the infinite hierarchy of differential recurrence relations obtained from averaging over the stochastic realizations of the magnetic Langevin equation. (C) 2012 American Institute of Physics. [doi:10.1063/1.3676416]

Efficient calculation of gluon amplitudes with n legs and an implementation of parton showers using the dipole formalism

The conventional way to calculate hard scattering processes in perturbation theory using Feynman diagrams is not efficient enough to calculate all necessary processes - for example for the Large Hadron Collider - to a sufficient precision. Two alternatives to order-by-order calculations are studied in this thesis.rnrnIn the first part we compare the numerical implementations of four different recursive methods for the efficient computation of Born gluon amplitudes: Berends-Giele recurrence relations and recursive calculations with scalar diagrams, with maximal helicity violating vertices and with shifted momenta. From the four methods considered, the Berends-Giele method performs best, if the number of external partons is eight or bigger. However, for less than eight external partons, the recursion relation with shifted momenta offers the best performance. When investigating the numerical stability and accuracy, we found that all methods give satisfactory results.rnrnIn the second part of this thesis we present an implementation of a parton shower algorithm based on the dipole formalism. The formalism treats initial- and final-state partons on the same footing. The shower algorithm can be used for hadron colliders and electron-positron colliders. Also massive partons in the final state were included in the shower algorithm. Finally, we studied numerical results for an electron-positron collider, the Tevatron and the Large Hadron Collider.

Numerical loop calculations with contour deformation

Gegenstand dieser Arbeit ist die nummerische Berechnung von Schleifenintegralen welche in höheren Ordnungen der Störungstheorie auftreten.rnAnalog zur reellen Emission kann man auch in den virtuellen Beiträgen Subtraktionsterme einführen, welche die kollinearen und soften Divergenzen des Schleifenintegrals entfernen. Die Phasenraumintegration und die Schleifenintegration können dann in einer einzigen Monte Carlo Integration durchgeführt werden. In dieser Arbeit zeigen wir wie eine solche numerische Integration unter zu Hilfenahme einer Kontourdeformation durchgeführt werden kann. Ausserdem zeigen wir wie man die benötigeten Integranden mit Rekursionsformeln berechnen kann.

Picard-Fuchs equations of dimensionally regulated Feynman integrals

Zusammenfassung In der vorliegenden Arbeit besch¨aftige ich mich mit Differentialgleichungen von Feynman– Integralen. Ein Feynman–Integral h¨angt von einem Dimensionsparameter D ab und kann f¨ur ganzzahlige Dimension als projektives Integral dargestellt werden. Dies ist die sogenannte Feynman–Parameter Darstellung. In Abh¨angigkeit der Dimension kann ein solches Integral divergieren. Als Funktion in D erh¨alt man eine meromorphe Funktion auf ganz C. Ein divergentes Integral kann also durch eine Laurent–Reihe ersetzt werden und dessen Koeffizienten r¨ucken in das Zentrum des Interesses. Diese Vorgehensweise wird als dimensionale Regularisierung bezeichnet. Alle Terme einer solchen Laurent–Reihe eines Feynman–Integrals sind Perioden im Sinne von Kontsevich und Zagier. Ich beschreibe eine neue Methode zur Berechnung von Differentialgleichungen von Feynman– Integralen. ¨ Ublicherweise verwendet man hierzu die sogenannten ”integration by parts” (IBP)– Identit¨aten. Die neue Methode verwendet die Theorie der Picard–Fuchs–Differentialgleichungen. Im Falle projektiver oder quasi–projektiver Variet¨aten basiert die Berechnung einer solchen Differentialgleichung auf der sogenannten Griffiths–Dwork–Reduktion. Zun¨achst beschreibe ich die Methode f¨ur feste, ganzzahlige Dimension. Nach geeigneter Verschiebung der Dimension erh¨alt man direkt eine Periode und somit eine Picard–Fuchs–Differentialgleichung. Diese ist inhomogen, da das Integrationsgebiet einen Rand besitzt und daher nur einen relativen Zykel darstellt. Mit Hilfe von dimensionalen Rekurrenzrelationen, die auf Tarasov zur¨uckgehen, kann in einem zweiten Schritt die L¨osung in der urspr¨unglichen Dimension bestimmt werden. Ich beschreibe außerdem eine Methode, die auf der Griffiths–Dwork–Reduktion basiert, um die Differentialgleichung direkt f¨ur beliebige Dimension zu berechnen. Diese Methode ist allgemein g¨ultig und erspart Dimensionswechsel. Ein Erfolg der Methode h¨angt von der M¨oglichkeit ab, große Systeme von linearen Gleichungen zu l¨osen. Ich gebe Beispiele von Integralen von Graphen mit zwei und drei Schleifen. Tarasov gibt eine Basis von Integralen an, die Graphen mit zwei Schleifen und zwei externen Kanten bestimmen. Ich bestimme Differentialgleichungen der Integrale dieser Basis. Als wichtigstes Beispiel berechne ich die Differentialgleichung des sogenannten Sunrise–Graphen mit zwei Schleifen im allgemeinen Fall beliebiger Massen. Diese ist f¨ur spezielle Werte von D eine inhomogene Picard–Fuchs–Gleichung einer Familie elliptischer Kurven. Der Sunrise–Graph ist besonders interessant, weil eine analytische L¨osung erst mit dieser Methode gefunden werden konnte, und weil dies der einfachste Graph ist, dessen Master–Integrale nicht durch Polylogarithmen gegeben sind. Ich gebe außerdem ein Beispiel eines Graphen mit drei Schleifen. Hier taucht die Picard–Fuchs–Gleichung einer Familie von K3–Fl¨achen auf.

Termination and cost analysis: Complexity and precision issues

The research in this thesis is related to static cost and termination analysis. Cost analysis aims at estimating the amount of resources that a given program consumes during the execution, and termination analysis aims at proving that the execution of a given program will eventually terminate. These analyses are strongly related, indeed cost analysis techniques heavily rely on techniques developed for termination analysis. Precision, scalability, and applicability are essential in static analysis in general. Precision is related to the quality of the inferred results, scalability to the size of programs that can be analyzed, and applicability to the class of programs that can be handled by the analysis (independently from precision and scalability issues). This thesis addresses these aspects in the context of cost and termination analysis, from both practical and theoretical perspectives. For cost analysis, we concentrate on the problem of solving cost relations (a form of recurrence relations) into closed-form upper and lower bounds, which is the heart of most modern cost analyzers, and also where most of the precision and applicability limitations can be found. We develop tools, and their underlying theoretical foundations, for solving cost relations that overcome the limitations of existing approaches, and demonstrate superiority in both precision and applicability. A unique feature of our techniques is the ability to smoothly handle both lower and upper bounds, by reversing the corresponding notions in the underlying theory. For termination analysis, we study the hardness of the problem of deciding termination for a speci�c form of simple loops that arise in the context of cost analysis. This study gives a better understanding of the (theoretical) limits of scalability and applicability for both termination and cost analysis.