Muonium hyperfine structure and hadronic effects

A new result for the hadronic vacuum polarization correction to the muonium hyperfine splitting (HFS) is presented: Delta nu(had - vp) = (0.233 +- 0.003) kHz. Compared with previous calculations, the accuracy is improved by using the latest data on e+e- -> hadrons. The status of the QED prediction for HFS is discussed

The new Magnetic Measurement System at the Advanced Photon Source

A new system for precise measurements of the field integrals and multipole components of the APS magnetic insertion devices is described. A stretched coil is used to measure magnetic field characteristics. The hardware includes a number of servomotors to move (translate or rotate) the coil and a fast data acquisition board to measure the coil signal. A PC under Linux is used as a control workstation. The user interface is written as a Tcl/tk script. The hardware is accessed from the script through a shared C-library. A description of the hardware system and the control program is given.Comment: 3 pages, 5 figures, paper 3271 submitted to ICALEPCS 2001 Conferenc

A modification of the Dewilde–van der Veen method for inversion of finite structured matrices

AbstractWe study a class of block structured matrices R={Rij}i,j=1N with a property that the solution of the corresponding system Rx=y of linear algebraic equations may be performed for O(N) arithmetic operations. In this paper for finite invertible matrices we analyze in detail factorization and inversion algorithms. These algorithms are related to those suggested by P.M. Dewilde and A.J. van der Veen (Time-varying Systems and Computations, Kluwer Academic Publishers, New York, 1998) for a class of finite and infinite matrices with a small Hankel rank. The algorithms presented here are more transparent and are a modification of the algorithms from the above reference. The approach and the proofs are essentially different from those in the above-mentioned reference. The paper contains also analysis of complexity and results of numerical experiments

Turbulent thermal diffusion of aerosols in geophysics and laboratory experiments

We discuss a new phenomenon of turbulent thermal diffusion associated with turbulent transport of aerosols in the atmosphere and in laboratory experiments. The essence of this phenomenon is the appearance of a nondiffusive mean flux of particles in the direction of the mean heat flux, which results in the formation of large-scale inhomogeneities in the spatial distribution of aerosols that accumulate in regions of minimum mean temperature of the surrounding fluid. This effect of turbulent thermal diffusion was detected experimentally. In experiments turbulence was generated by two oscillating grids in two directions of the imposed vertical mean temperature gradient. We used Particle Image Velocimetry to determine the turbulent velocity field, and an Image Processing Technique based on an analysis of the intensity of Mie scattering to determine the spatial distribution of aerosols. Analysis of the intensity of laser light Mie scattering by aerosols showed that aerosols accumulate in the vicinity of the minimum mean temperature due to the effect of turbulent thermal diffusion. Geophysical applications of the obtained results are discussed.Comment: 9 pages, 6 figures, revtex

Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations

AbstractThis paper presents explicit formulas and algorithms to compute the eigenvalues and eigenvectors of order-one-quasiseparable matrices. Various recursive relations for characteristic polynomials of their principal submatrices are derived. The cost of evaluating the characteristic polynomial of an N×N matrix and its derivative is only O(N). This leads immediately to several versions of a fast quasiseparable Newton iteration algorithm. In the Hermitian case we extend the Sturm property to the characteristic polynomials of order-one-quasiseparable matrices which yields to several versions of a fast quasiseparable bisection algorithm.Conditions guaranteeing that an eigenvalue of a order-one-quasiseparable matrix is simple are obtained, and an explicit formula for the corresponding eigenvector is derived. The method is further extended to the case when these conditions are not fulfilled. Several particular examples with tridiagonal, (almost) unitary Hessenberg, and Toeplitz matrices are considered.The algorithms are based on new three-term and two-term recurrence relations for the characteristic polynomials of principal submatrices of order-one-quasiseparable matrices R. It turns out that the latter new class of polynomials generalizes and includes two classical families: (i) polynomials orthogonal on the real line (that play a crucial role in a number of classical algorithms in numerical linear algebra), and (ii) the Szegö polynomials (that play a significant role in signal processing). Moreover, new formulas can be seen as generalizations of the classical three-term recurrence relations for the real orthogonal polynomials and of the two-term recurrence relations for the Szegö polynomials