Optimisation can play a major role in improving the throughput of surface mount placement machines. Most previous work has reported on improving only the assembly cycle time. The movement of the feeder carrier and PCB table are not always factors which are minimised. In this paper we introduce a triple objective function with a Chebychev dynamic pick-and-place approach to optimise the sequentia...

The stability and dynamics of nonlinear Schrödinger superflows past a twodimensional disk are investigated using a specially adapted pseudo-spectral method based on mapped Chebychev polynomials. This efficient numerical method allows the imposition of both Dirichlet and Neumann boundary conditions at the disk border. Small coherence length boundary-layer approximations to stationary solutions a...

We study various approximation classes associated with m-term approximation by elements from a (possibly redundant) dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied respective...

The Gauss-Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well-suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...

It is fair to say that Riemannian geometry started with Gauss’s famous ”Disquisitiones generales” from 1827 in which one finds a rigorous discussion of what we now call the Gauss curvature of a surface. Much has been written about the importance and influence of this paper, see in particular the article [Do] by P.Dombrowski for a careful discussion of its contents and influence during that time...

The Gauss map of a smooth doubly{curved surface characterizes the range of variation of the surface normal as an area on the unit sphere. An algorithm to approximate the Gauss map boundary to any desired accuracy is presented, in the context of a tensor{product polynomial surface patch, r(u;v) for (u; v) 2 0; 1 ] 0; 1 ]. Boundary segments of the Gauss map correspond to variations of the normal ...