Existence of Solutions for Abstract Non-Autonomous Neutral Differential Equations

In this paper we discuss the existence of mild and classical solutions for a class of abstract non-autonomous neutral functional differential equations. An application to partial neutral differential equations is considered.

STRUCTURE AND BIFURCATION OF PULLBACK ATTRACTORS IN A NON-AUTONOMOUS CHAFEE-INFANTE EQUATION

The Chafee-Infante equation is one of the canonical infinite-dimensional dynamical systems for which a complete description of the global attractor is available. In this paper we study the structure of the pullback attractor for a non-autonomous version of this equation, u(t) = u(xx) + lambda(xx) - lambda u beta(t)u(3), and investigate the bifurcations that this attractor undergoes as A is varied. We are able to describe these in some detail, despite the fact that our model is truly non-autonomous; i.e., we do not restrict to 'small perturbations' of the autonomous case.

Pullback exponential attractors for evolution processes in Banach spaces: properties and applications

This article is a continuation of our previous work [5], where we formulated general existence theorems for pullback exponential attractors for asymptotically compact evolution processes in Banach spaces and discussed its implications in the autonomous case. We now study properties of the attractors and use our theoretical results to prove the existence of pullback exponential attractors in two examples, where previous results do not apply.

Analog circuit synthesis performing fast Pareto frontier exploration and analysis through 3D graphs

This paper presents a technique for performing analog design synthesis at circuit level providing feedback to the designer through the exploration of the Pareto frontier. A modified simulated annealing which is able to perform crossover with past anchor points when a local minimum is found which is used as the optimization algorithm on the initial synthesis procedure. After all specifications are met, the algorithm searches for the extreme points of the Pareto frontier in order to obtain a non-exhaustive exploration of the Pareto front. Finally, multi-objective particle swarm optimization is used to spread the results and to find a more accurate frontier. Piecewise linear functions are used as single-objective cost functions to produce a smooth and equal convergence of all measurements to the desired specifications during the composition of the aggregate objective function. To verify the presented technique two circuits were designed, which are: a Miller amplifier with 96 dB Voltage gain, 15.48 MHz unity gain frequency, slew rate of 19.2 V/mu s with a current supply of 385.15 mu A, and a complementary folded cascode with 104.25 dB Voltage gain, 18.15 MHz of unity gain frequency and a slew rate of 13.370 MV/mu s. These circuits were synthesized using a 0.35 mu m technology. The results show that the method provides a fast approach for good solutions using the modified SA and further good Pareto front exploration through its connection to the particle swarm optimization algorithm.