Moments of classical orthogonal polynomials

The aim of this work is to find simple formulas for the moments mu_n for all families of classical orthogonal polynomials listed in the book by Koekoek, Lesky and Swarttouw. The generating functions or exponential generating functions for those moments are given.

On Connection, Linearization and Duplication Coefficients of Classical Orthogonal Polynomials

In this work, we have mainly achieved the following: 1. we provide a review of the main methods used for the computation of the connection and linearization coefficients between orthogonal polynomials of a continuous variable, moreover using a new approach, the duplication problem of these polynomial families is solved; 2. we review the main methods used for the computation of the connection and linearization coefficients of orthogonal polynomials of a discrete variable, we solve the duplication and linearization problem of all orthogonal polynomials of a discrete variable; 3. we propose a method to generate the connection, linearization and duplication coefficients for q-orthogonal polynomials; 4. we propose a unified method to obtain these coefficients in a generic way for orthogonal polynomials on quadratic and q-quadratic lattices. Our algorithmic approach to compute linearization, connection and duplication coefficients is based on the one used by Koepf and Schmersau and on the NaViMa algorithm. Our main technique is to use explicit formulas for structural identities of classical orthogonal polynomial systems. We find our results by an application of computer algebra. The major algorithmic tools for our development are Zeilberger’s algorithm, q-Zeilberger’s algorithm, the Petkovšek-van-Hoeij algorithm, the q-Petkovšek-van-Hoeij algorithm, and Algorithm 2.2, p. 20 of Koepf's book "Hypergeometric Summation" and it q-analogue.

Perturbation, extraction and refinement of invariant pairs for matrix polynomials

Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. Little has been known so far about numerical aspects of such invariant pairs. The aim of this paper is to fill this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view, we investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, we describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of our extraction and refinement procedures.

A tutorial on pseudospectral methods for computational optimal control

[English] This paper is a tutorial introduction to pseudospectral optimal control. With pseudospectral methods, a function is approximated as a linear combination of smooth basis functions, which are often chosen to be Legendre or Chebyshev polynomials. Collocation of the differential-algebraic equations is performed at orthogonal collocation points, which are selected to yield interpolation of high accuracy. Pseudospectral methods directly discretize the original optimal control problem to recast it into a nonlinear programming format. A numerical optimizer is then employed to find approximate local optimal solutions. The paper also briefly describes the functionality and implementation of PSOPT, an open source software package written in C++ that employs pseudospectral discretization methods to solve multi-phase optimal control problems. The software implements the Legendre and Chebyshev pseudospectral methods, and it has useful features such as automatic differentiation, sparsity detection, and automatic scaling. The use of pseudospectral methods is illustrated in two problems taken from the literature on computational optimal control. [Portuguese] Este artigo e um tutorial introdutorio sobre controle otimo pseudo-espectral. Em metodos pseudo-espectrais, uma funcao e aproximada como uma combinacao linear de funcoes de base suaves, tipicamente escolhidas como polinomios de Legendre ou Chebyshev. A colocacao de equacoes algebrico-diferenciais e realizada em pontos de colocacao ortogonal, que sao selecionados de modo a minimizar o erro de interpolacao. Metodos pseudoespectrais discretizam o problema de controle otimo original de modo a converte-lo em um problema de programa cao nao-linear. Um otimizador numerico e entao empregado para obter solucoes localmente otimas. Este artigo tambem descreve sucintamente a funcionalidade e a implementacao de um pacote computacional de codigo aberto escrito em C++ chamado PSOPT. Tal pacote emprega metodos de discretizacao pseudo-spectrais para resolver problemas de controle otimo com multiplas fase. O PSOPT permite a utilizacao de metodos de Legendre ou Chebyshev, e possui caractersticas uteis tais como diferenciacao automatica, deteccao de esparsidade e escalonamento automatico. O uso de metodos pseudo-espectrais e ilustrado em dois problemas retirados da literatura de controle otimo computacional.

Robust eigenstructure assignment in quadratic matrix polynomials: nonsingular case

Feedback design for a second-order control system leads to an eigenstructure assignment problem for a quadratic matrix polynomial. It is desirable that the feedback controller not only assigns specified eigenvalues to the second-order closed loop system but also that the system is robust, or insensitive to perturbations. We derive here new sensitivity measures, or condition numbers, for the eigenvalues of the quadratic matrix polynomial and define a measure of the robustness of the corresponding system. We then show that the robustness of the quadratic inverse eigenvalue problem can be achieved by solving a generalized linear eigenvalue assignment problem subject to structured perturbations. Numerically reliable methods for solving the structured generalized linear problem are developed that take advantage of the special properties of the system in order to minimize the computational work required. In this part of the work we treat the case where the leading coefficient matrix in the quadratic polynomial is nonsingular, which ensures that the polynomial is regular. In a second part, we will examine the case where the open loop matrix polynomial is not necessarily regular.

Approximation by harmonic polynomials in star-shaped domains and exponential convergence of Trefftz hp-dGFEM

We study the approximation of harmonic functions by means of harmonic polynomials in two-dimensional, bounded, star-shaped domains. Assuming that the functions possess analytic extensions to a delta-neighbourhood of the domain, we prove exponential convergence of the approximation error with respect to the degree of the approximating harmonic polynomial. All the constants appearing in the bounds are explicit and depend only on the shape-regularity of the domain and on delta. We apply the obtained estimates to show exponential convergence with rate O(exp(−b square root N)), N being the number of degrees of freedom and b>0, of a hp-dGFEM discretisation of the Laplace equation based on piecewise harmonic polynomials. This result is an improvement over the classical rate O(exp(−b cubic root N )), and is due to the use of harmonic polynomial spaces, as opposed to complete polynomial spaces.

Extensions of homogeneous polynomials ON c(0)(l(2)(i))

We show that a 2-homogeneous polynomial on the complex Banach space c(0)(l(2)(i)) is norm attaining if and only if it is finite (i.e, depends only on finite coordinates). As the consequence, we show that there exists a unique norm-preserving extension for norm-attaining 2-homogeneous polynomials on c(0)(l(2)(i)).

UNIQUENESS OF THE EXTENSION OF 2-HOMOGENEOUS POLYNOMIALS

Homogeneous polynomials of degree 2 on the complex Banach space c(0)(l(n)(2)) are shown to have unique norm-preserving extension to the bidual space. This is done by using M-projections and extends the analogous result for c(0) proved by P.-K. Lin.

Monotonicity and asymptotics of zeros of Sobolev type orthogonal polynomials: A general case

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

Adrien-Marie Legendre (1752-1833) e suas obras em Teoria dos Números

The present thesis is an analysis of Adrien-Marie Legendre s works on Number Theory, with a certain emphasis on his 1830 edition of Theory of Numbers. The role played by these works in their historical context and their influence on the development of Number Theory was investigated. A biographic study of Legendre (1752-1833) was undertaken, in which both his personal relations and his scientific productions were related to certain historical elements of the development of both his homeland, France, and the sciences in general, during the 18th and 19th centuries This study revealed notable characteristics of his personality, as well as his attitudes toward his mathematical contemporaries, especially with regard to his seemingly incessant quarrels with Gauss about the priority of various of their scientific discoveries. This is followed by a systematic study of Lagrange s work on Number Theory, including a comparative reading of certain topics, especially that of his renowned law of quadratic reciprocity, with texts of some of his contemporaries. In this way, the dynamics of the evolution of his thought in relation to his semantics, the organization of his demonstrations and his number theoretical discoveries was delimited. Finally, the impact of Legendre s work on Number Theory on the French mathematical community of the time was investigated. This investigation revealed that he not only made substantial contributions to this branch of Mathematics, but also inspired other mathematicians to advance this science even further. This indeed is a fitting legacy for his Theory of Numbers, the first modern text on Higher Arithmetic, on which he labored half his life, producing various editions. Nevertheless, Legendre also received many posthumous honors, including having his name perpetuated on the Trocadéro face of the Eiffel Tower, which contains a list of 72 eminent scientists, and having a street and an alley in Paris named after him

Utilização de modelos de regressão aleatória para produção de leite no dia do controle, com diferentes estruturas de variâncias residuais

Foram utilizados quatorze modelos de regressão aleatória, para ajustar 86.598 dados de produção de leite no dia do controle de 2.155 primeiras lactações de vacas Caracu, truncadas aos 305 dias. Os modelos incluíram os efeitos fixos de grupo contemporâneo e a covariável idade da vaca ao parto. Uma regressão ortogonal de ordem cúbica foi usada para modelar a trajetória média da população. Os efeitos genéticos aditivos e de ambiente permanente foram modelados por meio de regressões aleatórias, usando polinômios ortogonais de Legendre, de ordens cúbicas. Diferentes estruturas de variâncias residuais foram testadas e consideradas por meio de classes contendo 1, 10, 15 e 43 variâncias residuais e de funções de variâncias (FV) usando polinômios ordinários e ortogonais, cujas ordens variaram de quadrática até sêxtupla. Os modelos foram comparados usando o teste da razão de verossimilhança, o Critério de Informação de Akaike e o Critério de Informação Bayesiano de Schwar. Os testes indicaram que, quanto maior a ordem da função de variâncias, melhor o ajuste. Dos polinômios ordinários, a função de sexta ordem foi superior. Os modelos com classes de variâncias residuais foram aparentemente superiores àqueles com funções de variância. O modelo com homogeneidade de variâncias foi inadequado. O modelo com 15 classes heterogêneas foi o que melhor ajustou às variâncias residuais, entretanto, os parâmetros genéticos estimados foram muito próximos para os modelos com 10, 15 ou 43 classes de variâncias ou com FV de sexta ordem.

Estimação de parâmetros genéticos para produção de leite de cabras da raça Alpina

Foram utilizados 9.374 registros semanais de produção de leite de 302 primeiras lactações de cabras da raça Alpina. A produção de leite no dia do controle foi analisada por meio de um modelo animal, unicarater, de regressão aleatória, em que as funções de covariâncias para os componentes genéticos aditivos e de ambiente permanente foram modeladas por meio das funções de Wilmink, Ali e Schaeffer e por polinômios ortogonais, em uma escala de Legendre de ordens cúbica e quíntica. Assumiu-se, ainda, variância residual homogênea durante toda a lactação e heterogênea com três e quatro classes de variância residual. Os modelos foram comparados pelo critério de informação de Akaike (AIC), pelo critério de informação Bayesiano de Schwar (BIC), pela função de verossimilhança (Ln L), pela visualização das estimativas de variâncias genéticas, de ambiente permanente, fenotípicas e residuais e pelas herdabilidades. O polinômio de Legendre de ordem quíntica, com quatro e três classes de variâncias residuais, e a função de Ali e Schaeffer, com quatro classes de variâncias residuais, foram indicados como os mais adequados pelo AIC, BIC e Ln L. Estes modelos diferiram na partição da variância fenotípica para as variâncias de ambiente permanente, genética e residual apenas no início e no final da lactação. Contudo, a função de Ali e Schaeffer resultou em estimativas negativas de correlação genética entre os controles mais distantes. O polinômio de Legendre de ordem quíntica, assumindo variância residual heterogênea, mostrou-se mais adequado para ajustar a produção de leite no dia do controle de cabras da raça Alpina.

Bayesian analysis of random regression models using B-splines to model test-day milk yield of Holstein cattle in Brazil

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