63 resultados para model reduction
em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"
Resumo:
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.
Resumo:
A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.
Resumo:
A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.
Resumo:
A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through linear matrix inequalities formulations. Examples illustrate the results.
Resumo:
The study of algorithms for active vibrations control in flexible structures became an area of enormous interest, mainly due to the countless demands of an optimal performance of mechanical systems as aircraft and aerospace structures. Smart structures, formed by a structure base, coupled with piezoelectric actuators and sensor are capable to guarantee the conditions demanded through the application of several types of controllers. This article shows some steps that should be followed in the design of a smart structure. It is discussed: the optimal placement of actuators, the model reduction and the controller design through techniques involving linear matrix inequalities (LMI). It is considered as constraints in LMI: the decay rate, voltage input limitation in the actuators and bounded output peak (output energy). Two controllers robust to parametric variation are designed: the first one considers the actuator in non-optimal location and the second one the actuator is put in an optimal placement. The performance are compared and discussed. The simulations to illustrate the methodology are made with a cantilever beam with bonded piezoelectric actuators.
Resumo:
We dimensionally reduce the ABJM model, obtaining a two-dimensional theory that can be thought of as a 'master action'. This encodes information about both T- and S-duality, i.e. describes fundamental (F1) and D-strings (D1) in 9 and 10 dimensions. The Higgsed theory at large VEV, (v) over tilde, and large k yields D1-brane actions in 9d and 10d, depending on which auxiliary fields are integrated out. For N = 1 there is a map to a Green-Schwarz string wrapping a nontrivial circle in C(4)/Z(k).
Resumo:
Toda lattice hierarchy and the associated matrix formulation of the 2M-boson KP hierarchies provide a framework for the Drinfeld-Sokolov reduction scheme realized through Hamiltonian action within the second KP Poisson bracket. By working with free currents, which Abelianize the second KP Hamiltonian structure, we are able to obtain a unified formalism for the reduced SL(M + 1, M - k) KdV hierarchies interpolating between the ordinary KP and KdV hierarchies. The corresponding Lax operators are given as superdeterminants of graded SL(M + 1, M - k) matrices in the diagonal gauge and we describe their bracket structure and field content. In particular, we provide explicit free field representations of the associated W(M, M - k) Poisson bracket algebras generalising the familiar nonlinear W-M+1 algebra. Discrete Backlund transformations for SL(M + 1, M - k) KdV are generated naturally from lattice translations in the underlying Toda-like hierarchy. As an application we demonstrate the equivalence of the two-matrix string model to the SL(M + 1, 1) KdV hierarchy.
Resumo:
The frequency spectrums are inefficiently utilized and cognitive radio has been proposed for full utilization of these spectrums. The central idea of cognitive radio is to allow the secondary user to use the spectrum concurrently with the primary user with the compulsion of minimum interference. However, designing a model with minimum interference is a challenging task. In this paper, a transmission model based on cyclic generalized polynomial codes discussed in [2] and [15], is proposed for the improvement in utilization of spectrum. The proposed model assures a non interference data transmission of the primary and secondary users. Furthermore, analytical results are presented to show that the proposed model utilizes spectrum more efficiently as compared to traditional models.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Spiking neural networks - networks that encode information in the timing of spikes - are arising as a new approach in the artificial neural networks paradigm, emergent from cognitive science. One of these new models is the pulsed neural network with radial basis function, a network able to store information in the axonal propagation delay of neurons. Learning algorithms have been proposed to this model looking for mapping input pulses into output pulses. Recently, a new method was proposed to encode constant data into a temporal sequence of spikes, stimulating deeper studies in order to establish abilities and frontiers of this new approach. However, a well known problem of this kind of network is the high number of free parameters - more that 15 - to be properly configured or tuned in order to allow network convergence. This work presents for the first time a new learning function for this network training that allow the automatic configuration of one of the key network parameters: the synaptic weight decreasing factor.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
This study investigates the utilisation of a simplified model in the transient analysis of a thermal cooling process. In such process the external thermal resistance between the surface and the surroundings is high compared to the system internal thermal resistance, so that the first controls the heat transfer process. In this case the Biot number is lower than 0.1. Aluminium reels were utilised, which, with proper internal instrumentation, furnished experimental results for the thermal cooling process. Based on experimental data, a simplified model for the determination of the process film coefficient was used. Subsequently, experimental and theoretical results were compared. The change of the airflow direction was also investigated for the cooling process, aiming at process time optimisation. (C) 2001 Elsevier B.V. Ltd.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)