The asymptotic numbers of regular tournaments,Eulerian digraphs and Eulerian oriented graphs

LetRT(n), ED(n) andEOG(n) be the number of labelled regular tournaments, labelled loop-free simple Eulerian digraphs, and labelled Eulerian oriented simple graphs, respectively, onn vertices. Then, asn,, for any>0. The last two families of graphs are also enumerated by their numbers of edges. The proofs use the saddle point method applied to appropriaten-dimensional integrals.     

Monotone clones and the varieties they determine

A finite, nontrivial algebra is order-primal if its term functions are precisely the monotone functions for some order on the underlying set. We show that the prevariety generated by an order-primal algebra P is relatively congruence-distributive and that the variety generated by P is congruence-distributive if and only if it contains at most two non-ismorphic subdirectly irreducible algebras. We also prove that if the prevarieties generated by order-primal algebras P and Q are equivalent as categories, then the corresponding orders or their duals generate the same order variety. A large class of order-primal algebras is described each member of which generates a variety equivalent as a category to the variety determined by the six-element, bounded ordered set which is not a lattice. These results are proved by considering topological dualities with particular emphasis on the case where there is a monotone near-unanimity function.This research was carried out while the third author held a research fellowship at La Trobe University supported by ARGS grant B85154851. The second author was supported by a grant from the NSERC.     

Equiconvergence of some complex interpolatory polynomials

Summary Walsh showed the close relation between the Lagrange interpolant in then ^th roots of unity and the corresponding Taylor expansion for functions belonging to a certain class of analytic functions. Recent extensions of this phenomena to Hermite interpolation and other linear processes of interpolation have been surveyed in [3, 5]. Following a recent idea of L. Yuanren [7], we show how new relations between other linear operators can be derived which exhibit Walsh equiconvergence.Dedicated to R. S. Varga on the occasion of his sixtieth birthdayThese authors were supported by NSERC A3094     

Suboptimal Kronrod extension formulae for numerical quadrature

Summary We consider cases where the Stieltjes polynomial associated with a Gaussian quadrature formula has complex zeros. In such cases a Kronrod extension of the Gaussian rule does not exist. A method is described for modifying the Stieltjes polynomial so that the resulting polynomial has no complex zeros. The modification is performed in such a way that the Kronrod-type extension rule resulting from the addition of then+1 zeros of the modified Stieltjes polynomial to the original knots of the Gaussian rule has only slightly lower degree of precision than normally achieved when the Kronrod extension rule exists. As examples of the use of the method, we present some new formulae extending the classical Gauss-Hermite quadrature rules. We comment on the limited success of the method in extending Gauss-Laguerre rules and show that several modified extensions of the Gauss Gegenbauer formulae exist in cases where the standard Kronrod extension does not.     

The continuous solution of a functional equation of Abel

Summary The functional equation(x) + (y) = (xf(y) + yf(x)) (1) for the unknown functionsf, and mapping reals into reals appears in the title of N. H. Abel's paper [1] from 1827 and its differentiable solutions are given there. In 1900 D. Hilbert pointed to (1), and to other functional equations considered by Abel, in the second part of his fifth problem. He asked if these equations could be solved without, for instance, assumption of differentiability of given and unknown functions. Hilbert's question was recalled by J. Aczél in 1987, during the 25th International Symposium on Functional Equations in Hamburg-Rissen. In particular Aczél asked for all continuous solutions of (1). An answer to his question is contained in our paper. We determine all continuous functionsf: I ,: A _f (I × I) and: I that satisfy (1). HereI denotes a real interval containing 0 andA _f (x,y) := xf(y) + yf(x), x, y I. The list contains not only the differentiable solutions, implicitly described by Abel, but also some nondifferentiable ones.Applying some results of C. T. Ng and A. Járai we are able to obtain even a more general result. For instance, the assertion (i.e. the list of solutions) remains unchanged if we replace continuity of and by local boundedness of orf(0)I from above or below. Strengthening a bit the assumptions onf we can preserve a large part of the assertion requiring only the measurability of either orf(0)I.     

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     

Comparison theorems for weak splittings of bounded operators

Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502     

On a problem proposed by H. Braß concerning the remainder term in quadrature for convex functions

Summary We prove that the error inn-point Gaussian quadrature, with respect to the standard weight functionw1, is of best possible orderO(n ^–2) for every bounded convex function. This result solves an open problem proposed by H. Braß and published in the problem section of the proceedings of the 2. Conference on Numerical Integration held in 1981 at the Mathematisches Forschungsinstitut Oberwolfach (Hämmerlin 1982; Problem 2). Furthermore, we investigate this problem for positive quadrature rules and for general product quadrature. In particular, for the special class of Jacobian weight functionsw _, (x)=(1–x)(1+x), we show that the above result for Gaussian quadrature is not valid precisely ifw _, is unbounded.Dedicated to Prof. H. Braß on the occasion of his 55th birthday     

Error for the modified secant method

New error bounds for the modified secant method are provided. We show that our error estimates are better than the ones already existing in the literature, under similar assumptions.     

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).