Well-Posedness of the Cauchy Problem for Inhomogeneous Time-Fractional Pseudo-Differential Equations

Mathematics Subject Classification: 26A33, 45K05, 35A05, 35S10, 35S15, 33E12

Fractional Integration and Fractional Differentiation of the M-Series

Mathematics Subject Classification: 26A33, 33C60, 44A15

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.

Analytical and numerical solutions for the time and space-symmetric fractional diffusion equation

We consider a time and space-symmetric fractional diffusion equation (TSS-FDE) under homogeneous Dirichlet conditions and homogeneous Neumann conditions. The TSS-FDE is obtained from the standard diffusion equation by replacing the first-order time derivative by a Caputo fractional derivative, and the second order space derivative by a symmetric fractional derivative. First, a method of separating variables expresses the analytical solution of the TSS-FDE in terms of the Mittag--Leffler function. Second, we propose two numerical methods to approximate the Caputo time fractional derivative: the finite difference method; and the Laplace transform method. The symmetric space fractional derivative is approximated using the matrix transform method. Finally, numerical results demonstrate the effectiveness of the numerical methods and to confirm the theoretical claims.

Analytical solutions for the multi-term time-fractional diffusion-wave/diffusion equations in a finite domain

Multi-term time-fractional differential equations have been used for describing important physical phenomena. However, studies of the multi-term time-fractional partial differential equations with three kinds of nonhomogeneous boundary conditions are still limited. In this paper, a method of separating variables is used to solve the multi-term time-fractional diffusion-wave equation and the multi-term time-fractional diffusion equation in a finite domain. In the two equations, the time-fractional derivative is defined in the Caputo sense. We discuss and derive the analytical solutions of the two equations with three kinds of nonhomogeneous boundary conditions, namely, Dirichlet, Neumann and Robin conditions, respectively.

Dynamics of Barrierless and Activated Chemical Reactions in a Dispersive Medium within the Fractional Diffusion Equation Approach

Barrierless chemical reactions have often been modeled as a Brownian motion on a one-dimensional harmonic potential energy surface with a position-dependent reaction sink or window located near the minimum of the surface. This simple (but highly successful) description leads to a nonexponential survival probability only at small to intermediate times but exponential decay in the long-time limit. However, in several reactive events involving proteins and glasses, the reactions are found to exhibit a strongly nonexponential (power law) decay kinetics even in the long time. In order to address such reactions, here, we introduce a model of barrierless chemical reaction where the motion along the reaction coordinate sustains dispersive diffusion. A complete analytical solution of the model can be obtained only in the frequency domain, but an asymptotic solution is obtained in the limit of long time. In this case, the asymptotic long-time decay of the survival probability is a power law of the Mittag−Leffler functional form. When the barrier height is increased, the decay of the survival probability still remains nonexponential, in contrast to the ordinary Brownian motion case where the rate is given by the Smoluchowski limit of the well-known Kramers' expression. Interestingly, the reaction under dispersive diffusion is shown to exhibit strong dependence on the initial state of the system, thus predicting a strong dependence on the excitation wavelength for photoisomerization reactions in a dispersive medium. The theory also predicts a fractional viscosity dependence of the rate, which is often observed in the reactions occurring in complex environments.

Dynamic interaction of an elastic container with fluid

The vibration analysis of an elastic container with partially filled fluid was investigated in this paper. The container is made of a thin cylinder and two circular plates at the ends. The axis of the cylinder is in the horizontal direction. It is difficult to solve this problem because the complex system is not axially symmetric. The equations of motion for this system were derived. An incompressible and ideal fluid model is used in the present work. Solutions of the equations were obtained by the generalized variational method. The solution was expressed in a series of normalized generalized Fourier's functions. This series converged rapidly, and so its approximate solution was obtained with high precision. The agreement of the calculated values with the experimental result is good. It should be mentioned that with our method, the computer time is less than that with the finite-element method.

Photoelectron angular distributions from above threshold ionization of hydrogen atoms in strong laser fields

We apply a scattering theory of nonperturbative quantum electrodynamics to study the photoelectron angular distributions (PADs) of a hydrogen atom irradiated by linearly polarized laser light. The calculated PADs show main lobes and jetlike structure. Previous experimental studies reveal that in a set of above-threshold-ionization peaks when the absorbed-photon number increases by one, the jet number also increases by one. Our study confirms this experimental observation. Our calculations further predict that in some cases three more jets may appear with just one-more-photon absorption. With consideration of laser-frequency change, one less jet may also appear with one-more-photon absorption. The jetlike structure of PADs is due to the maxima of generalized phased Bessel functions, not an indication of the quantum number of photoelectron angular momentum states.

Calculation of light delay for coupled microrings by FDTD technique and Pade approximation

The Pade approximation with Baker's algorithm is compared with the least-squares Prony method and the generalized pencil-of-functions (GPOF) method for calculating mode frequencies and mode Q factors for coupled optical microdisks by FDTD technique. Comparisons of intensity spectra and the corresponding mode frequencies and Q factors show that the Pade approximation can yield more stable results than the Prony and the GPOF methods, especially the intensity spectrum. The results of the Prony method and the GPOF method are greatly influenced by the selected number of resonant modes, which need to be optimized during the data processing, in addition to the length of the time response signal. Furthermore, the Pade approximation is applied to calculate light delay for embedded microring resonators from complex transmission spectra obtained by the Pade approximation from a FDTD output. The Prony and the GPOF methods cannot be applied to calculate the transmission spectra, because the transmission signal obtained by the FDTD simulation cannot be expressed as a sum of damped complex exponentials. (C) 2009 Optical Society of America

A Theory of Networks for Appxoimation and Learning

Learning an input-output mapping from a set of examples, of the type that many neural networks have been constructed to perform, can be regarded as synthesizing an approximation of a multi-dimensional function, that is solving the problem of hypersurface reconstruction. From this point of view, this form of learning is closely related to classical approximation techniques, such as generalized splines and regularization theory. This paper considers the problems of an exact representation and, in more detail, of the approximation of linear and nolinear mappings in terms of simpler functions of fewer variables. Kolmogorov's theorem concerning the representation of functions of several variables in terms of functions of one variable turns out to be almost irrelevant in the context of networks for learning. We develop a theoretical framework for approximation based on regularization techniques that leads to a class of three-layer networks that we call Generalized Radial Basis Functions (GRBF), since they are mathematically related to the well-known Radial Basis Functions, mainly used for strict interpolation tasks. GRBF networks are not only equivalent to generalized splines, but are also closely related to pattern recognition methods such as Parzen windows and potential functions and to several neural network algorithms, such as Kanerva's associative memory, backpropagation and Kohonen's topology preserving map. They also have an interesting interpretation in terms of prototypes that are synthesized and optimally combined during the learning stage. The paper introduces several extensions and applications of the technique and discusses intriguing analogies with neurobiological data.

A Connection Between GRBF and MLP

Both multilayer perceptrons (MLP) and Generalized Radial Basis Functions (GRBF) have good approximation properties, theoretically and experimentally. Are they related? The main point of this paper is to show that for normalized inputs, multilayer perceptron networks are radial function networks (albeit with a non-standard radial function). This provides an interpretation of the weights w as centers t of the radial function network, and therefore as equivalent to templates. This insight may be useful for practical applications, including better initialization procedures for MLP. In the remainder of the paper, we discuss the relation between the radial functions that correspond to the sigmoid for normalized inputs and well-behaved radial basis functions, such as the Gaussian. In particular, we observe that the radial function associated with the sigmoid is an activation function that is good approximation to Gaussian basis functions for a range of values of the bias parameter. The implication is that a MLP network can always simulate a Gaussian GRBF network (with the same number of units but less parameters); the converse is true only for certain values of the bias parameter. Numerical experiments indicate that this constraint is not always satisfied in practice by MLP networks trained with backpropagation. Multiscale GRBF networks, on the other hand, can approximate MLP networks with a similar number of parameters.

On the application of optimal control techniques in lossy fieldbuses

The performance of real-time networks is under continuous improvement as a result of several trends in the digital world. However, these tendencies not only cause improvements, but also exacerbates a series of unideal aspects of real-time networks such as communication latency, jitter of the latency and packet drop rate. This Thesis focuses on the communication errors that appear on such realtime networks, from the point-of-view of automatic control. Specifically, it investigates the effects of packet drops in automatic control over fieldbuses, as well as the architectures and optimal techniques for their compensation. Firstly, a new approach to address the problems that rise in virtue of such packet drops, is proposed. This novel approach is based on the simultaneous transmission of several values in a single message. Such messages can be from sensor to controller, in which case they are comprised of several past sensor readings, or from controller to actuator in which case they are comprised of estimates of several future control values. A series of tests reveal the advantages of this approach. The above-explained approach is then expanded as to accommodate the techniques of contemporary optimal control. However, unlike the aforementioned approach, that deliberately does not send certain messages in order to make a more efficient use of network resources; in the second case, the techniques are used to reduce the effects of packet losses. After these two approaches that are based on data aggregation, it is also studied the optimal control in packet dropping fieldbuses, using generalized actuator output functions. This study ends with the development of a new optimal controller, as well as the function, among the generalized functions that dictate the actuator’s behaviour in the absence of a new control message, that leads to the optimal performance. The Thesis also presents a different line of research, related with the output oscillations that take place as a consequence of the use of classic co-design techniques of networked control. The proposed algorithm has the goal of allowing the execution of such classical co-design algorithms without causing an output oscillation that increases the value of the cost function. Such increases may, under certain circumstances, negate the advantages of the application of the classical co-design techniques. A yet another line of research, investigated algorithms, more efficient than contemporary ones, to generate task execution sequences that guarantee that at least a given number of activated jobs will be executed out of every set composed by a predetermined number of contiguous activations. This algorithm may, in the future, be applied to the generation of message transmission patterns in the above-mentioned techniques for the efficient use of network resources. The proposed task generation algorithm is better than its predecessors in the sense that it is capable of scheduling systems that cannot be scheduled by its predecessor algorithms. The Thesis also presents a mechanism that allows to perform multi-path routing in wireless sensor networks, while ensuring that no value will be counted in duplicate. Thereby, this technique improves the performance of wireless sensor networks, rendering them more suitable for control applications. As mentioned before, this Thesis is centered around techniques for the improvement of performance of distributed control systems in which several elements are connected through a fieldbus that may be subject to packet drops. The first three approaches are directly related to this topic, with the first two approaching the problem from an architectural standpoint, whereas the third one does so from more theoretical grounds. The fourth approach ensures that the approaches to this and similar problems that can be found in the literature that try to achieve goals similar to objectives of this Thesis, can do so without causing other problems that may invalidate the solutions in question. Then, the thesis presents an approach to the problem dealt with in it, which is centered in the efficient generation of the transmission patterns that are used in the aforementioned approaches.

Théorèmes de point fixe et principe variationnel d'Ekeland

Le principe de contraction de Banach, qui garantit l'existence d'un point fixe d'une contraction d'un espace métrique complet à valeur dans lui-même, est certainement le plus connu des théorèmes de point fixe. Dans plusieurs situations concrètes, nous sommes cependant amenés à considérer une contraction qui n'est définie que sur un sous-ensemble de cet espace. Afin de garantir l'existence d'un point fixe, nous verrons que d'autres hypothèses sont évidemment nécessaires. Le théorème de Caristi, qui garantit l'existence d'un point fixe d'une fonction d'un espace métrique complet à valeur dans lui-même et respectant une condition particulière sur d(x,f(x)), a plus tard été généralisé aux fonctions multivoques. Nous énoncerons des théorèmes de point fixe pour des fonctions multivoques définies sur un sous-ensemble d'un espace métrique grâce, entre autres, à l'introduction de notions de fonctions entrantes. Cette piste de recherche s'inscrit dans les travaux très récents de mathématiciens français et polonais. Nous avons obtenu des généralisations aux espaces de Fréchet et aux espaces de jauge de quelques théorèmes, dont les théorèmes de Caristi et le principe variationnel d'Ekeland. Nous avons également généralisé des théorèmes de point fixe pour des fonctions qui sont définies sur un sous-ensemble d'un espace de Fréchet ou de jauge. Pour ce faire, nous avons eu recours à de nouveaux types de contractions; les contractions sur les espaces de Fréchet introduites par Cain et Nashed [CaNa] en 1971 et les contractions généralisées sur les espaces de jauge introduites par Frigon [Fr] en 2000.