12:00
12:00
17:00
Regularity and qualitative properties for models of complex non-Newtonian fluids
Abstract
In the first part of the talk I will discuss existence and regularity results for models of complex non-Newtonian fluids containing liquid crystalline polymers. The main technical tool is related to an apriori logarithmic estimate for the 2D Navier-Stokes equations.
In the second part I will consider a simplified version of the system and describe some of its qualitative properties as well as the analytical challenges posed by its study.
The first part is joint work with P Constantin, Ch. Fefferman and E Titi.
15:45
Topology of moduli space III
Abstract
\\Common\dfs\htdocs\www\maintainers\reception\enb\abstracts\topology\mt06\tillmann.shtml
15:45
Randon tilings and random matrices
Abstract
\\common\dfs\htdocs\www\maintainers\reception\enb\abstracts\stochastic-analysis\mt06\johansson
14:15
Optimal stopping of one-dimensional Ito diffusions with applications to the timing of investment decisions
12:00
Heterotic Twistor Strings
Abstract
\\Common\dfs\htdocs\www\maintainers\reception\enb\abstracts\string-theory\mt06\skinner.shtml
14:15
14:00
FMRI Simulator : Computational model of imaging brain structure and function
10:00
16:30
Time-dependent modelling and asymptotic analysis of electro-chemical cells.
16:15
14:30
Convex quadratic semi-definite programming problem: algorithms and applications
Abstract
The talk starts with a general introduction of the convex
quadratic semidefinite programming problem (QSDP), followed by a number of
interesting examples arising from finance, statistics and computer sciences.
We then discuss the concept of primal nondegeneracy for QSDP and show that
some QSDPs are nondegenerate and others are not even under the linear
independence assumption. The talk then moves on to the algorithmic side by
introducing the dual approach and how it naturally leads to Newton's method,
which is quadratically convergent for degenerate problems. On the
implementation side of the Newton method, we stress that direct methods for
the linear equations in Newton's method are impossible simply because the
equations are quite large in size and dense. Our numerical experiments use
the conjugate gradient method, which works quite well for the nearest
correlation matrix problem. We also discuss difficulties for us to find
appropriate preconditioners for the linear system encountered. The talk
concludes in discussing some other available methods and some future topics.
12:00
10:00
14:00
12:00