Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

Writhing instabilities of twisted rods: from infinite to finite length

We use three different approaches to describe the static spatial configurations of a twisted rod as well as its stability during rigid loading experiments. The first approach considers the rod as infinite in length and predicts an instability causing a jump to self-contact at a certain point of the experiment. Semi-finite corrections, taken into account as a second approach, reveal some possible experiments in which the configuration of a very long rod will be stable through out. Finally, in a third approach, we consider a rod of real finite length and we show that another type of instability may occur, leading to possible hysteresis behavior. As we go from infinite to finite length, we compare the different information given by the three approaches on the possible equilibrium configurations of the rod and their stability. These finite size effects studied here in a 1D elasticity problem could help us guess what are the stability features of other more complicated (2D elastic shells for example) problems for which only the infinite length approach is understood.     

The Geometry of the Newton Method on Non-Compact Lie Groups

An important class of optimization problems involve minimizing a cost function on a Lie group. In the case where the Lie group is non-compact there is no natural choice of a Riemannian metric and it is not possible to apply recent results on the optimization of functions on Riemannian manifolds. In this paper the invariant structure of a Lie group is exploited to provide a strong interpretation of a Newton iteration on a general Lie group. The paper unifies several previous algorithms proposed in the literature in a single theoretical framework. Local asymptotic quadratic convergence is proved for the algorithms considered.     

High-energy electron pair production on oxygen

Electron-positron pair production cross sections are calculated for 50-MeV electrons incident on an oxygen nucleus. The symmetric coplanar cross sections are emphasized. Neglecting exchange, the spectra of forward-scattered projectile electrons is numerically calculated. In the extreme relativistic and nonrelativistic limits for the produced pair kinetic energies, calculated cross sections are similar to those of Bhabha.     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.     

Large Discrepancy In Homogenous Quasi-Arithmetic Progressions

We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and gives a better bound on the discrepancy.     

Nonaqueous diazotization of 4-amino-3-arylisothiazole-5-carboxylate esters

4-Amino-3-arylisothiazole-5-carboxylate esters are converted to the corresponding desamino, chloro, bromo, and iodo esters by processes involving nonaqueous diazotization. These related procedures open up the possibility for the conversion of readily available heterocyclic ortho-amino esters and nitriles to related heterocyclic derivatives, which are not easily obtained by alternate routes.