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.     

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     

Quadratic Functionals with General Boundary Conditions

The purpose of this paper is to give the Reid ``Roundabout Theorem' for quadratic functionals with general boundary conditions. In particular, we describe the so-called coupled point and regularity condition introduced in [16] in terms of Riccati equation solutions. Accepted 27 February 1996     

Regularity of multiwavelets

The motivation for this paper is an interesting observation made by Plonka concerning the factorization of the matrix symbol associated with the refinement equation for B-splines with equally spaced multiple knots at integers and subsequent developments which relate this factorization to regularity of refinable vector fields over the real line. Our intention is to contribute to this train of ideas which is partially driven by the importance of refinable vector fields in the construction of multiwavelets. The use of subdivision methods will allow us to consider the problem almost entirely in the spatial domain and leads to exact characterizations of differentiability and Hölder regularity in arbitrary L _p spaces. We first study the close relationship between vector subdivision schemes and a generalized notion of scalar subdivision schemes based on bi-infinite matrices with certain periodicity properties. For the latter type of subdivision scheme we will derive criteria for convergence and Hölder regularity of the limit function, which mainly depend on the spectral radius of a bi-infinite matrix induced by the subdivision operator, and we will show that differentiability of the limit functions can be characterized by factorization properties of the subdivision operator. By switching back to vector subdivision we will transfer these results to refinable vectors fields and obtain characterizations of regularity by factorization and spectral radius properties of the symbol associated to the refinable vector field. Finally, we point out how multiwavelets can be generated from orthonormal refinable bi-infinite vector fields.