• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

ESSAYS ON THE ROLE OF UNOBSERVABLES IN CORPORATE STRATEGY

Nandialath, Anup Menon 24 September 2009 (has links)
No description available.
2

The Distance to Uncontrollability via Linear Matrix Inequalities

Boyce, Steven James 12 January 2011 (has links)
The distance to uncontrollability of a controllable linear system is a measure of the degree of perturbation a system can undergo and remain controllable. The definition of the distance to uncontrollability leads to a non-convex optimization problem in two variables. In 2000 Gu proposed the first polynomial time algorithm to compute this distance. This algorithm relies heavily on efficient eigenvalue solvers. In this work we examine two alternative algorithms that result in linear matrix inequalities. For the first algorithm, proposed by Ebihara et. al., a semidefinite programming problem is derived via the Kalman-Yakubovich-Popov (KYP) lemma. The dual formulation is also considered and leads to rank conditions for exactness verification of the approximation. For the second algorithm, by Dumitrescu, Şicleru and Ştefan, a semidefinite programming problem is derived using a sum-of-squares relaxation of an associated matrix-polynomial and the associated Gram matrix parameterization. In both cases the optimization problems are solved using primal-dual-interior point methods that retain positive semidefiniteness at each iteration. Numerical results are presented to compare the three algorithms for a number of benchmark examples. In addition, we also consider a system that results from a finite element discretization of the one-dimensional advection-diffusion equation. Here our objective is to test these algorithms for larger problems that originate in PDE-control. / Master of Science
3

A Practical Comprehensive Approach to PMU Placement for Full Observability

Altman, James Ross 27 March 2008 (has links)
In recent years, the placement of phasor measurement units (PMUs) in electric transmission systems has gained much attention. Engineers and mathematicians have developed a variety of algorithms to determine the best locations for PMU installation. But often these placement algorithms are not practical for real systems and do not cover the whole process. This thesis presents a strategy that is practical and addresses three important topics: system preparation, placement algorithm, and installation scheduling. To be practical, a PMU strategy should strive for full observability, work well within the heterogeneous nature of power system topology, and enable system planners to adapt the strategy to meet their unique needs and system configuration. Practical considerations for the three placement topics are discussed, and a specific strategy based on these considerations is developed and demonstrated on real transmission system models. / Master of Science

Page generated in 0.3294 seconds