Thu, 11 Mar 2004

14:00 - 15:00
Rutherford Appleton Laboratory, nr Didcot

Structured matrix computations

Dr Francoise Tisseur
Abstract

We consider matrix groups defined in terms of scalar products. Examples of interest include the groups of

  • complex orthogonal,
  • real, complex, and conjugate symplectic,
  • real perplectic,
  • real and complex pseudo-orthogonal,
  • pseudo-unitary

matrices. We

  • Construct a variety of transformations belonging to these groups that imitate the actions of Givens rotations, Householder reflectors, and Gauss transformations.
  • Describe applications for these structured transformations, including to generating random matrices in the groups.
  • Show how to exploit group structure when computing the polar decomposition, the matrix sign function and the matrix square root on these matrix groups.

This talk is based on recent joint work with N. Mackey, D. S. Mackey, and N. J. Higham.

Mon, 08 Mar 2004
17:00
L1

Ideal Knots

Friedemann Schuricht
(Cologne)
Abstract

Let gamma be a closed knotted curve in R^3 such that the tubular

neighborhood U_r (gamma) with given radius r>0 does not intersect

itself. The length minimizing curve gamma_0 within a prescribed knot class is

called ideal knot. We use a special representation of curves and tools from

nonsmooth analysis to derive a characterization of ideal knots. Analogous

methods can be used for the treatment of self contact of elastic rods.

Mon, 08 Mar 2004
17:00
L3

TBA

Ian Grojnowski
(Cambridge)
Mon, 08 Mar 2004
15:45
DH 3rd floor SR

Weak interaction limits for one-dimensional random polymers

Remco van der Hofstad
(Technische Universiteit Eindhoven)
Abstract

Weakly self-avoiding walk (WSAW) is obtained by giving a penalty for every

self-intersection to the simple random walk path. The Edwards model (EM) is

obtained by giving a penalty proportional to the square integral of the local

times to the Brownian motion path. Both measures significantly reduce the

amount of time the motion spends in self-intersections.

The above models serve as caricature models for polymers, and we will give

an introduction polymers and probabilistic polymer models. We study the WSAW

and EM in dimension one.

We prove that as the self-repellence penalty tends to zero, the large

deviation rate function of the weakly self-avoiding walk converges to the rate

function of the Edwards model. This shows that the speeds of one-dimensional

weakly self-avoiding walk (if it exists) converges to the speed of the Edwards

model. The results generalize results earlier proved only for nearest-neighbor

simple random walks via an entirely different, and significantly more

complicated, method. The proof only uses weak convergence together with

properties of the Edwards model, avoiding the rather heavy functional analysis

that was used previously.

The method of proof is quite flexible, and also applies to various related

settings, such as the strictly self-avoiding case with diverging variance.

This result proves a conjecture by Aldous from 1986. This is joint work with

Frank den Hollander and Wolfgang Koenig.

Mon, 08 Mar 2004
14:15
DH 3rd floor SR

Brownian motion in a Weyl chamber

Philippe Biane
(Ecole Normale Superieure)
Abstract

We give a construction of Brownian motion in a Weyl chamber, by a

multidimensional generalisation of Pitman's theorem relating one

dimensional Brownian motion with the three dimensional Bessel

process. There are connections representation theory, especially to

Littelmann path model.

Thu, 04 Mar 2004

14:00 - 15:00
Comlab

Iteration between model and experiment in studying cardiac mechano-electric feedback: from clinics to channels, and back

Dr Peter Kohl
(University of Oxford)
Abstract

The heart can be described as an electrically driven mechanical pump. This

pump couldn't adapt to beat-by-beat changes in circulatory demand if there

was no feedback from the mechanical environment to the electrical control

processes. Cardiac mechano-electric feedback has been studied at various

levels of functional integration, from stretch-activated ion channels,

through mechanically induced changes in cardiac cells and tissue, to

clinically relevant observations in man, where mechanical stimulation of the

heart may either disturb or reinstate cardiac rhythmicity. The seminar will

illustrate the patho-physiological relevance of cardiac mechano-electric

feedback, introduce underlying mechanisms, and show the utility of iterating

between experimental research and mathematical modelling in studying this

phenomenon.

Mon, 01 Mar 2004
17:00
L1

Elliptic systems, integral functionals and singular sets

Guiseppe Mingione
(Parma)
Abstract

I shall give a brief overview of the partial regularity results for minima

of integral functionals and solutions to elliptic systems, concentrating my

attention on possible estimates for the Hausdorff dimension of the singular

sets; I shall also include more general variational objects called almost

minimizers or omega-minima. Open questions will be discussed at the end.

Mon, 01 Mar 2004
14:15
DH 3rd floor SR

Brownian motion in tubular neighborhoods around closed Riemannian submanifolds

Olaf Wittich
Abstract

We consider Brownian motion on a manifold conditioned not to leave

the tubular neighborhood of a closed riemannian submanifold up

to some fixed finite time. For small tube radii, it behaves like the

intrinsic Brownian motion on the submanifold coupled to some

effective potential that depends on geometrical properties of

the submanifold and of the embedding. This characterization

can be applied to compute the effect of constraining the motion of a

quantum particle on the ambient manifold to the submanifold.

Thu, 26 Feb 2004

14:00 - 15:00
Comlab

Symmetries in semidefinite programming, and how to exploit them

Prof Pablo Parrilo
(ETH Zurich)
Abstract

Semidefinite programming (SDP) techniques have been extremely successful

in many practical engineering design questions. In several of these

applications, the problem structure is invariant under the action of

some symmetry group, and this property is naturally inherited by the

underlying optimization. A natural question, therefore, is how to

exploit this information for faster, better conditioned, and more

reliable algorithms. To this effect, we study the associative algebra

associated with a given SDP, and show the striking advantages of a

careful use of symmetries. The results are motivated and illustrated

through applications of SDP and sum of squares techniques from networked

control theory, analysis and design of Markov chains, and quantum

information theory.

Tue, 24 Feb 2004
17:00
L3

CANCELLED

Graham Vincent-Smith
(Oxford)
Mon, 23 Feb 2004
17:00
L1

Adaptive finite elements for relaxed methods (FERM) in computational microstructures

Carsten Carstensen
(Bristol)
Abstract
Nonconvex minimisation problems are encountered in many applications such as phase transitions in solids (1) or liquids but also in optimal design tasks (2) or micromagnetism (3). In contrast to rubber-type elastic materials and many other variational problems in continuum mechanics, the minimal energy may be not attained. In the sense of (Sobolev) functions, the non-rank-one convex minimisation problem (M) is ill-posed: As illustrated in the introduction of FERM, the gradients of infimising sequences are enforced to develop finer and finer oscillations called microstructures. Some macroscopic or effective quantities, however, are well-posed and the target of an efficient numerical treatment. The presentation proposes adaptive mesh-refining algorithms for the finite element method for the effective equations (R), i.e. the macroscopic problem obtained from relaxation theory. For some class of convexified model problems, a~priori and a~posteriori error control is available with an reliability-efficiency gap. Nevertheless, convergence of some adaptive finite element schemes is guaranteed. Applications involve model situations for (1), (2), and (3) where the relaxation is provided by a simple convexification.
Mon, 23 Feb 2004
15:45
DH 3rd floor SR

A polling system with 3 queues and 1 server
is a.s. periodic when transient:
dynamical and stochastic systems, and a chaos

Stanislav Volkov
(University of Bristol)
Abstract

We consider a queuing system with three queues (nodes) and one server.

The arrival and service rates at each node are such that the system overall

is overloaded, while no individual node is. The service discipline is the

following: once the server is at node j, it stays there until it serves all

customers in the queue.

After this, the server moves to the "more expensive" of the two

queues.

We will show that a.s. there will be a periodicity in the order of

services, as suggested by the behavior of the corresponding

dynamical systems; we also study the cases (of measure 0) when the

dynamical system is chaotic, and prove that then the stochastic one

cannot be periodic either.