Bound states of the Dirac equation for a class of effective quadratic plus inversely quadratic potentials

The Dirac equation is exactly solved for a pseudoscalar linear plus Coulomb-like potential in a two-dimensional world. This sort of potential gives rise to an effective quadratic plus inversely quadratic potential in a Sturm-Liouville problem, regardless the sign of the parameter of the linear potential, in sharp contrast with the Schrodinger case. The generalized Dirac oscillator already analyzed in a previous work is obtained as a particular case. (C) 2004 Elsevier B.V. All rights reserved.

Lattice constellations and codes from quadratic number fields

We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a two-dimensional (2-D) grid. In particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.

On non-ideal and non-linear portal frame dynamics analysis using Bogoliubov averaging method

We apply the Bogoliubov Averaging Method to the study of the vibrations of an elastic foundation, forced by a Non-ideal energy source. The considered model consists of a portal plane frame with quadratic nonlinearities, with internal resonance 1:2, supporting a direct current motor with limited power. The non-ideal excitation is in primary resonance in the order of one-half with the second mode frequency. The results of the averaging method, plotted in time evolution curve and phase diagrams are compared to those obtained by numerically integrating of the original differential equations. The presence of the saturation phenomenon is verified by analytical procedures.

Consequences of quadratic frictional force on the one dimensional bouncing ball model

Some dynamical properties of the one dimensional Fermi accelerator model, under the presence of frictional force are studied. The frictional force is assumed as being proportional to the square particle's velocity. The problem is described by use of a two dimensional non linear mapping, therefore obtained via the solution of differential equations. We confirm that the model experiences contraction of the phase space area and in special, we characterized the behavior of the particle approaching an attracting fixed point. © 2007 American Institute of Physics.

On switched control design of linear time-invariant systems with polytopic uncertainties

This paper proposes a new switched control design method for some classes of linear time-invariant systems with polytopic uncertainties. This method uses a quadratic Lyapunov function to design the feedback controller gains based on linear matrix inequalities (LMIs). The controller gain is chosen by a switching law that returns the smallest value of the time derivative of the Lyapunov function. The proposed methodology offers less conservative alternative than the well-known controller for uncertain systems with only one state feedback gain. The control design of a magnetic levitator illustrates the procedure. © 2013 Wallysonn A. de Souza et al.

Um método previsor-corretor primal-dual de pontos interiores barreira logarítmica modificada, com estratégias de convergência global e de ajuste cúbico, para problemas de programação não-linear e não-convexa

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

PRODUCTIVITY OF CANE SUGAR: LINEAR AND SPATIAL VARIABILITY BETWEEN COMPONENTS AND TECHNOLOGICAL PRODUCTION

Nowadays, the culture of the sugarcane plays an important role regarding the Brazilian reality, especially in the aspect related to the alternative energy sources. In 2009, the municipality of Suzanapolis (SP), in the Brazilian Cerrado, an experiment was conducted with the culture of the sugarcane in a Red eutrophic, with the aim of selecting, using Pearson correlation coefficients, modeling, simple, linear and multiple regressions and spatial correlation, and also the best technological and productive components, to explain the variability of the productivity of the sugarcane. The geostatistical grid was installed in order to collect the data, with 120 sampling points, in an area of 14.53 ha. For the simple linear regressions, the plants population is the component of production that presents the best quadratic correlation with the productivity of the sugarcane, given by: PRO = -0.553**xPOP(2)+16.14*xPOP-15.77. However, for multiple linear regressions, the equation PRO = -21.11+4.92xPOP**+0.76xPUR** is the one that best presents in order to estimate that productivity. Spatially, the best correlation with yield of the sugarcane is also determined by the component of the production population of plants.

Análise não linear de chapas através de uma formulação do método dos elementos de contorno com convergência quadrática

Pós-graduação em Engenharia Civil - FEIS

Optimal mean-variance control for discrete-time linear systems with Markovian jumps and multiplicative noises

In this paper, we consider the stochastic optimal control problem of discrete-time linear systems subject to Markov jumps and multiplicative noises under two criteria. The first one is an unconstrained mean-variance trade-off performance criterion along the time, and the second one is a minimum variance criterion along the time with constraints on the expected output. We present explicit conditions for the existence of an optimal control strategy for the problems, generalizing previous results in the literature. We conclude the paper by presenting a numerical example of a multi-period portfolio selection problem with regime switching in which it is desired to minimize the sum of the variances of the portfolio along the time under the restriction of keeping the expected value of the portfolio greater than some minimum values specified by the investor. (C) 2011 Elsevier Ltd. All rights reserved.

A new approach for modeling and control of nonlinear systems via norm-bounded linear differential inclusions

A systematic approach to model nonlinear systems using norm-bounded linear differential inclusions (NLDIs) is proposed in this paper. The resulting NLDI model is suitable for the application of linear control design techniques and, therefore, it is possible to fulfill certain specifications for the underlying nonlinear system, within an operating region of interest in the state-space, using a linear controller designed for this NLDI model. Hence, a procedure to design a dynamic output feedback controller for the NLDI model is also proposed in this paper. One of the main contributions of the proposed modeling and control approach is the use of the mean-value theorem to represent the nonlinear system by a linear parameter-varying model, which is then mapped into a polytopic linear differential inclusion (PLDI) within the region of interest. To avoid the combinatorial problem that is inherent of polytopic models for medium- and large-sized systems, the PLDI is transformed into an NLDI, and the whole process is carried out ensuring that all trajectories of the underlying nonlinear system are also trajectories of the resulting NLDI within the operating region of interest. Furthermore, it is also possible to choose a particular structure for the NLDI parameters to reduce the conservatism in the representation of the nonlinear system by the NLDI model, and this feature is also one important contribution of this paper. Once the NLDI representation of the nonlinear system is obtained, the paper proposes the application of a linear control design method to this representation. The design is based on quadratic Lyapunov functions and formulated as search problem over a set of bilinear matrix inequalities (BMIs), which is solved using a two-step separation procedure that maps the BMIs into a set of corresponding linear matrix inequalities. Two numerical examples are given to demonstrate the effectiveness of the proposed approach.

Novel algorithms for electronic structure based molecular dynamics with linear system-size scaling

Die vorliegende Arbeit behandelt die Entwicklung und Verbesserung von linear skalierenden Algorithmen für Elektronenstruktur basierte Molekulardynamik. Molekulardynamik ist eine Methode zur Computersimulation des komplexen Zusammenspiels zwischen Atomen und Molekülen bei endlicher Temperatur. Ein entscheidender Vorteil dieser Methode ist ihre hohe Genauigkeit und Vorhersagekraft. Allerdings verhindert der Rechenaufwand, welcher grundsätzlich kubisch mit der Anzahl der Atome skaliert, die Anwendung auf große Systeme und lange Zeitskalen. Ausgehend von einem neuen Formalismus, basierend auf dem großkanonischen Potential und einer Faktorisierung der Dichtematrix, wird die Diagonalisierung der entsprechenden Hamiltonmatrix vermieden. Dieser nutzt aus, dass die Hamilton- und die Dichtematrix aufgrund von Lokalisierung dünn besetzt sind. Das reduziert den Rechenaufwand so, dass er linear mit der Systemgröße skaliert. Um seine Effizienz zu demonstrieren, wird der daraus entstehende Algorithmus auf ein System mit flüssigem Methan angewandt, das extremem Druck (etwa 100 GPa) und extremer Temperatur (2000 - 8000 K) ausgesetzt ist. In der Simulation dissoziiert Methan bei Temperaturen oberhalb von 4000 K. Die Bildung von sp²-gebundenem polymerischen Kohlenstoff wird beobachtet. Die Simulationen liefern keinen Hinweis auf die Entstehung von Diamant und wirken sich daher auf die bisherigen Planetenmodelle von Neptun und Uranus aus. Da das Umgehen der Diagonalisierung der Hamiltonmatrix die Inversion von Matrizen mit sich bringt, wird zusätzlich das Problem behandelt, eine (inverse) p-te Wurzel einer gegebenen Matrix zu berechnen. Dies resultiert in einer neuen Formel für symmetrisch positiv definite Matrizen. Sie verallgemeinert die Newton-Schulz Iteration, Altmans Formel für beschränkte und nicht singuläre Operatoren und Newtons Methode zur Berechnung von Nullstellen von Funktionen. Der Nachweis wird erbracht, dass die Konvergenzordnung immer mindestens quadratisch ist und adaptives Anpassen eines Parameters q in allen Fällen zu besseren Ergebnissen führt.

Using interior point algorithms for the solution of linear programs with special structural features

Linear Programming (LP) is a powerful decision making tool extensively used in various economic and engineering activities. In the early stages the success of LP was mainly due to the efficiency of the simplex method. After the appearance of Karmarkar's paper, the focus of most research was shifted to the field of interior point methods. The present work is concerned with investigating and efficiently implementing the latest techniques in this field taking sparsity into account. The performance of these implementations on different classes of LP problems is reported here. The preconditional conjugate gradient method is one of the most powerful tools for the solution of the least square problem, present in every iteration of all interior point methods. The effect of using different preconditioners on a range of problems with various condition numbers is presented. Decomposition algorithms has been one of the main fields of research in linear programming over the last few years. After reviewing the latest decomposition techniques, three promising methods were chosen the implemented. Sparsity is again a consideration and suggestions have been included to allow improvements when solving problems with these methods. Finally, experimental results on randomly generated data are reported and compared with an interior point method. The efficient implementation of the decomposition methods considered in this study requires the solution of quadratic subproblems. A review of recent work on algorithms for convex quadratic was performed. The most promising algorithms are discussed and implemented taking sparsity into account. The related performance of these algorithms on randomly generated separable and non-separable problems is also reported.

Quadratic behavior of fiber Bragg grating temperature coefficients

We describe the characterization of the temperature and strain responses of fiber Bragg grating sensors by use of an interferometric interrogation technique to provide an absolute measurement of the grating wavelength. The fiber Bragg grating temperature response was found to be nonlinear over the temperature range -70°C to 80°C. The nonlinearity was observed to be a quadratic function of temperature, arising from the linear dependence on temperature of the thermo-optic coefficient of silica glass over this range, and is in good agreement with a theoretical model.

Quadratic behaviour of fibre Bragg grating temperature coefficients

We describe the characterization of the temperature and strain responses of fiber Bragg grating sensors by use of an interferometric interrogation technique to provide an absolute measurement of the grating wavelength. The fiber Bragg grating temperature response was found to be nonlinear over the temperature range -70 °C to 80 °C. The nonlinearity was observed to be a quadratic function of temperature, arising from the linear dependence on temperature of the thermo-optic coefficient of silica glass over this range, and is in good agreement with a theoretical model.

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.