Thursday, May 21, 2015 - 2:00pm - 2:50pm
Henry Pfister (Duke University)
This talk introduces a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, this method requires only that the codes are highly symmetric.
Wednesday, October 24, 2012 - 9:00am - 9:50am
Dirk Blömker (Universität Augsburg)
We consider a noisy observer
for an unknown solution u(t) of a deterministic model.
The observer is a stochastic model similar to the original one,
and it arises as a limit of frequent observations in filtering.
Here noisy observations of the low Fourier modes of u(t)
together with knowledge of the deterministic model are used to track
the unknown solution u(t).

In this talk
as an example we discuss the simple 3DVAR-filter and the deterministic
2D-Navier Stokes equation.
Subscribe to RSS - Deterministic