Parallel and superfast algorithms for Hankel systems of equations

Summary Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n ²) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log² n) complexity asymptotically fast ones. All algorithms work without additional assumption (like strong nonsingularity).     

Tracking poles and representing Hankel operators directly from data

Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL ² fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL ² which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH , analytic, approximation toG relative to theL norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF     

Finding numerical solution of linear partial differential equations of first order with real coefficients

Applying Bittner's operational calculus we present a method to give approximate solutions of linear partial differential equations of first order

Variations on the theme of repeated distances

We give an asymptotically sharp estimate for the error term of the maximum number of unit distances determined byn points in ^{d, d}4. We also give asymptotically tight upper bounds on the total number of occurrences of the favourite distances fromn points in ^{d, d}4. Related results are proved for distances determined byn disjoint compact convex sets in ².At the time this paper was written, both authors were visiting the Technion — Israel Institute of Technology.     

An exact formula for the measure dimensions associated with a class of piecewise linear maps

An exact formula for the various measure dimensions of attractors associated with contracting similitudes is given. An example is constructed showing that for more general affine maps the various measure dimensions are not always equal.Communicated by Michael F. Barnsley.     

Hölder exponents and box dimension for self-affine fractal functions

We consider some self-affine fractal functions previously studied by Barnsleyet al. The graphs of these functions are invariant under certain affine scalings, and we extend their definition to allow the use of nonlinear scalings. The Hölder exponent,h, for these fractal functions is calculated and we show that there is a larger Hölder exponent,h , defined at almost every point (with respect to Lebesgue measure). For a class of such functions defined using linear affinities these exponents are related to the box dimensionD _B of the graph byh2–D _Bh .Communicated by Michael F. Barnsley.     

Product formulas and convolution structure for Fourier-Bessel series

One of the most far-reaching qualities of an orthogonal system is the presence of an explicit product formula. It can be utilized to establish a convolution structure and hence is essential for the harmonic analysis of the corresponding orthogonal expansion. As yet a convolution structure for Fourier-Bessel series is unknown, maybe in view of the unpractical nature of the corresponding expanding functions called Fourier-Bessel functions. It is shown in this paper that for the half-integral values of the parameter ,n=0, 1, 2,, the Fourier-Bessel functions possess a product formula, the kernel of which splits up into two different parts. While the first part is still the well-known kernel of Sonine's product formula of Bessel functions, the second part is new and reflects the boundary constraints of the Fourier-Bessel differential equation. It is given, essentially, as a finite sum over triple products of Bessel polynomials. The representation is explicit up to coefficients which are calculated here for the first two nontrivial cases and . As a consequence, a positive convolution structure is established for . The method of proof is based on solving a hyperbolic initial boundary value problem.Communicated by Tom H. Koornwinder.     

Sphere orders

Ann-sphere order is a finite partially ordered set representable by containment ofn-spheres in Euclidean (n+1)-space. We present a sequence {P _i } of ordered sets such that eachP _i is ann-sphere order only forni; one consequence is that we are able to determine the dimension of a Euclidean space-time manifold from the finite suborders of its causality order.Research supported by ONR grant N00014 85-K-0769.     

Heat “polynomials” for a singular differential operator on (0, ∞)

We generalize the theory of the heat polynomials introduced by P. V. Rosenbloom and D. V. Widder for a more general class of singular differential operator on (0, ). The heat polynomials associated with the Bessel operator and studied by D. T. Haimo appear as a particular case in this paper. In the special cases of second derivative and Bessel operators the heat polynomials are in fact polynomials inx andt, however, this property does not hold in general.Communicated by Tom. H. Koornwinder.     

Diagrams,orientations, and varieties

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called inversion, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations. AMS subject classifications (1980). 06A10, 05C75, 05C20.