Eigenfunctions and fundamental solutions of the fractional Laplace and Dirac operators: the Riemann-Liouville case

In this paper we study eigenfunctions and fundamental solutions for the three parameter fractional Laplace operator $\Delta_+^{(\alpha,\beta,\gamma)}:= D_{x_0^+}^{1+\alpha} +D_{y_0^+}^{1+\beta} +D_{z_0^+}^{1+\gamma},$ where $(\alpha, \beta, \gamma) \in \,]0,1]^3$, and the fractional derivatives $D_{x_0^+}^{1+\alpha}$, $D_{y_0^+}^{1+\beta}$, $D_{z_0^+}^{1+\gamma}$ are in the Riemann-Liouville sense. Applying operational techniques via two-dimensional Laplace transform we describe a complete family of eigenfunctions and fundamental solutions of the operator $\Delta_+^{(\alpha,\beta,\gamma)}$ in classes of functions admitting a summable fractional derivative. Making use of the Mittag-Leffler function, a symbolic operational form of the solutions is presented. From the obtained family of fundamental solutions we deduce a family of fundamental solutions of the fractional Dirac operator, which factorizes the fractional Laplace operator. We apply also the method of separation of variables to obtain eigenfunctions and fundamental solutions.

Eigenfunctions and fundamental solutions of the Caputo fractional Laplace and Dirac operators

In this paper, by using the method of separation of variables, we obtain eigenfunctions and fundamental solutions for the three parameter fractional Laplace operator defined via fractional Caputo derivatives. The solutions are expressed using the Mittag-Leffler function and we show some graphical representations for some parameters. A family of fundamental solutions of the corresponding fractional Dirac operator is also obtained. Particular cases are considered in both cases.

Clifford-Hermite polynomials in fractional Clifford analysis

In this paper we generalize radial and standard Clifford-Hermite polynomials to the new framework of fractional Clifford analysis with respect to the Riemann-Liouville derivative in a symbolic way. As main consequence of this approach, one does not require an a priori integration theory. Basic properties such as orthogonality relations, differential equations, and recursion formulas, are proven.

A numerical method to solve higher-order fractional differential equations

In this paper, we present a new numerical method to solve fractional differential equations. Given a fractional derivative of arbitrary real order, we present an approximation formula for the fractional operator that involves integer-order derivatives only. With this, we can rewrite FDEs in terms of a classical one and then apply any known technique. With some examples, we show the accuracy of the method.

A Caputo fractional derivative of a function with respect to another function

In this paper we consider a Caputo type fractional derivative with respect to another function. Some properties, like the semigroup law, a relationship between the fractional derivative and the fractional integral, Taylor’s Theorem, Fermat’s Theorem, etc., are studied. Also, a numerical method to deal with such operators, consisting in approximating the fractional derivative by a sum that depends on the first-order derivative, is presented. Relying on examples, we show the efficiency and applicability of the method. Finally, an application of the fractional derivative, by considering a Population Growth Model, and showing that we can model more accurately the process using different kernels for the fractional operator is provided.

Fractional differential equations with dependence on the Caputo-Katugampola derivative

In this paper we present a new type of fractional operator, the Caputo–Katugampola derivative. The Caputo and the Caputo–Hadamard fractional derivatives are special cases of this new operator. An existence and uniqueness theorem for a fractional Cauchy type problem, with dependence on the Caputo–Katugampola derivative, is proven. A decomposition formula for the Caputo–Katugampola derivative is obtained. This formula allows us to provide a simple numerical procedure to solve the fractional differential equation.

Modeling some real phenomena by fractional differential equations

This paper deals with fractional differential equations, with dependence on a Caputo fractional derivative of real order. The goal is to show, based on concrete examples and experimental data from several experiments, that fractional differential equations may model more efficiently certain problems than ordinary differential equations. A numerical optimization approach based on least squares approximation is used to determine the order of the fractional operator that better describes real data, as well as other related parameters.

Calculus of variations on time scales and discrete fractional calculus

Estudamos problemas do cálculo das variações e controlo óptimo no contexto das escalas temporais. Especificamente, obtemos condições necessárias de optimalidade do tipo de Euler–Lagrange tanto para lagrangianos dependendo de derivadas delta de ordem superior como para problemas isoperimétricos. Desenvolvemos também alguns métodos directos que permitem resolver determinadas classes de problemas variacionais através de desigualdades em escalas temporais. No último capítulo apresentamos operadores de diferença fraccionários e propomos um novo cálculo das variações fraccionário em tempo discreto. Obtemos as correspondentes condições necessárias de Euler– Lagrange e Legendre, ilustrando depois a teoria com alguns exemplos.

Fractional calculus on time scales - Cálculo fraccional em escalas temporais

Introduzimos um cálculo das variações fraccional nas escalas temporais ℤ e (hℤ)!. Estabelecemos a primeira e a segunda condição necessária de optimalidade. São dados alguns exemplos numéricos que ilustram o uso quer da nova condição de Euler–Lagrange quer da nova condição do tipo de Legendre. Introduzimos também novas definições de derivada fraccional e de integral fraccional numa escala temporal com recurso à transformada inversa generalizada de Laplace.

Computational methods in the fractional calculus of variations and optimal control

The fractional calculus of variations and fractional optimal control are generalizations of the corresponding classical theories, that allow problem modeling and formulations with arbitrary order derivatives and integrals. Because of the lack of analytic methods to solve such fractional problems, numerical techniques are developed. Here, we mainly investigate the approximation of fractional operators by means of series of integer-order derivatives and generalized finite differences. We give upper bounds for the error of proposed approximations and study their efficiency. Direct and indirect methods in solving fractional variational problems are studied in detail. Furthermore, optimality conditions are discussed for different types of unconstrained and constrained variational problems and for fractional optimal control problems. The introduced numerical methods are employed to solve some illustrative examples.

Network virtualisation from an operator perspective

Network virtualisation is seen as a promising approach to overcome the so-called “Internet impasse” and bring innovation back into the Internet, by allowing easier migration towards novel networking approaches as well as the coexistence of complementary network architectures on a shared infrastructure in a commercial context. Recently, the interest from the operators and mainstream industry in network virtualisation has grown quite significantly, as the potential benefits of virtualisation became clearer, both from an economical and an operational point of view. In the beginning, the concept has been mainly a research topic and has been materialized in small-scale testbeds and research network environments. This PhD Thesis aims to provide the network operator with a set of mechanisms and algorithms capable of managing and controlling virtual networks. To this end, we propose a framework that aims to allocate, monitor and control virtual resources in a centralized and efficient manner. In order to analyse the performance of the framework, we performed the implementation and evaluation on a small-scale testbed. To enable the operator to make an efficient allocation, in real-time, and on-demand, of virtual networks onto the substrate network, it is proposed a heuristic algorithm to perform the virtual network mapping. For the network operator to obtain the highest profit of the physical network, it is also proposed a mathematical formulation that aims to maximize the number of allocated virtual networks onto the physical network. Since the power consumption of the physical network is very significant in the operating costs, it is important to make the allocation of virtual networks in fewer physical resources and onto physical resources already active. To address this challenge, we propose a mathematical formulation that aims to minimize the energy consumption of the physical network without affecting the efficiency of the allocation of virtual networks. To minimize fragmentation of the physical network while increasing the revenue of the operator, it is extended the initial formulation to contemplate the re-optimization of previously mapped virtual networks, so that the operator has a better use of its physical infrastructure. It is also necessary to address the migration of virtual networks, either for reasons of load balancing or for reasons of imminent failure of physical resources, without affecting the proper functioning of the virtual network. To this end, we propose a method based on cloning techniques to perform the migration of virtual networks across the physical infrastructure, transparently, and without affecting the virtual network. In order to assess the resilience of virtual networks to physical network failures, while obtaining the optimal solution for the migration of virtual networks in case of imminent failure of physical resources, the mathematical formulation is extended to minimize the number of nodes migrated and the relocation of virtual links. In comparison with our optimization proposals, we found out that existing heuristics for mapping virtual networks have a poor performance. We also found that it is possible to minimize the energy consumption without penalizing the efficient allocation. By applying the re-optimization on the virtual networks, it has been shown that it is possible to obtain more free resources as well as having the physical resources better balanced. Finally, it was shown that virtual networks are quite resilient to failures on the physical network.