Schwerpunkt dieser Arbeit ist die Untersuchung einer Klasse von Diskretisierungsmethoden für nichtlineare optimale Steuerungsprobleme mit gewöhnlichen Differentialgleichungen und Steuerungsbeschränkung sowie die Durchführung von numerischen Experimente. Die theoretischen Untersuchungen basieren aus einem gekoppeltes Parametrisierungs-Diskretisierungsschema aus stückweise polinomialen Ansatz für die Steuerung und einen Runge-Kutta-Verfahren zur Integration der Zustands-Differentialgleichung. Die Konvergenzordnung der Lösung wird unter Regularitätsbedingung und Optimalitätsbedingung 2.Ordnung ermittelt. Außerdem wird eine Möglichkeit zur numerischen Berechnung der Gradienten über internen numerischen Differentiation erläutert. Schließlich werden einige numerischen Resultate gegeben und die Abhängigkeiten zur den theoretischen Konvergenzresultate diskutiert. / The focal point of this work is the investigation of a class of discretization methods for nonlinear optimal control problems governed by ordinary differential equations with control restrictions, as well as the implementation of some numerical experiments. The theoretical investigations are based on a coupledparameterization-discretization pattern, a piecewise linear parameterization representation of the control, and the application of a Runge Kutta method for the integration of the differential state equation. The rate of convergence of the solution is obtained with the help of regularity conditions and the second order optimality conditions. Furthermore, we also present in this paper a possibility of the numerical computation of the gradients via numerical differentiation. Finally some numerical results are given and their relationship to the theoretical convergence results are discussed.

Nesta tese apresentamos alguns resultados teóricos e práticos da modelagem de seqüências simbólicas com cadeias estocásticas parcimoniosas. As cadeias estocásticas parcimoniosas, que incluem as cadeias estocásticas de memória variável, constituem uma generalização das cadeias de Markov de alcance fixo. As seqüências simbólicas às quais foram aplicadas as ferramentas desenvolvidas são as cadeias de aminoácidos. Primeiramente, introduzimos um novo algoritmo, chamado de SPST, para selecionar o modelo de cadeia estocástica parcimoniosa mais ajustado a uma amostra de seqüências. Em seguida, utilizamos esse algoritmo para estudar dois importantes problemas da genômica; a saber, a classificação de proteínas em famílias e o estudo da evolução das seqüências biológicas. Finalmente, estudamos a velocidade de convergência de algoritmos relacionados com a estimação de uma subclasse das cadeias estocásticas parcimoniosas, as cadeias estocásticas de memória variável. Assim, generalizamos um resultado prévio de velocidade exponencial de convergência para o algoritmo PST, no caso de cadeias de memória ilimitada. Além disso, obtemos um resultado de velocidade de convergência para uma versão generalizada do Critério da Informação Bayesiana (BIC), também conhecido como Critério de Schwarz. / In this thesis we present some theoretical and practical results, concerning symbolic sequence modeling with parsimonious stochastic chains. Parsimonious stochastic chains, which include variable memory stochastic chains, constitute a generalization of fixed order Markov chains. The symbolic sequences modeled with parsimonious stochastic chains were the sequences of amino acids. First, we introduce a new algorithm, called SPST, to select the model of parsimonious stochastic chain that fits better to a sample of sequences. Then, we use the SPST algorithm to study two important problems of genomics. These problems are the classification of proteins into families and the study of the evolution of biological sequences. Finally, we find upper bounds for the rate of convergence of some algorithms related with the estimation of a subclass of parsimonious stochastic chains; namely, the variable memory stochastic chains. In consequence, we generalize a previous result about the exponential rate of convergence of the PST algorithm, in the case of unbounded variable memory stochastic chains. On the other hand, we prove a result about the rate of convergence of a generalized version of the Bayesian Information Criterion (BIC), also known as Schwarz\' Criterion.

This dissertation poses the question of whether there is a relationship between the speed of convergence of globalisation and the speed of convergence of GDP per capita. Firstly, the concepts of globalisation and real convergence and their relationship are thoroughly explained from both the theoretical and empirical point of view. And secondly, the answer to the question comes in the form of beta and sigma convergence analysis of this relationship. Thirdly, the analysis splits the countries into two groups (developed and developing countries) and finds interesting but ambiguous results in their comparison. Finally, in order to correctly interpret the results of absolute and conditional beta and sigma convergence, their theoretical and empirical overview is discussed in depth. The dissertation concludes by providing some answers to the initial question for every particular analysis. Namely, it shows that this relationship is indeed very ambiguous.

In this work we study rate of convergence of attractors for parabolic equations. We consider various types of problems where the diffusion coefficient has varied profiles: large diffusion, localized large diffusion and large diffusion except in the neighborhood of a point where it becomes small. In all cases we obtain a singular perturbation where a rate of convergence of attractors is obtained. / Neste trabalho estudamos taxa de convergência de atratores para equações parabólicas. Consideramos vários tipos de problemas onde o coeficiente de difusão apresenta perfís variados: difusão grande, difusão grande localizada e difusão grande exceto na vizinhança de um ponto onde ela torna-se pequena. Em todos os casos consideramos perturbações singulares e uma taxa de convergência para os atratores é obtida.

In this work we study rate of convergence of attractors for parabolic equations. We consider various types of problems where the diffusion coefficient has varied profiles: large diffusion, localized large diffusion and large diffusion except in the neighborhood of a point where it becomes small. In all cases we obtain a singular perturbation where a rate of convergence of attractors is obtained. / Neste trabalho estudamos taxa de convergência de atratores para equações parabólicas. Consideramos vários tipos de problemas onde o coeficiente de difusão apresenta perfís variados: difusão grande, difusão grande localizada e difusão grande exceto na vizinhança de um ponto onde ela torna-se pequena. Em todos os casos consideramos perturbações singulares e uma taxa de convergência para os atratores é obtida.

Στόχος της παρούσας Διατριβής είναι να ερευνήσει τη διαμόρφωση των αντιλήψεων γύρω από τα απειροστά και τις σχετικές μ’ αυτά επ’ άπειρον διαδικασίες σε δύο κατευθύνσεις: 1. Την ιστορική εξέλιξη και ερμηνεία της έννοιας του απειροστού και 2. Την ανάλυση των σχετικών αντιλήψεων των φοιτητών-αυριανών καθηγητών των μαθηματικών. Στο πρώτο μέρος της διατριβής γίνεται ανάλυση και ερμηνεία των αντιλήψεων για τα απειροστά που εκφράστηκαν από την Αρχαία μέχρι τη σύγχρονη εποχή. Η μελέτη αυτή οδηγεί στην κατασκευή ενός ερμηνευτικού πλαισίου που διακρίνει τα ιστορικά ερμηνευτικά πρότυπα (μοντέλα) των απειροστών σε τρία αντιθετικά ζεύγη ως εξής: Ι. Εντασιακά-Εκτασιακά πρότυπα απειροστών. ΙΙ. Ομογενή-Μη ομογενή πρότυπα απειροστών. ΙΙΙ. Μηδενοδύναμα-μη μηδενοδύναμα πρότυπα απειροστών. Το παραπάνω πλαίσιο χρησιμοποιείται στο δεύτερο μέρος της διατριβής ως μεθοδολογικό εργαλείο για το σχεδιασμό διδακτικών πειραμάτων και την ανάλυση των εμπειρικών δεδομένων. Ειδικότερα, έγιναν τρία διδακτικά πειράματα με φοιτητές του Τμήματος των Μαθηματικών. Στο πρώτο πείραμα ερευνήθηκε η έννοια της ταχύτητας σύγκλισης ακολουθίας ως μια διαισθητική προσέγγιση στα απειροστά. Στο δεύτερο πείραμα, ερευνήθηκε η δυνατότητα προσέγγισης στα απειροστά μέσα από κλασσικά θέματα των διακριτών Μαθηματικών, όπως ο υπολογισμός του αθροίσματος των δυνάμεων φυσικών αριθμών. Στο τρίτο πείραμα έγινε διδασκαλία ενός συγκεκριμένου μοντέλου των υπερ-πραγματικών αριθμών και αναλύθηκαν τα αποτελέσματα. Τα κυριότερα συμπεράσματα της διατριβής είναι: 1. Η σημασία της κατασκευής μαθηματικών οντοτήτων που ικανοποιούν τα αξιώματα της Πραγματικής Ανάλυσης, 2. Η σημασία της διαισθητικής προσέγγισης και τα όριά της και 3. Η καταλληλότητα των προτεινόμενων μοντέλων και θεμάτων, ως διδακτικού υλικού. / The aim of this Ph.D thesis is the conceptions regarding infinitesimals and infinitesimal processes in two directions: 1. The historical evolution and interpretation of the concept of infinitesimal and 2. The analysis of the conception of the students–prospective teachers of Mathematics. The first part of the thesis contains a study and an analysis of infinitesimals that appeared in History from Antiquity to our era. This study leads to the construction of a framework of interpretation which distinguishes the interpretative models into three pairs of opposites: I. Homogenous-Nonhomogenous, models of infinitesimals II. Intensional-Extensional, models of infinitesimals III. Nilpotent-Non nilpotent, models of infinitesimals The above framework is applied in the second part of the thesis, as a methodological tool for the design of didactical experiments with students of Mathematics. The first experiment concerns a research study on the notion of the rate of convergence, as an intuitive approach to infinitesimals. The second experiment is referred to the emergence of infinitesimals through classical themes (issues) of discrete mathematics, such as the computation of sums of powers of integers. The third experiment concerns the teaching of a specific model of Hyper-Real numbers and the analysis of its empirical outcomes. The main conclusions of this thesis are: 1. The significance of the construction of mathematical entities, which satisfy the axioms of Real Analysis. 2. The significance of the intuitive approach, as well with a focus on its foreseen limitations. 3. The relevance of the proposed models and themes as potential didactical material.

Nesta tese apresentamos alguns resultados teóricos e práticos da modelagem de seqüências simbólicas com cadeias estocásticas parcimoniosas. As cadeias estocásticas parcimoniosas, que incluem as cadeias estocásticas de memória variável, constituem uma generalização das cadeias de Markov de alcance fixo. As seqüências simbólicas às quais foram aplicadas as ferramentas desenvolvidas são as cadeias de aminoácidos. Primeiramente, introduzimos um novo algoritmo, chamado de SPST, para selecionar o modelo de cadeia estocástica parcimoniosa mais ajustado a uma amostra de seqüências. Em seguida, utilizamos esse algoritmo para estudar dois importantes problemas da genômica; a saber, a classificação de proteínas em famílias e o estudo da evolução das seqüências biológicas. Finalmente, estudamos a velocidade de convergência de algoritmos relacionados com a estimação de uma subclasse das cadeias estocásticas parcimoniosas, as cadeias estocásticas de memória variável. Assim, generalizamos um resultado prévio de velocidade exponencial de convergência para o algoritmo PST, no caso de cadeias de memória ilimitada. Além disso, obtemos um resultado de velocidade de convergência para uma versão generalizada do Critério da Informação Bayesiana (BIC), também conhecido como Critério de Schwarz. / In this thesis we present some theoretical and practical results, concerning symbolic sequence modeling with parsimonious stochastic chains. Parsimonious stochastic chains, which include variable memory stochastic chains, constitute a generalization of fixed order Markov chains. The symbolic sequences modeled with parsimonious stochastic chains were the sequences of amino acids. First, we introduce a new algorithm, called SPST, to select the model of parsimonious stochastic chain that fits better to a sample of sequences. Then, we use the SPST algorithm to study two important problems of genomics. These problems are the classification of proteins into families and the study of the evolution of biological sequences. Finally, we find upper bounds for the rate of convergence of some algorithms related with the estimation of a subclass of parsimonious stochastic chains; namely, the variable memory stochastic chains. In consequence, we generalize a previous result about the exponential rate of convergence of the PST algorithm, in the case of unbounded variable memory stochastic chains. On the other hand, we prove a result about the rate of convergence of a generalized version of the Bayesian Information Criterion (BIC), also known as Schwarz\' Criterion.

[pt] Os resultados fundamentais da teoria ergódica – o teorema de Birkhoff e o teorema de Kingman – se referem a convergência em quase todo ponto de um processo ergódico aditivo e subaditivo, respectivamente. É bem conhecido que dado um sistema unicamente ergódico e um observável contínuo, as médias de Birkhoff correspondentes convergem em todo ponto e uniformemente. Desta forma, é natural também se perguntar o que acontece com o teorema de Kingman quando o sistema é unicamente ergódico. O primeiro objetivo desta dissertação é responder a essa pergunta utilizando o trabalho de A. Furman. Mais ainda, apresentamos algumas extensões e aplicações desse resultado para cociclos lineares, que foram obtidas por S. Jitomirskaya e R. Mavi. Nosso segundo objetivo é provar um novo resultado sobre taxas de convergências de médias de Birkhoff, para um certo tipo de processo unicamente ergódico: uma translação diofantina no toro com um observável Holder contínuo. / [en] The fundamental results in ergodic theory – the Birkhoff theorem and the Kingman theorem – refer to the almost everywhere convergence of additive and respectively subadditive ergodic processes. It is well known that given a uniquely ergodic system and a continuous observable, the corresponding Birkhoff averages converge everywhere and uniformly. It is therefore natural to ask what happens with Kingman s theorem when the system is uniquely ergodic. The first objective of this dissertation is to answer this question following the work of A. Furman. Moreover, we present some extensions and applications of this result for linear cocycles, which were obtained by S. Jitomirskaya and R. Mavi. Our second objective is to prove a new result regarding the rate of convergence of the Birkhoff averages for a certain type of uniquely ergodic process: a Diophantine torus translation with Holder continuous observable.

Les méthodes de Monte Carlo par chaines de Markov MCMC sont des outils mathématiques utilisés pour simuler des mesures de probabilités π définies sur des espaces de grandes dimensions. Une des questions les plus importantes dans ce contexte est de savoir à quelle vitesse converge la chaine de Markov P vers la mesure invariante π. Pour mesurer la vitesse de convergence de la chaine de Markov P vers sa mesure invariante π nous utilisons la distance de la variation totale. Il est bien connu que la vitesse de convergence d’une chaine de Markov réversible P dépend de la deuxième plus grande valeur propre en valeur absolue de la matrice P notée β!. Une partie importante dans l’estimation de β! consiste à estimer la deuxième plus grande valeur propre de la matrice P, qui est notée β1. Diaconis et Stroock (1991) ont introduit une méthode basée sur l’inégalité de Poincaré pour estimer β1 pour le cas général des chaines de Markov réversibles avec un nombre fini d'état. Dans cette thèse, nous utilisons la méthode de Shiu et Chen (2015) pour étudier le cas de l'algorithme de l'échantillonneur de Gibbs pour le modèle d'Ising unidimensionnel avec trois états ou plus appelé aussi modèle de Potts. Puis, nous généralisons le résultat de Shiu et Chen au cas du modèle d’Ising deux- dimensionnel avec deux états. Les résultats obtenus minorent ceux introduits par Ingrassia (1994). Puis nous avons pensé à perturber l'échantillonneur de Gibbs afin d’améliorer sa vitesse de convergence vers l'équilibre. / Monte Carlo Markov chain methods MCMC are mathematical tools used to simulate probability measures π defined on state spaces of high dimensions. The speed of convergence of this Markov chain X to its invariant state π is a natural question to study in this context.To measure the convergence rate of a Markov chain we use the total variation distance. It is well known that the convergence rate of a reversible Markov chain depends on its second largest eigenvalue in absolute value denoted by β!. An important part in the estimation of β! is the estimation of the second largest eigenvalue which is denoted by β1.Diaconis and Stroock (1991) introduced a method based on Poincaré inequality to obtain a bound for β1 for general finite state reversible Markov chains.In this thesis we use the Chen and Shiu approach to study the case of the Gibbs sampler for the 1−D Ising model with three and more states which is also called Potts model. Then, we generalize the result of Shiu and Chen (2015) to the case of the 2−D Ising model with two states.The results we obtain improve the ones obtained by Ingrassia (1994). Then, we introduce some method to disrupt the Gibbs sampler in order to improve its convergence rate to equilibrium.

In diesem Artikel werden notwendige und hinreichende Bedingungen für die Gültigkeit von Grenzwertsätzen für mittlere Abweichungen untersucht. In der Terminilogie von J.V.LINNIK (1971) werden die x-Bereiche für mittlere Abweichungen gewöhnlich als "sehr enge" Zonen der integralen normalen Anziehung bezeichnet. Darüber hinaus werden die Restglieder untersucht, die in den asymptotischen Beziehungen auftreten. Die Ordnung der Konvergenzgeschwindigkeit wird angegeben. Frühere Ergebnisse einiger Autoren werden verallgemeinert. Abschließend werden einige Literaturhinweise angegeben. / In this paper we study necessary and sufficient conditions for the validity of limit theorems on moderate deviations. Usually x-zones for moderate deviations are called in the terminilogy by YU.V.LINNIK (1971) "very narrow" zones of integral normal attraction. Moreover we analyse the remainder term appearing in the asymptotic relations. Informations on the order of the rate of convergence are given. Earlier results by several authors are generalized. Finally some references are given.