The objective of this PhD research programme is to investigate the effectiveness of a finite volume method incorporating radial basis functions for simulating nonlinear transport processes. The finite volume method is the favoured numerical technique for solving the advection-diffusion equations that arise in transport simulation. The method transforms the original problem into a system of nonlinear, algebraic equations through the process of discretisation. The accuracy of this discretisation determines to a large extent the accuracy of the final solution. A new method of discretisation is presented that employs radial basis functions (rbfs) as a means of local interpolation. When combined with Gaussian quadrature integration methods, the resulting finite volume discretisation leads to accurate numerical solutions without the need for very fine meshes, and the additional overheads they entail. The resulting nonlinear, algebraic system is solved efficiently using a Jacobian-free Newton-Krylov method. By employing the new method as an extension of existing shape function-based approaches, the number of nonlinear iterations required to obtain convergence can be reduced. Furthermore, information obtained from these iterations can be used to increase the efficiency of subsequent rbf-based iterations, as well as to construct an effective parallel reconditioner to further reduce the number of nonlinear iterations required. Results are presented that demonstrate the improved accuracy offered by the new method when applied to several test problems. By successively refining the meshes, it is also possible to demonstrate the increased order of the new method, when compared to a traditional shape function basedmethod. Comparing the resources required for both methods reveals that the new approach can be many times more efficient at producing a solution of a given accuracy.

Neste texto é feita uma discussão sobre alguns resultados que fornecem condições suficientes para que um difeomorfismo local, do espaço euclideano n-dimensional nele próprio, seja injetivo. Dentro deste cenário, são exploradas as contribuições destes resultados na tentativa de solucionar conhecidas conjecturas no meio científico como a Conjectura Jacobiana e a Conjectura de Ponto Fixo. Do ponto de vista dinâmico, existem relações entre injetividade global e estabilidade assintótica global. Neste sentido, os resultados também são contextualizados com respeito a importantes conjecturas de estabilidade assintótica: Conjectura de Markus-Yamabe e o Problema de LaSalle / We present some results which give suficient conditions for a local diffeomorphism from the n-dimensional Euclidean space into itself be globally injective. Within this context, we consider some partial results addressed to solve the well known Fixed Point Conjecture and Jacobian Conjecture. From the dynamical point of view, there are connections between global injectivity and global asymptotic stability. In this way, we present a solution of the Markus-Yamabe Conjecture and of the LaSalle Problem

On étudie dans cette thèse les cycles algébriques sur les variétés Jacobiennes de courbes complexes projectives lisses qui admettent des automorphismes non triviaux. Il s'agit plus précisément d'étudier de nouveaux anneaux tautologiques associés à des groupes d’automorphismes de la courbe. On montre que ces Q-algèbres naturelles de cycles algébriques sur les Jacobiennes se restreignent en des familles de cycles sur certaines sous-variétés spéciales de la Jacobienne et que celles-ci méritent encore le nom d'anneaux tautologiques sur ces sous-variétés. On étudie en détail le cas des courbes hyperelliptiques; situation dans laquelle les algèbres introduites admettent un nombre fini de générateurs, et en particulier sont de dimension finie. On peut alors être très précis dans l'étude des relations entre ces générateurs. Enfin, on montre que ces anneaux tautologiques apparaissent naturellement dans un autre contexte : celui des systèmes linéaires complets sans point de base. / In this thesis we study algebraic cycles on Jacobian varieties of smooth projective complex curves with non trivial automorphisms. More precisely, we introduce new tautological rings associated to groups of automorphisms of the curve. We show that these natural Q-algebras of algebraic cycles on Jacobians induce a good notion of tautological rings on some particular subvarieties of the Jacobian. We then study in detail the case of hyperelliptic curves. In this case, the tautological rings admit a finite number of generators, and in particular are of finite dimension. We can then be very precise when studying the relations between these generators. Finally, we present another situation in which these tautological rings appear: when we consider complete linear series without base point.

Sea ice plays a key role in the global climate system. Indeed, through the albedo effect it reflects significant solar radiation away from the oceans, while it also plays a key role in the momentum and heat transfer between the atmosphere and ocean by acting as an insulating layer between the two. Furthermore, as more sea ice melts due to climate change, additional fresh water is released into the upper oceans, affecting the global circulation of the ocean as a whole. While there has been significant effort in recent decades, the ability to simulate sea ice has lagged behind other components of the climate system and most Earth System Models fail to capture the observed losses of Arctic sea ice, which is largely attributed to our inability to resolve sea ice dynamics. The most widely accepted model for sea ice dynamics is the Viscous- Plastic (VP) rheology, which leads to a very non-linear set of partial differential equations that are known to be intrinsically difficult to solve numerically. This work builds on recent advances in solving these equations with a Jacobian-Free Newton- Krylov (JFNK) solver. We present an improved JFNK solver, where a fully second order discretization is achieved via the Crank Nicolson scheme and consistency is improved via a novel approach to the rheology term. More importantly, we present a significant improvement to the Jacobian approximation used in the Newton iterations, and partially form the action of the matrix by expressing the linear and nearly linear terms in closed form and approximating the remaining highly non-linear term with a second order approximation of its Gateaux derivative. This is in contrast with the previous approach which used a first order approximation for the Gateaux derivative of the whole functional. Numerical tests on synthetic equations confirm the theoretical convergence rate and demonstrate the drastic improvements seen by using a second order approximation in the Gateaux derivative. To produce a fast and efficient solver for VP sea ice dynamics, the improved JFNK solver is then coupled with a non- oscillatory, central differencing scheme for transporting sea ice as well as a novel method for tracking the ice domain using a level set method. Two idealized test cases are then presented and simulation results discussed, demonstrating the solver’s ability to efficiently produce Viscous-Plastic, physically motivated solutions. / Graduate

Cílem této práce je zpracovat úvod do problematiky hypereliptických křivek s důrazem na konečná pole. T práci je dále popsán úvod do teorie divizorů na hypereliptických křivkách, jejich reprezentace, aritmetika nad divizory a jejich využití v kryptografii. Teorie je hojně demonstrována příklady a výpočty v systému Mathematica.

Recently, with growing application of wind power, the system based on the doubly fedinduction generator (DFIG) has become the one of the most popular concepts. Theproblem of connecting to the grid is also gradually revealed. As an effective solution toconnect offshore wind farm, VSC-HVDC line is the most suitable choice for stabilityreasons. However, there are possibilities that the converter of a VSC-HVDC link canadversely interact with the wind turbine and generate poorly damped sub-synchronousoscillations. Therefore, this master thesis will derive the linear model of a single DFIG aswell as the linear model of several DFIGs connecting to a VSC-HVDC link. For thelinearization method, the Jacobian transfer matrix modeling method will be explainedand adopted. The frequency response and time-domain response comparison betweenthe linear model and the identical system in PSCAD will be presented for validation. / Nyligen, med ökande tillämpning av vindkraft, det system som bygger på den dubbeltmatad induktion generator (DFIG) har blivit en av de mest populära begrepp. Problemetmed att ansluta till nätet är också gradvis avslöjas. Som en effektiv lösning för att anslutavindkraftpark är VSC -HVDC linje det lämpligaste valet av stabilitetsskäl. Det finns dockmöjligheter att omvandlaren en VSC-HVDC länk negativt kan interagera medvindturbinen och genererar dåligt dämpade under synkron svängningar. Därför kommerdetta examensarbete härleda den linjära modellen av en enda DFIG liksom den linjäramodellen av flera DFIGs ansluter till en VSC-HVDC -länk. För arise metoden kommerJacobian transfer matrix modelleringsmetodförklaras och antas. Jämförelse mellan denlinjära modellen och identiskt system i PSCAD frekvensgången och tidsdomänensvarkommer att presenteras för godkännande.

[pt] A identificação algorítmica de matrizes de Jacobi a partir de variáveis espectrais é um tema tradicional de análise numérica. Uma nova representação, as coordenadas bidiagonais, naturalmente exigiu que fosse considerado um novo algoritmo. O algoritmo é apresentado e confrontado com as técnicas habituais. / [en] Algorithms relating Jacobi matrices and spectral variables are standard objects in numerical analysis. The recent discovery of bidiagonal coordinates led to the search of an appropriate algorithm for these new variables. The new algorithm is presented and compared with previous techniques.

Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) , which is so called because of its similarity to the discrete logarithm problem (DLP) over the integers modulo a large prime. One benefit of elliptic curve cryptosystems (ECCs) is that they can use a much shorter key length than other public key cryptosystems to provide an equivalent level of security. For example, 160 bit ECCs are believed to provide about the same level of security as 1024 bit RSA. Also, the level of security provided by an ECC increases faster with key size than for integer based discrete logarithm (dl) or RSA cryptosystems. ECCs can also provide a faster implementation than RSA or dl systems, and use less bandwidth and power. These issues can be crucial in lightweight applications such as smart cards. In the last few years, ECCs have been included or proposed for inclusion in internationally recognized standards. Thus elliptic curve cryptography is set to become an integral part of lightweight applications in the immediate future. This thesis presents an analysis of several important issues for ECCs on lightweight devices. It begins with an introduction to elliptic curves and the algorithms required to implement an ECC. It then gives an analysis of the speed, code size and memory usage of various possible implementation options. Enough details are presented to enable an implementer to choose for implementation those algorithms which give the greatest speed whilst conforming to the code size and ram restrictions of a particular lightweight device. Recommendations are made for new functions to be included on coprocessors for lightweight devices to support ECC implementations Another issue of concern for implementers is the side-channel attacks that have recently been proposed. They obtain information about the cryptosystem by measuring side-channel information such as power consumption and processing time and the information is then used to break implementations that have not incorporated appropriate defences. A new method of defence to protect an implementation from the simple power analysis (spa) method of attack is presented in this thesis. It requires 44% fewer additions and 11% more doublings than the commonly recommended defence of performing a point addition in every loop of the binary scalar multiplication algorithm. The algorithm forms a contribution to the current range of possible spa defences which has a good speed but low memory usage. Another topic of paramount importance to ECCs for lightweight applications is whether the security of fixed curves is equivalent to that of random curves. Because of the inability of lightweight devices to generate secure random curves, fixed curves are used in such devices. These curves provide the additional advantage of requiring less bandwidth, code size and processing time. However, it is intuitively obvious that a large precomputation to aid in the breaking of the elliptic curve discrete logarithm problem (ECDLP) can be made for a fixed curve which would be unavailable for a random curve. Therefore, it would appear that fixed curves are less secure than random curves, but quantifying the loss of security is much more difficult. The thesis performs an examination of fixed curve security taking this observation into account, and includes a definition of equivalent security and an analysis of a variation of Pollard's rho method where computations from solutions of previous ECDLPs can be used to solve subsequent ECDLPs on the same curve. A lower bound on the expected time to solve such ECDLPs using this method is presented, as well as an approximation of the expected time remaining to solve an ECDLP when a given size of precomputation is available. It is concluded that adding a total of 11 bits to the size of a fixed curve provides an equivalent level of security compared to random curves. The final part of the thesis deals with proofs of security of key exchange protocols in the Canetti-Krawczyk proof model. This model has been used since it offers the advantage of a modular proof with reusable components. Firstly a password-based authentication mechanism and its security proof are discussed, followed by an analysis of the use of the authentication mechanism in key exchange protocols. The Canetti-Krawczyk model is then used to examine secure tripartite (three party) key exchange protocols. Tripartite key exchange protocols are particularly suited to ECCs because of the availability of bilinear mappings on elliptic curves, which allow more efficient tripartite key exchange protocols.

Motivated by experiments on titanium alloys of Petrinic et al. (2006), which show the formation of cracks through the growth and coalescence of voids in ductile fracture, we consider the problem of formulating a variational model in nonlinear elasticity compatible both with cavitation and the appearance of discontinuities across two-dimensional surfaces. As in the model for cavitation of Müller and Spector (1995) we address this problem, which is connected to the sequential weak continuity of the determinant of the deformation gradient in spaces of functions having low regularity, by means of adding an appropriate surface energy term to the elastic energy. Based upon considerations of invertibility, we derive an expression for the surface energy that admits a physical and a geometrical interpretation, and that allows for the formulation of a model with better analytical properties. We obtain, in particular, important regularity results for the inverses of deformations, as well as the weak continuity of the determinants and the existence of minimizers. We show, further, that the creation of surface can be modeled by carefully analyzing the jump set of the inverses, and we point out some connections between the analysis of cavitation and fracture, the theory of SBV functions, and the theory of Cartesian currents of Giaquinta, Modica, and Soucek. In addition to the above, we extend previous work of Sivaloganathan, Spector and Tilakraj (2006) on the approximation of minimizers for the problem of cavitation with a constraint in the number of flaw points, and present some numerical results for this problem.

Student Number : 8315331 - MSc dissertation - School of Electrical and Information Engineering - Faculty of Engineering and the Built Environment / In this dissertation an efficient algorithm to calculate the differential of the network output with respect to its inputs is derived for axis orthogonal Local Model (LMN) and Radial Basis Function (RBF) Networks. A new recursive Singular Value Decomposition (SVD) adaptation algorithm, which attempts to circumvent many of the problems found in existing recursive adaptation algorithms, is also derived. Code listings and simulations are presented to demonstrate how the algorithms may be used in on-line adaptive neurocontrol systems. Specifically, the control techniques known as series inverse neural control and instantaneous linearization are highlighted. The presented material illustrates how the approach enhances the flexibility of LMN networks making them suitable for use in both direct and indirect adaptive control methods. By incorporating this ability into LMN networks an important characteristic of Multi Layer Perceptron (MLP) networks is obtained whilst retaining the desirable properties of the RBF and LMN approach.