An Interoperable Front Tracking Code and Applications to Various Scientific Problems

Speaker: 

Xiaolin Li

Institution: 

Dept. of Applied Math, SUNY

Time: 

Monday, October 30, 2006 - 4:00pm

Location: 

MSTB 254

We introduce an enhanced front tracking method and its software
implementation with an easy-to-use user interface. New algorithms
include conservative coupling in ND, locally grid based topological
bifurcation for 3D. Objective mathematical and computational
assessment are given with comparison to other interface methods
such as the level set method and volume of fluid method. We
emphasize the interoperability of front tracking with other
scientific software including the combined operation with AMR
and combustion packages.

Scientific applications include the study of turbulent mixing
due to acceleration driven instabilities, fuel injection jet,
shock flame interaction, extending to cell motion in biology.

This work is in collaboration with the FronTier Group at Stony Brook
University and Brookhaven National Laboratory

The Distribution Functions of Random Matrix Theory

Speaker: 

Professor Craig Tracy

Institution: 

UC Davis

Time: 

Thursday, November 30, 2006 - 4:00pm

Location: 

MSTB 254

It is now believed, but proved only in a few cases, that the distribution
functions
of random matrix theory are universal for a wide class of stochastic
problems in combinatorics,
growth processes, and statistics. These developments will be surveyed.
No prior knowledge
of random matrix theory will be assumed.

Isometric embedding of positive discs in $R^3$

Speaker: 

Professor Qing Han

Institution: 

University of Notre Dame

Time: 

Tuesday, October 3, 2006 - 4:00pm

Location: 

MSTB 254

In 1938, Alexandroff introduced a class of smooth metrics $g$ in the
unit disc $D\subset \mathbb R^2$ such that the Gauss curvature $K$ satisfies
$K>0$ in $D$, $K=0$ and $dK\neq 0$ on $\partial D$ and the total curvature of
$g$ in $D$ is $4\pi$. Alexandroff proved that such metrics are rigid, in the
sense that the isometric embedding of $(D, g)$ in $\mathbb R^3$ is unique up to
rigid body motions if it exists. It is easy to derive necessary conditions for
such metrics to be isometrically embedded in $\mathbb R^3$, among which the
geodesic curvature of the boundary is negative. We will prove that those
necessary conditions are also sufficient.

The proof is based on a discussion of elliptic Monge-Ampere equations which are
degenerate on the boundary. Because of the rigidity, boundary conditions cannot
be described. In fact, there is only one boundary condition which makes this
Monge-Ampere equation solvable.

Compressive Sampling

Speaker: 

Professor Emmanuel Candes

Institution: 

Caltech

Time: 

Thursday, November 9, 2006 - 4:00pm

Location: 

MSTB 254

Conventional wisdom and common practice in acquisition and
reconstruction of images from frequency data follows the basic
principle of the Nyquist density sampling theory. This principle
states that to reconstruct an image, the number of Fourier samples we
need to acquire must match the desired resolution of the image, i.e.
the number of pixels in the image.

This talk introduces a newly emerged sampling theory which shows that
this conventional wisdom is inaccurate. We show that perhaps
surprisingly, images or signals of scientific interest can be
recovered accurately and sometimes even exactly from a limited number
of nonadaptive random measurements. In effect, the talk introduces a
theory suggesting "the possibility of compressed data acquisition
protocols which perform as if it were possible to directly acquire
just the important information about the image of interest." In other
words, by collecting a comparably small number of measurements rather
than pixel values, one could in principle reconstruct an image with
essentially the same resolution as that one would obtain by measuring
all the pixels, a phenomenon with far reaching implications.

The reconstruction algorithms are very concrete, stable (in the sense
that they degrade smoothly as the noise level increases) and
practical; in fact, they only involve solving convenient convex
optimization programs. If time allows, I will discuss connections
with other fields such as statistics and coding theory.

Dynamics of HIV infection

Speaker: 

Dominik Wodarz

Institution: 

Biology, UCI

Time: 

Monday, October 23, 2006 - 4:00pm

Location: 

MSTB 254

I will discuss mathematical models that describe the in vivo
dynamics of HIV infection. Two aspects will be examined: (a) the early
interactions between HIV and the immune system during acute infection. This
is a very important phase that determines the long term course of the
disease and that can be modulated by anti-viral drug therapy. (b) Possible
reasons for the transition from the disease-free phase of the infection to
the development of AIDS, and possible reasons for why naturally infected
monkeys can carry persistent high virus loads without ever developing AIDS.
This will be discussed in the context of viral evolution in vivo, and how
this is affected by the ability of multiple HIV particles to infect the same
cell, a recent experimental discovery.

Tame polynomials and exponential sums

Speaker: 

Antonio Rojas-Leon

Institution: 

UCI

Time: 

Thursday, May 11, 2006 - 3:00pm

Location: 

MSTB 254

Given an arbitrary polynomial f in n variables over a finite field k, it is known that for a generic linear form l the exponential sum associated to f(x)+l(x) is pure. However, the proof is non-constructive and gives no explicit description of the set of such l's. In this talk we will give some results and conjectures related to the problem of giving an explicit geometric description of this set.

Localization for deterministic and multi-particle quantum systems

Speaker: 

victor Tchoulaevski

Institution: 

Universite de Reims, France

Time: 

Thursday, April 27, 2006 - 2:00pm

Location: 

MSTB 254

We prove an analog of Wegner's estimate for the density of states (DS)
in
finite
volumes for certain families of lattice Schrdinger operators (LSO) with
random potential
generated by a {\it deterministic } dynamical system. We call such
families
"Grand
Ensembles". The main assumption about the underlying dynamics is given in
terms of the
typical rate of returns to initial point, so it is very "mild" and general.
Although our
finite-volume estimates are much weaker than Wegner's estimate for
non-deterministic
potentials and do not imply regularity (or even existence) of the limiting
DS, they allow
to adapt the MSA by von Dreifus -- Klein to {\it generic } deterministic
LSO. While the
localization results are somewhat weaker than those by Bourgain --
Goldstein -- Schlag,
our proof is simpler, modulo existing MSA techniques.

In this talk, we also outline a new adaptation of the von Dreifus --
Klein MSA scheme to
localization in lattice systems of interacting quantum particles in common
external
random potential with independent values (joint project with Yu. Suhov,
Cambridge
University, UK). We believe that our method of Grand Ensembles applies as
well to
multi-particle systems in deterministic external potential.

Pages

Subscribe to UCI Mathematics RSS