Riddling and invariance for discontinuous maps preserving Lebesgue measure

In this paper we use the mixture of topological and measure-theoretic dynamical approaches to consider riddling of invariant sets for some discontinuous maps of compact regions of the plane that preserve two-dimensional Lebesgue measure. We consider maps that are piecewise continuous and with invertible except on a closed zero measure set. We show that riddling is an invariant property that can be used to characterize invariant sets, and prove results that give a non-trivial decomposion of what we call partially riddled invariant sets into smaller invariant sets. For a particular example, a piecewise isometry that arises in signal processing (the overflow oscillation map), we present evidence that the closure of the set of trajectories that accumulate on the discontinuity is fully riddled. This supports a conjecture that there are typically an infinite number of periodic orbits for this system.

Set-valued Markov chains and negative semitrajectories of discretized dynamical systems

Computer simulation of dynamical systems involves a phase space which is the finite set of machine arithmetic. Rounding state values of the continuous system to this grid yields a spatially discrete dynamical system, often with different dynamical behaviour. Discretization of an invertible smooth system gives a system with set-valued negative semitrajectories. As the grid is refined, asymptotic behaviour of the semitrajectories follows probabilistic laws which correspond to a set-valued Markov chain, whose transition probabilities can be explicitly calculated. The results are illustrated for two-dimensional dynamical systems obtained by discretization of fractional linear transformations of the unit disc in the complex plane.

Effective cell-centred time-domain Maxwell's equations numerical solvers

This research work analyses techniques for implementing a cell-centred finite-volume time-domain (ccFV-TD) computational methodology for the purpose of studying microwave heating. Various state-of-the-art spatial and temporal discretisation methods employed to solve Maxwell's equations on multidimensional structured grid networks are investigated, and the dispersive and dissipative errors inherent in those techniques examined. Both staggered and unstaggered grid approaches are considered. Upwind schemes using a Riemann solver and intensity vector splitting are studied and evaluated. Staggered and unstaggered Leapfrog and Runge-Kutta time integration methods are analysed in terms of phase and amplitude error to identify which method is the most accurate and efficient for simulating microwave heating processes. The implementation and migration of typical electromagnetic boundary conditions. from staggered in space to cell-centred approaches also is deliberated. In particular, an existing perfectly matched layer absorbing boundary methodology is adapted to formulate a new cell-centred boundary implementation for the ccFV-TD solvers. Finally for microwave heating purposes, a comparison of analytical and numerical results for standard case studies in rectangular waveguides allows the accuracy of the developed methods to be assessed. © 2004 Elsevier Inc. All rights reserved.

On the minimality of the p-harmonic map - x/vertical bar x vertical bar : B-n -> Sn-1

We prove that for any real number p with 1 p less than or equal to n - 1, the map x/\x\ : B-n --> Sn-1 is the unique minimizer of the p-energy functional integral(Bn) \delu\(p) dx among all maps in W-1,W-p (B-n, Sn-1) with boundary value x on phiB(n).

The polar ionosphere at Zhongshan Station on May 11, 1999, the day the solar wind almost disappeared

The solar wind almost disappeared on May 11,1999: the solar wind plasma density and' dynamic pressure were less than 1 cm(-3) and 0.1 nPa respectively, while the interplanetary magnetic field was northward. The polar ionospheric data observed by the multi-instruments at Zhongshan Station in Antarctica on such special event day was compared with those of the control day (May 14). It was shown that geomagnetic activity was very quiet on May 11 at Zhongshan. The magnetic pulsation, which usually occurred at about magnetic noon, did not appear. The ionosphere was steady and stratified, and the F-2 layer spread very little. The critical frequency of dayside F-2 layer, f(0)F(2), was larger than that of control day, and the peak of f(0)F(2) appeared 2 hours earlier. The ionospheric drift velocity was less than usual. There were intensive auroral E-s appearing at magnetic noon. All this indicates that the polar ionosphere was extremely quiet and geomagnetic field was much more dipolar on May 11. There were some signatures of auroral substorm before midnight, such as the negative deviation of the geomagnetic H component, accompanied with auroral E-s and weak Pc3 pulsation.

Calculating current densities and fields produced by shielded magnetic resonance imaging probes

A method is presented for computing the fields produced by radio frequency probes of the type used in magnetic resonance imaging. The effects of surrounding the probe with a shielding coil, intended to eliminate stray fields produced outside the probe, are included. An essential feature of these devices is the fact that the conducting rungs of the probe are of finite width relative to the coil radius, and it is therefore necessary to find the distribution of current within the conductors as part of the solution process. This is done here using a numerical method based on the inverse finite Hilbert transform, applied iteratively to the entire structure including its shielding coils. It is observed that the fields are influenced substantially by the width of the conducting rungs of the probe, since induced eddy currents within the rungs become more pronounced as their width is increased. The shield is also shown to have a significant effect on both the primary current density and the resultant fields. Quality factors are computed for these probes and compared with values measured experimentally.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.

On a theorem of Cooper

In this paper we study some purely mathematical considerations that arise in a paper of Cooper on the foundations of thermodynamics that was published in this journal. Connections with mathematical utility theory are studied and some errors in Cooper's paper are rectified. (C) 2001 Academic Press.