Sekundärnavigation / Secondary navigation
Inhaltsbereich / Content
12 entries found

01. December13:30  15:00
Location: 48210Graduate SchoolWlazlo, Jaroslaw: Elastic Image Registration with Strong Mass Preserving Constraints
Category: Disputationen, Graduate School 
01. December13:45  15:15
Location: Fraunhofer ITWM, Z03.07Graduate SchoolGrün, Sarah: Discrete Dividends: Modeling, Estimation and Portfolio Optimization
Category: Disputationen, Graduate School 
05. December15:30  17:00
Location: 48436AG Algebra, Geometrie und ComputeralgebraDan Roche/US Naval Academy Annapolis: nteger Polynomial Sparse Interpolation with NearOptimal Complexity
We investigate algorithms to discover the nonzero coefficients and exponents of an unknown sparse polynomial, provided a way to evaluate the polynomial over any modular ring. This problem has been of interest to the computer algebra community for decades, and its uses include multivariate
polynomial GCD computation, factoring, and sparse polynomial arithmetic. Starting with the early works of Zippel, BenOr and Tiwari, and Kaltofen, one line of investigation has a key advantage in achieving the minimal number of evaluations of the polynomial, and has received considerable attention and improvements over the years. It is closely related to problems in coding theory and exponential analysis. The downside, however, is that these methods are not polynomialtime over arbitrary fields. A separate line of work starting with Garg and Schost and continuing with a few papers by the speaker and coauthors, has developed a different approach that works over any finite field. After years of improvements, the
complexity of both approaches over ZZ[x] is currently the same. They scale well in most aspects except for the degree; the bit complexity in both cases is currently cubic in the bitlengths of the exponents. By careful combination of the techniques in both approaches and a few new tricks, we are now able to overcome this hurdle. We present an algorithm whose running time is softlylinear in the size of the output and performs nearly the minimal number of evaluations of the unknown polynomial. Preliminary
implementation results indicate good promise for practical use when the unknown polynomial has a moderate number of variables and/or large exponents. 
07. December15:30  17:00
Location: 48538AG TechnomathematikIrina Kashuba/University of Sao Paulo: Indecomposable Modules over Jordan Superalgebras.
Category: AG TechnomathematikIn this talk we plan to give a survey of both classical and recent results obtained
in the representation theory of Jordan algebras and superalgebras. Further we
will construct indecomposable representations of both Kantor double superalgebra
Kan(n), n 1 and the Jordan superalgebra of symmetric elements JP2. Our
main tool is the famous TitsKantorKoecher construction. The representations
are given in terms of Ext quiver algebra of the category of representations with
the short grading over certain Lie superalgebra. This is joint result with Vera
Serganova. 
07. December17:00  18:00
Location: 48436AG Algebra, Geometrie und ComputeralgebraEmilio Rotilio, TU Kaiserslautern: Lie Superalgebras in Physics
The current understanding of nature finds in the „Standard Model“ the most complete and verified theory (for now). The mathematics it involves heavily relies on Lie theory (Lie groups and Lie algebras). To better describe the universe, phisicists have come up with a „Supersymmetry“ theory (among others). This theory is described in terms of Lie superalgebras. The goal of this talk is to give an overview of which Lie algebras/superalgebras are used in Physics and why they help describing nature.

12. December
Modellierungstag
Category: KOMMSModellierungstag am HohenstaufenGymnasium Kaiserslautern.

12. December17:15  18:30
Location: Raum 48210FachbereichProf. Dr. Peter Benner, MPI Magdeburg, "Feedback Stabilization of Unsteady Flow Problems"
Category: FelixKleinKolloquienOptimizing a trajectory of any unsteady problem in practice requires a
feedback strategy in order to attenuate disturbances, e.g., external
influences or unmodeled dynamics, that would lead to a deviation from
the desired, and possibly optimized, path. In this talk, we consider the
unsteady incompressible 2D NavierStokes equations and discuss their
feedback stabilization using Riccatitype controllers based on the
Dirichlet boundary control problem for the flow field. Numerical
methods to solve the resulting largescale, descriptortype algebraic
Riccati equations will be discussed. Their performance will be
illustrated by numerical experiments. 
14. December11:30  12:15
Location: 32349Prof. C. Schillings, Univ. Mannheim, Uncertainty Quantification for Inverse Problems
Category: AG TechnomathematikUncertainty Quantification (UQ) is an interesting, fast growing research area aimed at developing methods to address the impact of parameter, data and model uncertainty in complex systems. In this talk we will focus on the identification of parameters through observations of the response of the system – the inverse problem. The uncertainty in the solution of the inverse problem will be described via the Bayesian approach. In cases, where the model evaluations are prohibitively expensive, ad hoc methods such as the Ensemble Kalman Filter (EnKF) for inverse problems are widely and successfully used by practitioners in order to approximate the solution of the Bayesian problem.
The low computational costs, the straightforward implementation and their nonintrusive nature make them appealing in various areas of application, but, on the downside, they are underpinned by very limited theoretical understanding. In this talk, we will discuss an analysis of the EnKF based on the continuous time scaling limits, whichallows to derive estimates on the longtime behaviour of the EnKF and, hence, provides insights into the convergence properties of the algorithm. In particular, we are interested in the properties of the EnKF for a fixed ensemble size. Results from various numerical experiments supporting the theoretical findings will be presented. 
14. December12:15  13:00
Location: 32349J. Kusch, KIT, An approximate Newton Smoothing Method for Shape Optimization
Category: AG TechnomathematikIn this talk, we derive a smoothing method for shape optimization in Stokes and NavierStokes flows. The smoothing routine automatically picks a spatially dependent smoothing parameter in such a way that the optimization process is accelerated, turning the smoothing routine into an approximate Newton method.
This task is achieved by analytically deriving the symbol of the Hessian for the Stokes equations. We numerically investigate the Hessian symbol for convective flows and demonstrate the applicability of the symbol for the NavierStokes equations.
The constructed preconditioner approximates the derived symbol using windowed Fourier transform and thereby accelerates the optimization process while yielding a smooth search direction. Due to the fact that the smoothing is performed locally, the method will identify areas in which a nonsmooth design is physically meaningful and will automatically turn off smoothing in these regions. 
14. December17:00  18:00
Location: 48436AG Algebra, Geometrie und Computer AlgebraStefano Sannella/University of Birmingham: Broué's conjecture and perverse equivalences
The representation theory of a finite group G over a field F of positive characteristic carries many questions that have not been answered yet. Most of them can be stated as global/local conjectures: in various forms, they state that the representation theory of G is somehow controlled by its plocal subgroups. Here we will mostly focus on one of these conjectures, Broué's Abelian Defect Group Conjecture, which might be considered as an attempt to give a structural explanation of what is actually connecting G and its local psubgroups in the abelian defect case. In particular, we explain how the strategy of looking for a perverse equivalence (a specific type of derived equivalence) works successfully in some cases and how this procedure is related to some DeligneLusztig varieties.