HOPF BIFURCATION FROM LINES of EQUILIBRIA WITHOUT PARAMETERS IN MEMRISTOR OSCILLATORS

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

O problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree Problem (QMST) is a version of the Minimum Spanning Tree Problem in which, besides the traditional linear costs, there is a quadratic structure of costs. This quadratic structure models interaction effects between pairs of edges. Linear and quadratic costs are added up to constitute the total cost of the spanning tree, which must be minimized. When these interactions are restricted to adjacent edges, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). AQMST and QMST are NP-hard problems that model several problems of transport and distribution networks design. In general, AQMST arises as a more suitable model for real problems. Although, in literature, linear and quadratic costs are added, in real applications, they may be conflicting. In this case, it may be interesting to consider these costs separately. In this sense, Multiobjective Optimization provides a more realistic model for QMST and AQMST. A review of the state-of-the-art, so far, was not able to find papers regarding these problems under a biobjective point of view. Thus, the objective of this Thesis is the development of exact and heuristic algorithms for the Biobjective Adjacent Only Quadratic Spanning Tree Problem (bi-AQST). In order to do so, as theoretical foundation, other NP-hard problems directly related to bi-AQST are discussed: the QMST and AQMST problems. Bracktracking and branch-and-bound exact algorithms are proposed to the target problem of this investigation. The heuristic algorithms developed are: Pareto Local Search, Tabu Search with ejection chain, Transgenetic Algorithm, NSGA-II and a hybridization of the two last-mentioned proposals called NSTA. The proposed algorithms are compared to each other through performance analysis regarding computational experiments with instances adapted from the QMST literature. With regard to exact algorithms, the analysis considers, in particular, the execution time. In case of the heuristic algorithms, besides execution time, the quality of the generated approximation sets is evaluated. Quality indicators are used to assess such information. Appropriate statistical tools are used to measure the performance of exact and heuristic algorithms. Considering the set of instances adopted as well as the criteria of execution time and quality of the generated approximation set, the experiments showed that the Tabu Search with ejection chain approach obtained the best results and the transgenetic algorithm ranked second. The PLS algorithm obtained good quality solutions, but at a very high computational time compared to the other (meta)heuristics, getting the third place. NSTA and NSGA-II algorithms got the last positions

Suppressing grazing chaos in impacting system by structural nonlinearity

In this note we investigate the influence of structural nonlinearity of a simple cantilever beam impacting system on its dynamic responses close to grazing incidence by a means of numerical simulation. To obtain a clear picture of this effect we considered two systems exhibiting impacting motion, where the primary stiffness is either linear (piecewise linear system) or nonlinear (piecewise nonlinear system). Two systems were studied by constructing bifurcation diagrams, basins of attractions, Lyapunov exponents and parameter plots. In our analysis we focused on the grazing transitions from no impact to impact motion. We observed that the dynamic responses of these two similar systems are qualitatively different around the grazing transitions. For the piecewise linear system, we identified on the parameter space a considerable region with chaotic behaviour, while for the piecewise nonlinear system we found just periodic attractors. We postulate that the structural nonlinearity of the cantilever impacting beam suppresses chaos near grazing. (C) 2007 Elsevier Ltd. All rights reserved.

H2 and/or H∞-norm model reduction of uncertain discrete-time systems

This paper addresses the problem of model reduction for uncertain discrete-time systems with convex bounded (polytope type) uncertainty. A reduced order precisely known model is obtained in such a way that the H2 and/or the H∞ guaranteed norm of the error between the original (uncertain) system and the reduced one is minimized. The optimization problems are formulated in terms of coupled (non-convex) LMIs - Linear Matrix Inequalities, being solved through iterative algorithms. Examples illustrate the results.

Ciclos limites de sistemas lineares por partes

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Estudo de ciclos limites em sistemas diferenciais lineares por partes

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Estudo de sistemas lineares por parte com três zonas e aplicação na análise de um circuito elétrico envolvendo um memristor

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Conjuntos limite e bifurfações de campos de vetores suaves por partes no plano

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Equações com impasse e problemas de perturbação singular

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Ciclos limite em sistemas lineares por partes apresentando dois focos virtuais

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Conjuntos minimais de sistemas lineares por partes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Estabilidade de sistemas dinâmicos: Estudo do memristor

Pós-graduação em Matematica Aplicada e Computacional - FCT

Classificação de centros e estudo de ciclos limite para sistemas lineares por partes em duas zonas no plano

Pós-graduação em Matemática - IBILCE

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.

Finite element methods for the Stokes system based on a Zienkiewicz type N-simplex

Hermite interpolation is increasingly showing to be a powerful numerical solution tool, as applied to different kinds of second order boundary value problems. In this work we present two Hermite finite element methods to solve viscous incompressible flows problems, in both two- and three-dimension space. In the two-dimensional case we use the Zienkiewicz triangle to represent the velocity field, and in the three-dimensional case an extension of this element to tetrahedra, still called a Zienkiewicz element. Taking as a model the Stokes system, the pressure is approximated with continuous functions, either piecewise linear or piecewise quadratic, according to the version of the Zienkiewicz element in use, that is, with either incomplete or complete cubics. The methods employ both the standard Galerkin or the Petrov–Galerkin formulation first proposed in Hughes et al. (1986) [18], based on the addition of a balance of force term. A priori error analyses point to optimal convergence rates for the PG approach, and for the Galerkin formulation too, at least in some particular cases. From the point of view of both accuracy and the global number of degrees of freedom, the new methods are shown to have a favorable cost-benefit ratio, as compared to velocity Lagrange finite elements of the same order, especially if the Galerkin approach is employed.