Generalized Fractional Evolution Equation

2000 Mathematics Subject Classification: Primary 46F25, 26A33; Secondary: 46G20

On Generalized Models and Singular Products of Distributions in Colombeau Algebra G(R)

MSC 2010: 46F30, 46F10

Boundary conditions in the simplest model of linear and second harmonic magneto-optical effects

This paper is concerned with linear and nonlinear magneto- optical effects in multilayered magnetic systems when treated by the simplest phenomenological model that allows their response to be represented in terms of electric polarization, The problem is addressed by formulating a set of boundary conditions at infinitely thin interfaces, taking into account the existence of surface polarizations. Essential details are given that describe how the formalism of distributions (generalized functions) allows these conditions to be derived directly from the differential form of Maxwell's equations. Using the same formalism we show the origin of alternative boundary conditions that exist in the literature. The boundary value problem for the wave equation is formulated, with an emphasis on the analysis of second harmonic magneto-optical effects in ferromagnetically ordered multilayers. An associated problem of conventions in setting up relationships between the nonlinear surface polarization and the fundamental electric field at the interfaces separating anisotropic layers through surface susceptibility tensors is discussed. A problem of self- consistency of the model is highlighted, relating to the existence of resealing procedures connecting the different conventions. The linear approximation with respect to magnetization is pursued, allowing rotational anisotropy of magneto-optical effects to be easily analyzed owing to the invariance of the corresponding polar and axial tensors under ordinary point groups. Required representations of the tensors are given for the groups infinitym, 4mm, mm2, and 3m, With regard to centrosymmetric multilayers, nonlinear volume polarization is also considered. A concise expression is given for its magnetic part, governed by an axial fifth-rank susceptibility tensor being invariant under the Curie group infinityinfinitym.

Gateaux complex differentiability and continuity

As is known, there are everywhere discontinuous infinitely Frechet differentiable functions on the real locally convex spaces D(R) and V(R) of finitely supported infinitely differentiable functions and, respectively, of generalized functions. In this paper the relationship between the complex differentiability and continuity of a function on a complex locally convex space is considered. We describe a class of complex locally convex spaces, which includes the complex space V(R), such that every Gateaux complex-differentiable function on a space of this class is continuous. We also describe another class of locally convex spaces, which includes the complex space D(R), such that on every space of this class there is an everywhere discontinuous infinitely Frechet complex-differentiable function whose derivatives are continuous.

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.

Colombeau's theory and shock wave solutions for systems of PDEs

In this article we study the existence of shock wave solutions for systems of partial differential equations of hydrodynamics with viscosity in one space dimension in the context of Colombeau's theory of generalized functions. This study uses the equality in the strict sense and the association of generalized functions (that is the weak equality). The shock wave solutions are given in terms of generalized functions that have the classical Heaviside step function as macroscopic aspect. This means that solutions are sought in the form of sequences of regularizations to the Heaviside function that have to satisfy part of the equations in the strict sense and part of the equations in the sense of association.

An existence theorem for an analytic first order PDE in the framework of Colombeau's theory

We study the existence of a holomorphic generalized solution u of the PDE[GRAPHICS]where f is a given holomorphic generalized function and (alpha (1),...alpha (m)) is an element of C-m\{0}.

Causal propagators for algebraic gauges

Applying the principle of analytic extension for generalized functions we derive causal propagators for algebraic non-covariant gauges. The so-generated manifestly causal gluon propagator in the light-cone gauge is used to evaluate two one-loop Feynman integrals which appear in the computation of the three-gluon vertex correction. The result is in agreement with that obtained through the usual prescriptions.

A Stieltjes approach to static hedges

Static hedging of complicated payoff structures by standard instruments becomes increasingly popular in finance. The classical approach is developed for quite regular functions, while for less regular cases, generalized functions and approximation arguments are used. In this note, we discuss the regularity conditions in the classical decomposition formula due to P. Carr and D. Madan (in Jarrow ed, Volatility, pp. 417–427, Risk Publ., London, 1998) if the integrals in this formula are interpreted as Lebesgue integrals with respect to the Lebesgue measure. Furthermore, we show that if we replace these integrals by Lebesgue–Stieltjes integrals, the family of representable functions can be extended considerably with a direct approach.

A generalized Hausdorff dimension for functions and sets

Let E be a compact subset of the n-dimensional unit cube, 1_n, and let C be a collection of convex bodies, all of positive n-dimensional Lebesgue measure, such that C contains bodies with arbitrarily small measure. The dimension of E with respect to the covering class C is defined to be the number

d_C(E) = sup(β:H_{β, C}(E) > 0),

where H_{β, C} is the outer measure

inf(Ʃm(C_i)^β:UC_i Ↄ E, C_i ϵ C) .

Only the one and two-dimensional cases are studied. Moreover, the covering classes considered are those consisting of intervals and rectangles, parallel to the coordinate axes, and those closed under translations. A covering class is identified with a set of points in the left-open portion, 1’_n, of 1_n, whose closure intersects 1_n - 1’_n. For n = 2, the outer measure H_{β, C} is adopted in place of the usual:

Inf(Ʃ(diam. (C_i))^β: UC_i Ↄ E, C_i ϵ C),

for the purpose of studying the influence of the shape of the covering sets on the dimension d_C(E).

If E is a closed set in 1₁, let M(E) be the class of all non-decreasing functions μ(x), supported on E with μ(x) = 0, x ≤ 0 and μ(x) = 1, x ≥ 1. Define for each μ ϵ M(E),

d_C(μ) = lim/c → inf/0 log ∆μ(c)/log c , (c ϵ C)

where ∆μ(c) = v/x (μ(x+c) – μ(x)). It is shown that

d_C(E) = sup (d_C(μ):μ ϵ M(E)).

This notion of dimension is extended to a certain class Ӻ of sub-additive functions, and the problem of studying the behavior of d_C(E) as a function of the covering class C is reduced to the study of d_C(f) where f ϵ Ӻ. Specifically, the set of points in 1₁,

(*) {d_B(F), d_C(f)): f ϵ Ӻ}

is characterized by a comparison of the relative positions of the points of B and C. A region of the form (*) is always closed and doubly-starred with respect to the points (0, 0) and (1, 1). Conversely, given any closed region in 1₂, doubly-starred with respect to (0, 0) and (1, 1), there are covering classes B and C such that (*) is exactly that region. All of the results are shown to apply to the dimension of closed sets E. Similar results can be obtained when a finite number of covering classes are considered.

In two dimensions, the notion of dimension is extended to the class M, of functions f(x, y), non-decreasing in x and y, supported on 1₂ with f(x, y) = 0 for x · y = 0 and f(1, 1) = 1, by the formula

d_C(f) = lim/s · t → inf/0 log ∆f(s, t)/log s · t , (s, t) ϵ C

where

∆f(s, t) = V/x, y (f(x+s, y+t) – f(x+s, y) – f(x, y+t) + f(x, t)).

A characterization of the equivalence d_C1(f) = d_C2(f) for all f ϵ M, is given by comparison of the gaps in the sets of products s · t and quotients s/t, (s, t) ϵ C_i (I = 1, 2).

Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagrams

Generalized neurofuzzy network modeling algorithms using Bezier-Bernstein polynomial functions and additive decomposition

This paper introduces a new neurofuzzy model construction algorithm for nonlinear dynamic systems based upon basis functions that are Bezier-Bernstein polynomial functions. This paper is generalized in that it copes with n-dimensional inputs by utilising an additive decomposition construction to overcome the curse of dimensionality associated with high n. This new construction algorithm also introduces univariate Bezier-Bernstein polynomial functions for the completeness of the generalized procedure. Like the B-spline expansion based neurofuzzy systems, Bezier-Bernstein polynomial function based neurofuzzy networks hold desirable properties such as nonnegativity of the basis functions, unity of support, and interpretability of basis function as fuzzy membership functions, moreover with the additional advantages of structural parsimony and Delaunay input space partition, essentially overcoming the curse of dimensionality associated with conventional fuzzy and RBF networks. This new modeling network is based on additive decomposition approach together with two separate basis function formation approaches for both univariate and bivariate Bezier-Bernstein polynomial functions used in model construction. The overall network weights are then learnt using conventional least squares methods. Numerical examples are included to demonstrate the effectiveness of this new data based modeling approach.

Exact Search Directions for Optimization of Linear and Nonlinear Models Based on Generalized Orthonormal Functions

A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of any order is presented. It is well-known that the usual large number of parameters required to describe the Volterra kernels can be significantly reduced by representing each kernel using an appropriate basis of orthonormal functions. Such a representation results in the so-called OBF Volterra model, which has a Wiener structure consisting of a linear dynamic generated by the orthonormal basis followed by a nonlinear static mapping given by the Volterra polynomial series. Aiming at optimizing the poles that fully parameterize the orthonormal bases, the exact gradients of the outputs of the orthonormal filters with respect to their poles are computed analytically by using a back-propagation-through-time technique. The expressions relative to the Kautz basis and to generalized orthonormal bases of functions (GOBF) are addressed; the ones related to the Laguerre basis follow straightforwardly as a particular case. The main innovation here is that the dynamic nature of the OBF filters is fully considered in the gradient computations. These gradients provide exact search directions for optimizing the poles of a given orthonormal basis. Such search directions can, in turn, be used as part of an optimization procedure to locate the minimum of a cost-function that takes into account the error of estimation of the system output. The Levenberg-Marquardt algorithm is adopted here as the optimization procedure. Unlike previous related work, the proposed approach relies solely on input-output data measured from the system to be modeled, i.e., no information about the Volterra kernels is required. Examples are presented to illustrate the application of this approach to the modeling of dynamic systems, including a real magnetic levitation system with nonlinear oscillatory behavior.