This thesis consists of a comprehensive summary and six scientific papers dealing with the boundary behaviour of functions related to parabolic partial differential equations and several complex variables. Paper I concerns solutions to non-linear parabolic equations of linear growth. The main results include a backward Harnack inequality, and the Hölder continuity up to the boundary of quotients of non-negative solutions vanishing on the lateral boundary of an NTA cylinder. It is also shown that the Riesz measure associated with such solutions has the doubling property. Paper II is concerned with solutions to linear degenerate parabolic equations, where the degeneracy is controlled by a weight in the Muckenhoupt class 1+2/n. Two main results are that non-negative solutions which vanish continuously on the lateral boundary of an NTA cylinder satisfy a backward Harnack inequality and that the quotient of two such functions is Hölder continuous up to the boundary. Another result is that the parabolic measure associated to such equations has the doubling property. In Paper III, it is shown that a bounded pseudoconvex domain whose boundary is α-Hölder for each 0<α<1, is hyperconvex. Global estimates of the exhaustion function are given. In Paper IV, it is shown that on the closure of a domain whose boundary locally is the graph of a continuous function, all plurisubharmonic functions with continuous boundary values can be uniformly approximated by smooth plurisubharmonic functions defined in neighbourhoods of the closure of the domain. Paper V studies  Poletsky’s notion of plurisubharmonicity on compact sets. It is shown that a function is plurisubharmonic on a given compact set if, and only if, it can be pointwise approximated by a decreasing sequence of smooth plurisubharmonic functions defined in neighbourhoods of the set. Paper VI introduces the notion of a P-hyperconvex domain. It is shown that in such a domain, both the Dirichlet problem with respect to functions plurisubharmonic on the closure of the domain, and the problem of approximation by smooth plurisubharmoinc functions in neighbourhoods of the closure of the domain have satisfactory answers in terms of plurisubharmonicity on the boundary.

Cette thèse est centrée autour de l'étude théorique et de l'analyse numérique des équations paraboliques non linéaires avec divers conditions aux limites. La première partie est consacrée aux équations paraboliques dégénérées mêlant des phénomènes non-linéaires de diffusion et de transport. Nous définissons des notions de solutions entropiques adaptées pour chacune des conditions aux limites (flux nul, Robin, Dirichlet). La difficulté principale dans l'étude de ces problèmes est due au manque de régularité du flux pariétal pour traiter les termes de bords. Ceci pose un problème pour la preuve d'unicité. Pour y remédier, nous tirons profit du fait que ces résultats de régularités sur le bord sont plus faciles à obtenir pour le problème stationnaire et particulièrement en dimension un d'espace. Ainsi par la méthode de comparaison "fort-faible" nous arrivons à déduire l'unicité avec le choix d'une fonction test non symétrique et en utilisant la théorie des semi-groupes non linéaires. L'existence de solution se démontre en deux étapes, combinant la méthode de régularisation parabolique et les approximations de Galerkin. Nous développons ensuite une approche directe en construisant des solutions approchées par un schéma de volumes finis implicite en temps. Dans les deux cas, on combine les estimations dans les espaces fonctionnels bien choisis avec des arguments de compacité faible ou forte et diverses astuces permettant de passer à la limite dans des termes non linéaires. Notamment, nous introduisons une nouvelle notion de solution appelée solution processus intégrale dont l'objectif, dans le cadre de notre étude, est de pallier à la difficulté de prouver la convergence vers une solution entropique d'un schéma volumes finis pour le problème de flux nul au bord. La deuxième partie de cette thèse traite d'un problème à frontière libre décrivant la propagation d'un front de combustion et l'évolution de la température dans un milieu hétérogène. Il s'agit d'un système d'équations couplées constitué de l'équation de la chaleur bidimensionnelle et d'une équation de type Hamilton-Jacobi. L'objectif de cette partie est de construire un schéma numérique pour ce problème en combinant des discrétisations du type éléments finis avec les différences finies. Ceci nous permet notamment de vérifier la convergence de la solution numérique vers une solution onde pour un temps long. Dans un premier temps, nous nous intéressons à l'étude d'un problème unidimensionnel. Très vite, nous nous heurtons à un problème de stabilité du schéma. Cela est dû au problème de prise en compte de la condition de Neumann au bord. Par une technique de changement d'inconnue et d'approximation nous remédions à ce problème. Ensuite, nous adaptons cette technique pour la résolution du problème bidimensionnel. A l'aide d'un changement de variables, nous obtenons un domaine fixe facile pour la discrétisation. La monotonie du schéma obtenu est prouvée sous une hypothèse supplémentaire de propagation monotone qui exige que la frontière libre se déplace dans les directions d'un cône prescrit à l'avance.

Abstract The dissertation considers a degree theory and the index of a critical point of demi-continuous, everywhere defined mappings of the monotone type. A topological degree is derived for mappings from a Banach space to its dual space. The mappings satisfy the condition (S+), and it is shown that the derived degree has the classical properties of a degree function. A formula for the calculation of the index of a critical point of a mapping A : X→X* satisfying the condition (S+) is derived without the separability of X and the boundedness of A. For the calculation of the index, we need an everywhere defined linear mapping A' : X→X* that approximates A in a certain set. As in the earlier results, A' is quasi-monotone, but our situation differs from the earlier results because A' does not have to be the Frechet or Gateaux derivative of A at the critical point. The theorem for the calculation of the index requires a construction of a compact operator T = (A' + Γ)-1Γ with the aid of linear mappings Γ : X→X and A'. In earlier results, Γ is compact, but here it need only be quasi-monotone. Two counter-examples show that certain assumptions are essential for the calculation of the index of a critical point.

In this thesis, we study the tradeoff of average delay with average service cost and average utility for both continuous time and discrete time single server queueing models without and with admission control. The continuous time and discrete time queueing models that we consider are motivated by cross-layer models for point-to-point links with random packet arrivals and fading at slow and fast time scales. Our studies are motivated by the need to optimally tradeoff the average delay of the packets (a network layer performance measure) with the average service cost of transmitting the packets, e.g. the average power required for transmission (a physical layer performance measure) under a lower bound constraint on the average throughput, in various point-to-point communication scenarios. The tradeoff problems are studied for a class of monotone and stationary scheduling policies and under the assumption that the service cost rate and utility rate are respectively convex and concave functions of the service rate and arrival rate. We also consider the problem of optimally trading off the average delay and average error rate of randomly arriving message symbols which are transmitted over a noisy point-to-point link, in which case the service cost function is non-convex. The solutions to the tradeoff problems that we address in the thesis are asymptotic in nature, and are similar in spirit to the Berry-Gallager asymptotic bounds. It is intuitive that to keep a queue stable under a lower bound constraint on the average utility a minimum number of customers have to be served per unit time. This in turn implies that queue stability requires a minimum average service cost expenditure. In the thesis we obtain an asymptotic characterization of the minimum average delay for monotone stationary policies subject to an upper bound constraint on the average service cost and a lower bound constraint on the average utility, in the asymptotic regime where the average service cost constraint is made arbitrarily close to the above minimum average service cost. In the thesis, we obtain asymptotic lower bounds on the minimum average delay for the cases for which lower bounds were previously not known. The asymptotic characterization of the minimum average delay for monotone stationary policies, for both continuous time and discrete time models, is obtained via geometric bounds on the stationary probability of the queue length, in the above asymptotic regime. The restriction to monotone stationary policies enables us to obtain an intuitive explanation for the behaviour of the asymptotic lower bounds using the above geometric bounds on the stationary probability distribution of the queue length. The geometric bounds on the stationary probability of the queue length also lead to a partial asymptotic characterization of the structure of any optimal monotone stationary policy, in the above asymptotic regime, which was not available in previous work. Furthermore, the geometric bounds on the stationary probability can be extended to analyse the tradeoff problem in other scenarios, such as for other continuous time queueing models, multiple user communication models, queueing models with service time control, and queueing models with general holding costs. Usually, queueing models with integer valued queue evolution, are approximated by queueing models with real valued queue evolution and strictly convex service cost functions for analytical tractability. Using the asymptotic bounds, we show that for some cases the average delay does not grow to infinity in the asymptotic regime, although the approximate model suggests that the average delay does grow to infinity. In other cases where the average delay does grow to infinity in the asymptotic regime, our results illustrate that the tradeoff behaviour of the approximate model is different from that of the original integer valued queueing model unless the service cost function is modelled as the piecewise linear lower convex envelope of the service cost function for the original model.

This thesis presents the construction, the analysis and the verication of compact residual discretizations for the solution of conservation laws on unstructured meshes. <p>The schemes considered belong to the class of residual distribution (RD) or fluctuation splitting (FS) schemes. <p>The methodology presented relies on three main elements: design of compact linear first-order stable schemes for linear hyperbolic PDEs, a positivity preserving procedure mapping stable first-order linear schemes onto nonlinear second-order schemes with non-oscillatory shock capturing capabilities, and a conservative formulation enabling to extend the schemes to nonlinear CLs. These three design steps, and the underlying theoretical tools, are discussed in depth. The nonlinear RD schemes resulting from this construction are tested on a large set of problems involving the solution of scalar models, and systems of CLs. This extensive verification fills the gaps left open, where no theoretical analysis is possible. <p>Numerical results are presented on the Euler equations of a perfect gas, on a two-phase flow model with highly nonlinear thermodynamics, and on the shallow-water equations. <p>On irregular grids, the schemes proposed yield quite accurate and stable solutions even on very difficult computations. Direct comparisone show that these results are more accurate than the ones given by FV and WENO schemes. Moreover, our schemes have a compact nearest-neighbor stencil. This encourages to further develop our approach, toward the design of very high-order schemes, which would represent a very appealing alternative, both in terms of accuracy and efficiency, to now classical FV and ENO/WENO discretizations. These schemes might also be very competitive with respect to very high-order DG schemes. / Doctorat en sciences appliquées / info:eu-repo/semantics/nonPublished

L’objectif de cette thèse est d’appliquer la théorie du contrôle optimal à la dynamique de systèmes quantiques. Le premier point consiste à introduire dans le domaine du contrôle quantique des outils de contrôle optimal initialement développés en mathématique. Cette approche a ensuite été appliquée sur différent types de systèmes quantiques décrit par une grande ou une petite dimension. La première partie du manuscrit introduit les différents outils de contrôles utilisés avec une approche adaptée à un public de physiciens. Dans la seconde partie, ces techniques sont utilisées pour contrôler la dynamique des spins en RMN et IRM. La troisième partie s’intéresse au développement de nouveaux algorithmes itératifs de contrôle optimal appliqués au contrôle par champ laser de la dynamique rotationnelle des molécules linéaires en phases gazeuse ainsi qu’au développement d’une stratégie de contrôle simple permettant de délocaliser une molécule dans un plan. La quatrième partie traite le contrôle en temps minimum d’un condensat de Bose-Einstein à deux composantes. La dernière partie permet de comparer qualitativement et quantitativement les différentes méthodes de contrôle optimal utilisées. Les seconde et troisième parties ont également bénéficier de l’implémentation expérimentale des solutions de contrôle optimal obtenues. / The goal of this thesis is to apply the optimal control theory to the dynamics of quantum systems.The first part aim at introducing the tools of optimal control in quantum control which were initially developedin mathematics. This approch has been applied on different kinds of quantum system with small and largedimensions. The first part of this manuscript introduces the optimal control tools which are used with a pointof view suited to a public of physicists. In the second part these techniques are used to control the dynamics ofspins in NMR and MRI. The third part deals with the development of new iterative algorithms applied to thecontrol by laser fields of the rotational dynamics of linear molecules in a gaz phases and the development of asimple control strategy allowing to delocalize a molecule in a plan. The fourth part treats the time-minimumcontrol of a two-component Bose Einstein condensate. The last part compares the different optimal controlmethods used qualitatively and quantitatively. The solution found in the second and third parts have been alsoapplied experimentally.

Dizertační práce se věnuje funkcionálním diferenciálním rovnicím smíšeného typu. Poskytuje kritéria pro existenci globálních a semi-globálních řešení diferenciálních systémů smíšeného typu. Metody použité v teto práci spočívají v sestavení vhodných operátorů pro diferenciální rovnice a prokázání existence jejich pevných bodů. Tyto pevné body jsou potom použity ke konstrukci řešení rovnic s předcházením a zpožděním. V důkazech tvrzení jsou použity monotónní iterační metoda a Schauderovy-Tychonovovy věty o existenci pevného bodu. V obou případech jsou uvedeny také odhady řešení. Pokud je použita iterační metoda, lze tyto odhady zlepšit iterováním. Kromě toho jsou odvozena kritéria pro lineární rovnice a systémy a je uvedena řada přikladů. Dosažené výsledky lze aplikovat také pro obyčejné diferenciální rovnice nebo diferenciální rovnice se zpožděním či s předcházením argumentu.

Die vorliegende Arbeit analysiert die Phänologie photosynthetisch aktiver Vegetation mit Hilfe von NDVI Zeitreihen für einen Zeitraum von 24 Jahren (AVHRR‑GIMMS Daten). Neben einer Datierung des jahreszeitlichen Wechsels zwischen Wachstums-, Reife- und Seneszenzphase wird das Ziel verfolgt, Trends sowohl in phänologischen Ereignissen (Start-of-Season) als auch im NDVI zu identifizieren. Das, in der semi-ariden Sahelregion gelegene, Untersuchungsgebiet weist mit zwei sich teilweise überlagernden Vegetationsperioden eine komplexe Phänologie auf, deren Modellierung durch die sowohl in ihren Zeitpunkten als auch in ihren Ausprägungen hoch variablen Vegetationsabläufe erschwert wird. Vor diesem Hintergrund ist zunächst ein, auf der Fourieranalyse basierender, Ansatz zur flexiblen Glättung der NDVI Zeitreihen entwickelt worden. Um für die Trendanalyse lineare Regressionsverfahren einsetzen zu können, sind die Zeitreihen nach dem Komponentenmodell untergliedert worden (Subtraktion der Saisonfigur). Alternativ kam der saisonale MANN-KENDALL Trendtest zur Anwendung. Die NDVI Zeitreihen wurden ebenfalls auf Änderungen im mehrjährigen Mittelwert (Bruchpunkte) untersucht. Alle Auswertungen sind in einer eigenen Applikation umgesetzt worden. Es konnte gezeigt werden, daß Änderungen im NDVI Niveau eher abrupt als graduell verlaufen. Langfristige Trends weisen nur geringe Anstiege auf. Die Vegetation erholte sich von der Dürre 1984/85 nur im südlichen Teil des Untersuchungsgebietes, im Norden dominieren langfristig negative Trends. Brüche im mean der NDVI Zeitreihen korrelieren mit Brüchen im Abflußverhalten des Niger.

Submitted by Erika Demachki (erikademachki@gmail.com) on 2015-05-21T19:19:51Z No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Erika Demachki (erikademachki@gmail.com) on 2015-05-21T19:21:31Z (GMT) No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2015-05-21T19:21:31Z (GMT). No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-02-27 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Nesta tese apresentamos v arios algoritmos para resolver os problemas de Desigualdade Variacional e Inclus~ao. Para o problema de desigualdade variacional propomos, no Cap tulo 2 uma generaliza c~ao do algoritmo cl assico extragradiente, utilizando vetores normais n~ao nulos do conjunto vi avel. Em particular, dois algoritmos conceituais s~ao propostos e cada um deles cont^em tr^es variantes diferentes de proje c~ao que est~ao relacionadas com algoritmos extragradientes modi cados. Duas buscas diferentes s~ao propostas, uma sobre a borda do conjunto vi avel e a outra ao longo das dire c~oes vi aveis. Cada algoritmo conceitual tem uma estrat egia diferente de busca e tr^es formas de proje c~ao especiais, gerando tr^es sequ^encias com diferente e interessantes propriedades. E feito a an alise da converg^encia de ambos os algoritmos conceituais, pressupondo a exist^encia de solu c~oes, continuidade do operador e uma condi c~ao mais fraca do que pseudomonotonia. No Cap tulo 4, n os introduzimos um algoritmo direto de divis~ao para o problema variacional em espa cos de Hilbert. J a no Cap tulo 5, propomos um algoritmo de proje c~ao relaxada em Espa cos de Hilbert para a soma de m operadores mon otonos maximais ponto-conjunto, onde o conjunto vi avel do problema de desigualdade variacional e dado por uma fun c~ao n~ao suave e convexa. Neste caso, as proje c~oes ortogonais ao conjunto vi avel s~ao substitu das por proje c~oes em hiperplanos que separam a solu c~ao da itera c~ao atual. Cada itera c~ao do m etodo proposto consiste em proje c~oes simples de tipo subgradientes, que n~ao exige a solu c~ao de subproblemas n~ao triviais, utilizando apenas os operadores individuais, explorando assim a estrutura do problema. Para o problema de Inclus~ao, propomos variantes do m etodo de divis~ao de forward-backward para achar um zero da soma de dois operadores, a qual e a modi ca c~ao cl assica do forwardbackward proposta por Tseng. Um algoritmo conceitual e proposto para melhorar o apresentado por Tseng em alguns pontos. Nossa abordagem cont em, primeramente, uma busca linear tipo Armijo expl cita no esp rito dos m etodos tipo extragradientes para desigualdades variacionais. Durante o processo iterativo, a busca linear realiza apenas um c alculo do operador forward-backward em cada tentativa de achar o tamanho do passo. Isto proporciona uma consider avel vantagem computacional pois o operador forward-backward e computacionalmente caro. A segunda parte do esquema consiste em diferentes tipos de proje c~oes, gerando sequ^encias com caracter sticas diferentes. / In this thesis we present various algorithms to solve the Variational Inequality and Inclusion Problems. For the variational inequality problem we propose, in Chapter 2, a generalization of the classical extragradient algorithm by utilizing non-null normal vectors of the feasible set. In particular, two conceptual algorithms are proposed and each of them has three di erent projection variants which are related to modi ed extragradient algorithms. Two di erent linesearches, one on the boundary of the feasible set and the other one along the feasible direction, are proposed. Each conceptual algorithm has a di erent linesearch strategy and three special projection steps, generating sequences with di erent and interesting features. Convergence analysis of both conceptual algorithms are established, assuming existence of solutions, continuity and a weaker condition than pseudomonotonicity on the operator. In Chapter 4 we introduce a direct splitting method for solving the variational inequality problem for the sum of two maximal monotone operators in Hilbert space. In Chapter 5, for the same problem, a relaxed-projection splitting algorithm in Hilbert spaces for the sum of m nonsmooth maximal monotone operators is proposed, where the feasible set of the variational inequality problem is de ned by a nonlinear and nonsmooth continuous convex function inequality. In this case, the orthogonal projections onto the feasible set are replaced by projections onto separating hyperplanes. Furthermore, each iteration of the proposed method consists of simple subgradient-like steps, which does not demand the solution of a nontrivial subproblem, using only individual operators, which explores the structure of the problem. For the Inclusion Problem, in Chapter 3, we propose variants of forward-backward splitting method for nding a zero of the sum of two operators, which is a modi cation of the classical forward-backward method proposed by Tseng. The conceptual algorithm proposed here improves Tseng's method in many instances. Our approach contains rstly an explicit Armijo-type line search in the spirit of the extragradient-like methods for variational inequalities. During the iterative process, the line search performs only one calculation of the forward-backward operator in each tentative for nding the step size. This achieves a considerable computational saving when the forward-backward operator is computationally expensive. The second part of the scheme consists of special projection steps bringing several variants.