The goal of my sessions are to help attendees 'hit the ground running' by working through simple case studies with the MIT Uncertainty Quantification (MUQ) library. Those attending these sessions will be given interactive IPython notebooks to allow for hands-on experimentation. We will have one session on forward UQ, focused on Monte Carlo, poly...
Creator:
Parno, Matthew (Massachusetts Institute of Technology)
Created:
2015-06-16
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
In this talk, I will present an overview of the numerical models that have been developed during the last few years for the performance prediction of America's Cup yachts. Different aspects which characterize the behaviour of racing boats will be discussed, such as the role of the yacht appendages, the dynamical response of the yacht in calm and...
Creator:
Parolini, Nicola (Politecnico di Milano)
Created:
2011-03-07
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Potential games are a special class of games that allow for tractable dynamic analysis. Intuitively, games that are 'close' to a potential game should share similar properties. In this talk, we formalize and develop this idea by quantifying how the dynamical features of potential games extend to near-potential games. Towards this goal, we discus...
Creator:
Parrilo, Pablo A. (Massachusetts Institute of Technology)
Created:
2013-10-29
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
The Lovasz theta body TH(G) is a well-known relaxation of the stable setpolytope STAB(G) that is computable using semidefinite programming. Theseideas can be extended via sum of squares techniques to other combinatorialoptimization problems, providing a natural generalization of the theta bodyfor general polynomial ideals. In this talk we descri...
Creator:
Parrilo, Pablo A. (Massachusetts Institute of Technology)
Created:
2008-11-21
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
We consider nonnegative functions on abelian groups that are sparse with respect to the Fourier basis. We establish combinatorial conditions on subsets S and T of Fourier basis elements under which nonnegative functions with Fourier support S are sums of squares of functions with Fourier support T. Our combinatorial condition involves constructi...
Creator:
Parrilo, Pablo A. (Massachusetts Institute of Technology)
Created:
2015-05-18
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Sum of squares (SOS) programs are a particular class of convex optimizationproblems, that combine in a very appealing way notions from algebraic and numeric computation (in particular, semidefinite programming). They are based on the sum of squares decomposition for multivariate polynomials, and have found many interesting applications, mainly t...
Creator:
Parrilo, Pablo A. (Massachusetts Institute of Technology)
Created:
2006-10-26
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.