Isotropic random walks on affine buildings

In this paper we apply techniques of spherical harmonic analysis to prove a local limit theorem, a rate of escape theorem, and a central limit theorem for isotropic random walks on arbitrary thick regular affine buildings of irreducible type.Comment: To appear in Annales de l'Institut Fourie

Buildings and Hecke algebras

This paper investigates the connections between buildings and Hecke algebras through the combinatorial study of two algebras spanned by averaging operators on buildings. As a consequence we obtain a geometric and combinatorial description of certain Hecke algebras, and in particular of the Macdonald spherical functions and the center of affine Hecke algebras. The results of this paper are used in later work to study spherical harmonic analysis on affine buildings, and to study isotropic random walks on affine buildings

A Rotating-Grid Upwind Fast Sweeping Scheme for a Class of Hamilton-Jacobi Equations

We present a fast sweeping method for a class of Hamilton-Jacobi equations that arise from time-independent problems in optimal control theory. The basic method in two dimensions uses a four point stencil and is extremely simple to implement. We test our basic method against Eikonal equations in different norms, and then suggest a general method for rotating the grid and using additional approximations to the derivatives in different directions in order to more accurately capture characteristic flow. We display the utility of our method by applying it to relevant problems from engineering

Multi-objective optimisation of machine tool error mapping using automated planning

Error mapping of machine tools is a multi-measurement task that is planned based on expert knowledge. There are no intelligent tools aiding the production of optimal measurement plans. In previous work, a method of intelligently constructing measurement plans demonstrated that it is feasible to optimise the plans either to reduce machine tool downtime or the estimated uncertainty of measurement due to the plan schedule. However, production scheduling and a continuously changing environment can impose conflicting constraints on downtime and the uncertainty of measurement. In this paper, the use of the produced measurement model to minimise machine tool downtime, the uncertainty of measurement and the arithmetic mean of both is investigated and discussed through the use of twelve different error mapping instances. The multi-objective search plans on average have a 3% reduction in the time metric when compared to the downtime of the uncertainty optimised plan and a 23% improvement in estimated uncertainty of measurement metric when compared to the uncertainty of the temporally optimised plan. Further experiments on a High Performance Computing (HPC) architecture demonstrated that there is on average a 3% improvement in optimality when compared with the experiments performed on the PC architecture. This demonstrates that even though a 4% improvement is beneficial, in most applications a standard PC architecture will result in valid error mapping plan