Past

A strict adherence to threshold pivoting in the direct solution of symmetric indefinite problems can result in substantially more work and storage than forecast by an sparse analysis of the symmetric problem. One way of avoiding this is to use static pivoting where the data structures and pivoting sequence generated by the analysis are respected and pivots that would otherwise be very small are replaced by a user defined quantity. This can give a stable factorization but of a perturbed matrix.

The conventional way of solving the sparse linear system is then to use iterative refinement (IR) but there are cases where this fails to converge. We will discuss the use of more robust iterative methods, namely GMRES and its variant FGMRES and their backward stability when the preconditioning is performed by HSL_M57 with a static pivot option.

Several examples under Matlab will be presented.

In St Anne's College

Radial basis functions have been used for decades for the interpolation of scattered,

high-dimensional data. Recently they have attracted interest as methods for simulating

partial differential equations as well. RBFs do not require a grid or triangulation, they

offer the possibility of spectral accuracy with local refinement, and their implementation

is very straightforward. A number of theoretical and practical breakthroughs in recent years

has improved our understanding and application of these methods, and they are currently being

tested on real-world applications in shallow water flow on the sphere and tear film evolution

in the human eye.

In this talk, the convergence analysis of a class of weak approximations of

solutions of stochastic differential equations is presented. This class includes

recent approximations such as Kusuoka's moment similar families method and the

Lyons-Victoir cubature on Wiener Space approach. It will be shown that the rate

of convergence depends intrinsically on the smoothness of the chosen test

function. For smooth functions (the required degree of smoothness depends on the

order of the approximation), an equidistant partition of the time interval on

which the approximation is sought is optimal. For functions that are less smooth

(for example Lipschitz functions), the rate of convergence decays and the

optimal partition is no longer equidistant. An asymptotic rate of convergence

will also be presented for the Lyons-Victoir method. The analysis rests upon

Kusuoka-Stroock's results on the smoothness of the distribution of the solution

of a stochastic differential equation. Finally, the results will be applied to

the numerical solution of the filtering problem.

We consider multi-dimensional Gaussian processes and give a novel, simple and

sharp condition on its covariance (finiteness of its two dimensional rho-variation,

for some rho <2) for the existence of "natural" Levy areas and higher iterated

integrals, and subsequently the existence of Gaussian rough paths. We prove a

variety of (weak and strong) approximation results, large deviations, and

support description.

Rough path theory then gives a theory of differential equations driven by

Gaussian signals with a variety of novel continuity properties, large deviation

estimates and support descriptions generalizing classical results of

Freidlin-Wentzell and Stroock-Varadhan respectively.

(Joint work with Nicolas Victoir.)