An entropy-based uncertainty principle for a locally compact abelian group

We classify all functions on a locally compact, abelian group giving equality in an entropy inequality generalizing the Heisenberg Uncertainty Principle. In particular, for functions on a real line, we proof a conjecture of Hirschman published in 1957.     

Thinking and Turing's test

The questions raised by A. M. Turing in his paper on thought and machines are discussed. Human thought is considered in turn as a concept of normal language usage, as a basic concept of psychology, and as the basis of intellectual activity. It is concluded that neither of these notions of thought identifies something specific that a human being can or cannot do. The imitation game proposed by Turing for deciding whether a machine can think is found to result from an arbitrary empoverishment of the channel of communication between the interrogator and the item under investigation. Turing's notions of thinking are shown to lead to logical difficulties. An alternative view of consciousness, that would place it beyond the reach of any finite test, is finally discussed.     

Shell effects in the symmetric-modal fission of pre-actinide nuclei

Mass distributions of fragments in the low-energy fission of nuclei from ¹⁸⁷Ir to ²¹³At have been analysed. This analysis has shown that shell effects in symmetric-mode fragment mass yields from the fission of pre-actinide nuclei could be described if one assumes the existence of two strongly deformed neutron shells in the arising fragments with neutron numbers N₁ ≈ 52 and N₂ ≈ 68. A new method has been proposed for quantitatively describing the mass distributions of the symmetric fission mode for pre-actinides with A ≈ 180–220.     

A real algorithm for the Hermitian eigenvalue decomposition

Modifying complex plane rotations, we derive a new Jacobi-type algorithm for the Hermitian eigendecomposition, which uses only real arithmetic. When the fast-scaled rotations are incorporated, the new algorithm brings a substantial reduction in computational costs. The new method has the same convergence properties and parallelism as the symmetric Jacobi algorithm. Computational test results show that it produces accurate eigenvalues and eigenvectors and achieves great reduction in computational time.The work of this author was supported in part by the National Science Foundation grant CCR-8813493 and by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.The work of this author was supported in part by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.     

A note on minimization problems and multistep methods

Summary. We use the qualitative properties of the solution flow of the gradient equation to compute a local minimum of a real-valued function . Under the regularity assumption of all equilibria we show a convergence result for bounded trajectories of a consistent, strictly stable linear multistep method applied to the gradient equation. Moreover, we compare the asymptotic features of the numerical and the exact solutions as done by Humphries, Stuart (1994) and Schropp (1995) for one-step methods. In the case of -stable formulae this leads to an efficient solver for stiff minimization problems. Received July 10, 1995 / Revised version received June 27, 1996     

Vector potential theory on nonsmooth domains in R<Superscript>3</Superscript> and applications to electromagnetic scattering

We study boundary value problems for the time-harmonic form of the Maxwell equations, as well as for other related systems of equations, on arbitrary Lipschitz domains in the three-dimensional Euclidean space. The main goal is to develop the corresponding theory for L^p-integrable bounday data for optimal values of p's. We also discuss a number of relevant applications in electromagnetic scattering.