53 resultados para Discrete boundary value problems
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The spectral principle of Connes and Chamseddine is used as a starting point to define a discrete model for Euclidean quantum gravity. Instead of summing over ordinary geometries, we consider the sum over generalized geometries where topology, metric, and dimension can fluctuate. The model describes the geometry of spaces with a countable number n of points, and is related to the Gaussian unitary ensemble of Hermitian matrices. We show that this simple model has two phases. The expectation value
Resumo:
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
A Maximum Principle is derived for a class of optimal control problems arising in midcourse guidance, in which certain controls are represented by measures and, the state trajectories are functions of bounded variation. The optimality conditions improves on previous optimality conditions by allowing nonsmooth data, measurable time dependence, and a possibly time varying constraint set for the conventional controls.
Efeitos Ambientais sobre Ganho de Peso no Período do Nascimento ao Desmame em Bovinos da Raça Nelore
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
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:
In this study, a given quasilinear problem is solved using variational methods. In particular, the existence of nontrivial solutions for GP is examined using minimax methods. The main theorem on the existence of a nontrivial solution for GP is detailed.
Resumo:
This paper addresses the H ∞ state-feedback control design problem of discretetime Markov jump linear systems. First, under the assumption that the Markov parameter is measured, the main contribution is on the LMI characterization of all linear feedback controllers such that the closed loop output remains bounded by a given norm level. This results allows the robust controller design to deal with convex bounded parameter uncertainty, probability uncertainty and cluster availability of the Markov mode. For partly unknown transition probabilities, the proposed design problem is proved to be less conservative than one available in the current literature. An example is solved for illustration and comparisons. © 2011 IFAC.
Resumo:
According to Peirce one of the most important philosophical problems is continuity. Consequently, he set forth an innovative and peculiar approach in order to elucidate at once its mathematical and metaphysical challenges through proper non-classical logical reasoning. I will restrain my argument to the definition of the different types of discrete collections according to Peirce, with a special regard to the phenomenon called premonition of continuity (Peirce, 1976, Vol. 3, p. 87, c. 1897). © 2012 Copyright Taylor and Francis Group, LLC.
Resumo:
The optimal reactive dispatch problem is a nonlinear programming problem containing continuous and discrete control variables. Owing to the difficulty caused by discrete variables, this problem is usually solved assuming all variables as continuous variables, therefore the original discrete variables are rounded off to the closest discrete value. This approach may provide solutions far from optimal or even unfeasible solutions. This paper presents an efficient handling of discrete variables by penalty function so that the problem becomes continuous and differentiable. Simulations with the IEEE test systems were performed showing the efficiency of the proposed approach. © 1969-2012 IEEE.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)