Sparse generalized Fourier transforms

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast. Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant matrix. By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method. A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are preserved. AMS subject classification (2000)  43A30, 65T99, 20B25     

A six-step synthesis of (S)-5-ethenyl-3-(1-methyl-2-pyrrolidinyl)pyridine (SIB-1508Y) from (S)-nicotine

The anti-Parkinson’s agent SIB-1508Y was prepared in six steps from (S)-nicotine in 20% overall yield. The strategy involves a regioselective formylation at C-5 of a 1,4-dihydronicotine intermediate.     

Synthesis and crystal structures of extremely crowded oligophenylenes as model precursors to ‘cubic graphite’

By using drastic conditions for a Diels-Alder cycloaddition reaction, it was possible to synthesize an oligophenylene with an extremely dense packing of the benzene rings. Crystallographic data could be obtained and a projection of the structure on the plane of the central phenyl ring reveals that the molecule retained its theoretical threefold symmetry with only minor deviations. Due to its dense packing of interlocked benzene rings, this oligophenylene could be furthermore used as a suitable precursor for constructing a subunit of ‘cubic graphite’.     

Birefringent filter with amplitude beats

In this work, we show a very simple birefringent filter useful to modulate a broadband light spectrum. We first show the generation of various oscillating spectra using two identical multiple-order waveplates. In particular a sinusoidal broadband spectrum with a rapid oscillation is obtained. This spectrum is amplitude modulated by adding another waveplate to the system. This waveplate has a small phase shift, and with the proper orientation generates amplitude beats on the broadband spectrum. Finally, we show how this system can be voltage controlled by means of a ferroelectric liquid crystal modulator. We experimentally demonstrate this behavior with the aid of a portable spectrophotometer, and we provide a theoretical explanation on the basis of the Jones matrix formalism.     

Optimality relationships forp-cyclic SOR

Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA     

Measurement of surface topography by RGB Shadow-Moiré with direct phase demodulation

In this paper we present the application of a direct demodulation method for the measurement of surface topography by means of Shadow-Moiré. In our set-up, we use three LEDs (with green, red and blue peak wavelengths) to illuminate the grating. Due to the different position of these light sources, a polychromatic Shadow-Moiré fringe pattern is produced, which can be described as the superposition of three monochromatic (red, green and blue) fringe patterns. Taking the image of this polychromatic fringe pattern with a RGB CCD camera, we get a monochromatic fringe pattern stored at each RGB channel of the CCD. The direct demodulation algorithm employed uses these fringe patterns to calculate the wrapped phase map. After unwrapping the phase map using a standard multi-grid technique, we implemented an automatic procedure to detect the area of interest of the phase map by removing low modulation zones and to calculate the absolute value of the phase. In this way it is possible to determine the topography of a surface with a single RGB snapshot maintaining a simple experimental set-up, which is an important feature, especially for the study of dynamic phenomena such as deformations. We present the experimental results obtained after measuring different objects with both smooth and rough surface textures.     

Some global results for eigenvalue problems governed by a variational inequality

In this paper, we use the Leray-Schauder degree theory to obtain some information about the structure of the solution set of a large class of eigenvalue problems governed by a variational inequality. Applications are given to the unilateral postbuckling of a thin elastic plate.     

Degree distribution of the greatest common divisor of polynomials over 𝔽q

We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??_q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006