999 resultados para Evolution operators
Resumo:
In this article we prove new results concerning the existence and various properties of an evolution system U(A+B)(t, s)0 <= s <= t <= T generated by the sum -(A(t) + B(t)) of two linear, time-dependent, and generally unbounded operators defined on time-dependent domains in a complex and separable Banach space B. In particular, writing L(B) for the algebra of all linear bounded operators on B, we can express U(A+B)(t, s)0 <= s <= t <= T as the strong limit in C(8) of a product of the holomorphic contraction semigroups generated by -A (t) and - B(t), respectively, thereby proving a product formula of the Trotter-Kato type under very general conditions which allow the domain D(A(t) + B(t)) to evolve with time provided there exists a fixed set D subset of boolean AND(t is an element of)[0,T] D(A(t) + B(t)) everywhere dense in B. We obtain a special case of our formula when B(t) = 0, which, in effect, allows us to reconstruct U(A)(t, s)0 <=(s)<=(t)<=(T) very simply in terms of the semigroup generated by -A(t). We then illustrate our results by considering various examples of nonautonomous parabolic initial-boundary value problems, including one related to the theory of timedependent singular perturbations of self-adjoint operators. We finally mention what we think remains an open problem for the corresponding equations of Schrodinger type in quantum mechanics.
Resumo:
In this article dedicated to Professor V. Lakshmikantham on the occasion of the celebration of his 84th birthday, we announce new results concerning the existence and various properties of an evolution system UA+B(t, s)(0 <= s <= t <= T) generated by the sum -(A(t)+B(t)) of two linear, time-dependent and generally unbounded operators defined on time-dependent domains in a complex and separable Banach space B. In particular, writing G(B) for the algebra of all linear bounded operators on B, we can express UA+B(t, s)(0 <= s <= t <= T) as the strong limit in L(B) of a product of the holomorphic contraction semigroups generated by -A(t) and -B(t), thereby getting a product formula of the Trotter-Kato type under very general conditions which allow the domain D(A(t)+B(t)) to evolve with time provided there exists a fixed set D subset of boolean AND D-t epsilon[0,D-T](A(t)+B(t)) everywhere dense in B. We then mention several possible applications of our product formula to various classes of non-autonomous parabolic initial-boundary value problems, as well as to evolution problems of Schrodinger type related to the theory of time-dependent singular perturbations of self-adjoint operators in quantum mechanics. We defer all the proofs and all the details of the applications to a separate publication. (C) 2008 Elsevier Ltd. All rights reserved.
Resumo:
Motivated by the celebrated example of Y. Kannai of a linear partial differential operator which is hypoelliptic but not locally solvable, we consider it class of evolution operators with real-analytic coefficients and study their local solvability both in L(2) and in the weak sense. In order to do so we are led to propose a generalization of the Nirenberg-Treves condition (psi) which is suitable to our study. (C) 2009 Published by Elsevier Inc.
Resumo:
Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetic. The basic concept of GAs is designed to simulate processes in natural system necessary for evolution, specifically those that follow the principles first laid down by Charles Darwin of survival of the fittest. On the other hand, Particle swarm optimization (PSO) is a population based stochastic optimization technique inspired by social behavior of bird flocking or fish schooling. PSO shares many similarities with evolutionary computation techniques such as GAs. The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. PSO is attractive because there are few parameters to adjust. This paper presents hybridization between a GA algorithm and a PSO algorithm (crossing the two algorithms). The resulting algorithm is applied to the synthesis of combinational logic circuits. With this combination is possible to take advantage of the best features of each particular algorithm.
Resumo:
For a dynamical system defined by a singular Lagrangian, canonical Noether symmetries are characterized in terms of their commutation relations with the evolution operators of Lagrangian and Hamiltonian formalisms. Separate characterizations are given in phase space, in velocity space, and through an evolution operator that links both spaces. 2000 American Institute of Physics.
Resumo:
In order to study the connections between Lagrangian and Hamiltonian formalisms constructed from aperhaps singularhigher-order Lagrangian, some geometric structures are constructed. Intermediate spaces between those of Lagrangian and Hamiltonian formalisms, partial Ostrogradskiis transformations and unambiguous evolution operators connecting these spaces are intrinsically defined, and some of their properties studied. Equations of motion, constraints, and arbitrary functions of Lagrangian and Hamiltonian formalisms are thoroughly studied. In particular, all the Lagrangian constraints are obtained from the Hamiltonian ones. Once the gauge transformations are taken into account, the true number of degrees of freedom is obtained, both in the Lagrangian and Hamiltonian formalisms, and also in all the intermediate formalisms herein defined.
Resumo:
The RuskSkinner formalism was developed in order to give a geometrical unified formalism for describing mechanical systems. It incorporates all the characteristics of Lagrangian and Hamiltonian descriptions of these systems (including dynamical equations and solutions, constraints, Legendre map, evolution operators, equivalence, etc.). In this work we extend this unified framework to first-order classical field theories, and show how this description comprises the main features of the Lagrangian and Hamiltonian formalisms, both for the regular and singular cases. This formulation is a first step toward further applications in optimal control theory for partial differential equations. 2004 American Institute of Physics.
Resumo:
The objective of this thesis is to develop and generalize further the differential evolution based data classification method. For many years, evolutionary algorithms have been successfully applied to many classification tasks. Evolution algorithms are population based, stochastic search algorithms that mimic natural selection and genetics. Differential evolution is an evolutionary algorithm that has gained popularity because of its simplicity and good observed performance. In this thesis a differential evolution classifier with pool of distances is proposed, demonstrated and initially evaluated. The differential evolution classifier is a nearest prototype vector based classifier that applies a global optimization algorithm, differential evolution, to determine the optimal values for all free parameters of the classifier model during the training phase of the classifier. The differential evolution classifier applies the individually optimized distance measure for each new data set to be classified is generalized to cover a pool of distances. Instead of optimizing a single distance measure for the given data set, the selection of the optimal distance measure from a predefined pool of alternative measures is attempted systematically and automatically. Furthermore, instead of only selecting the optimal distance measure from a set of alternatives, an attempt is made to optimize the values of the possible control parameters related with the selected distance measure. Specifically, a pool of alternative distance measures is first created and then the differential evolution algorithm is applied to select the optimal distance measure that yields the highest classification accuracy with the current data. After determining the optimal distance measures for the given data set together with their optimal parameters, all determined distance measures are aggregated to form a single total distance measure. The total distance measure is applied to the final classification decisions. The actual classification process is still based on the nearest prototype vector principle; a sample belongs to the class represented by the nearest prototype vector when measured with the optimized total distance measure. During the training process the differential evolution algorithm determines the optimal class vectors, selects optimal distance metrics, and determines the optimal values for the free parameters of each selected distance measure. The results obtained with the above method confirm that the choice of distance measure is one of the most crucial factors for obtaining higher classification accuracy. The results also demonstrate that it is possible to build a classifier that is able to select the optimal distance measure for the given data set automatically and systematically. After finding optimal distance measures together with optimal parameters from the particular distance measure results are then aggregated to form a total distance, which will be used to form the deviation between the class vectors and samples and thus classify the samples. This thesis also discusses two types of aggregation operators, namely, ordered weighted averaging (OWA) based multi-distances and generalized ordered weighted averaging (GOWA). These aggregation operators were applied in this work to the aggregation of the normalized distance values. The results demonstrate that a proper combination of aggregation operator and weight generation scheme play an important role in obtaining good classification accuracy. The main outcomes of the work are the six new generalized versions of previous method called differential evolution classifier. All these DE classifier demonstrated good results in the classification tasks.
Resumo:
Inspired by the theory of semigroups of growth a, we construct an evolution process of growth alpha. The abstract theory is applied to study semilinear singular non-autonomous parabolic problems. We prove that. under natural assumptions. a reasonable concept of solution can be given to Such semilinear singularly non-autonomous problems. Applications are considered to non-autonomous parabolic problems in space of Holder continuous functions and to a parabolic problem in a domain Omega subset of R(n) with a one dimensional handle.
Resumo:
Evolution strategies are a class of general optimisation algorithms which are applicable to functions that are multimodal, nondifferentiable, or even discontinuous. Although recombination operators have been introduced into evolution strategies, the primary search operator is still mutation. Classical evolution strategies rely on Gaussian mutations. A new mutation operator based on the Cauchy distribution is proposed in this paper. It is shown empirically that the new evolution strategy based on Cauchy mutation outperforms the classical evolution strategy on most of the 23 benchmark problems tested in this paper. The paper also shows empirically that changing the order of mutating the objective variables and mutating the strategy parameters does not alter the previous conclusion significantly, and that Cauchy mutations with different scaling parameters still outperform the Gaussian mutation with self-adaptation. However, the advantage of Cauchy mutations disappears when recombination is used in evolution strategies. It is argued that the search step size plays an important role in determining evolution strategies' performance. The large step size of recombination plays a similar role as Cauchy mutation.
Resumo:
The current level of demand by customers in the electronics industry requires the production of parts with an extremely high level of reliability and quality to ensure complete confidence on the end customer. Automatic Optical Inspection (AOI) machines have an important role in the monitoring and detection of errors during the manufacturing process for printed circuit boards. These machines present images of products with probable assembly mistakes to an operator and him decide whether the product has a real defect or if in turn this was an automated false detection. Operator training is an important aspect for obtaining a lower rate of evaluation failure by the operator and consequently a lower rate of actual defects that slip through to the following processes. The Gage R&R methodology for attributes is part of a Six Sigma strategy to examine the repeatability and reproducibility of an evaluation system, thus giving important feedback on the suitability of each operator in classifying defects. This methodology was already applied in several industry sectors and services at different processes, with excellent results in the evaluation of subjective parameters. An application for training operators of AOI machines was developed, in order to be able to check their fitness and improve future evaluation performance. This application will provide a better understanding of the specific training needs for each operator, and also to accompany the evolution of the training program for new components which in turn present additional new difficulties for the operator evaluation. The use of this application will contribute to reduce the number of defects misclassified by the operators that are passed on to the following steps in the productive process. This defect reduction will also contribute to the continuous improvement of the operator evaluation performance, which is seen as a quality management goal.
Resumo:
Evolutionary meta-algorithms for pulse shaping of broadband femtosecond duration laser pulses are proposed. The genetic algorithm searching the evolutionary landscape for desired pulse shapes consists of a population of waveforms (genes), each made from two concatenated vectors, specifying phases and magnitudes, respectively, over a range of frequencies. Frequency domain operators such as mutation, two-point crossover average crossover, polynomial phase mutation, creep and three-point smoothing as well as a time-domain crossover are combined to produce fitter offsprings at each iteration step. The algorithm applies roulette wheel selection; elitists and linear fitness scaling to the gene population. A differential evolution (DE) operator that provides a source of directed mutation and new wavelet operators are proposed. Using properly tuned parameters for DE, the meta-algorithm is used to solve a waveform matching problem. Tuning allows either a greedy directed search near the best known solution or a robust search across the entire parameter space.
Resumo:
With particular reference to its role in the corporate real estate supply chain, this paper focuses on how the serviced office sector in the UK has evolved and changed over the last decade. A qualitative research approach involving 21 semi-structured interviews with corporate clients of serviced office operators was used to address a number of issues regarding the perceptions of users of serviced offices. It is concluded that the serviced office sector has become an established sector of the UK’s commercial real estate market providing an essential product for many corporate organisations. The serviced office sector has been relatively nimble and a range of operational models have emerged. It was found that corporate organisations use serviced office space and services in order to align workforce change with portfolio change, to transfer risk, for short-term project space, as temporary overflow space, to pilot a new location, to become familiar with a specific geographical marketplace or simply to gain an initial presence in an area.
Resumo:
A semiclassical approximation for an evolving density operator, driven by a `closed` Hamiltonian operator and `open` Markovian Lindblad operators, is obtained. The theory is based on the chord function, i.e. the Fourier transform of the Wigner function. It reduces to an exact solution of the Lindblad master equation if the Hamiltonian operator is a quadratic function and the Lindblad operators are linear functions of positions and momenta. Initially, the semiclassical formulae for the case of Hermitian Lindblad operators are reinterpreted in terms of a (real) double phase space, generated by an appropriate classical double Hamiltonian. An extra `open` term is added to the double Hamiltonian by the non-Hermitian part of the Lindblad operators in the general case of dissipative Markovian evolution. The particular case of generic Hamiltonian operators, but linear dissipative Lindblad operators, is studied in more detail. A Liouville-type equivariance still holds for the corresponding classical evolution in double phase space, but the centre subspace, which supports the Wigner function, is compressed, along with expansion of its conjugate subspace, which supports the chord function. Decoherence narrows the relevant region of double phase space to the neighbourhood of a caustic for both the Wigner function and the chord function. This difficulty is avoided by a propagator in a mixed representation, so that a further `small-chord` approximation leads to a simple generalization of the quadratic theory for evolving Wigner functions.
Resumo:
The von Neumann-Liouville time evolution equation is represented in a discrete quantum phase space. The mapped Liouville operator and the corresponding Wigner function are explicitly written for the problem of a magnetic moment interacting with a magnetic field and the precessing solution is found. The propagator is also discussed and a time interval operator, associated to a unitary operator which shifts the energy levels in the Zeeman spectrum, is introduced. This operator is associated to the particular dynamical process and is not the continuous parameter describing the time evolution. The pair of unitary operators which shifts the time and energy is shown to obey the Weyl-Schwinger algebra. (C) 1999 Elsevier B.V. B.V. All rights reserved.