Sökning: "Semidefinite programming"

Hittade 3 uppsatser innehållade orden Semidefinite programming.

1. 1. Tsirelson's Bound : Introduction and Examples

   Kandidat-uppsats, Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)

   Författare :Amanda Kaarna; [2022]
   Nyckelord :Tsirelson s bound; Bell inequalities; The CHSH inequality; The I3322 inequality; Semidefinite programming;

   Sammanfattning : Tsirelson's bound is the upper bound for a Bell inequality which is valid for all quantum mechanical systems. We discuss why Tsirelson's bound was developed by looking at some historical arguments in quantum physics, such as the Einstein-Podolsky-Rosen (EPR) paradox, an argument for the quantum mechanical description of physical reality being incomplete, and local hidden variables. LÄS MER

3. 2. Improving the Robustness of Stockholm’s Metro System

   Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

   Författare :Hanna Gustavsson; Linnea Thorstensson; [2017]
   Nyckelord :;

   Sammanfattning : This study is evaluating and improving the robustness of the metro system in Stockholm. It is based on the existing metro system and by interpreting it as a network we can represent it in a mathematical graph. LÄS MER

4. 3. Digital Filter Design Using Semidefinite Programming

   Kandidat-uppsats, Göteborgs universitet/Institutionen för matematiska vetenskaper

   Författare :Moa Samuelsson; Jimmy Johansson; Fabian Samuelsson; [2015-02-11]
   Nyckelord :;

   Sammanfattning : Abstract This thesis explores an optimization based approach to the design problem of digital filters. We show how a digital filter in the form of a discrete linear time-invariant causal system can be characterized by a non-negative trigonometric polynomial, which in turn can be represented by a positive semidefinite matrix known as Gram matrix representation. LÄS MER