Interpolation on Sparse Grids and Tensor Products of Nikol'skij–Besov Spaces

We investigate the order of convergence of periodic interpolation on sparse grids (blending interpolation) in the framework of tensor products of Nikol'skij–Besov spaces. To this end, we make use of the uniformity of the considered tensor norms and provide a unified approach to error estimates for the interpolation of univariate periodic functions from Nikol'skij–Besov spaces.     

Multiple Eigenvalues in Spectral Analysis for Solving QBD Processes

A number of authors have recently suggested solving quasi birth-and-death (QBD) processes through the use of eigenvalue-based methods. These methods take on a special form when there are multiple eigenvalues present. We investigate this problem in a general setting as well as in the context of a specific preemptive priority queueing model.      

A remark on polynomial function over finite commutative rings with identity

In the present paper, the degree of polynomial functions on a finite commutative ringR with identity is investigated. An upper bound for the degree is given (Theorem 3) with the help of a reduction formula for powers (Theorem 1).     

Interpolation of Morrey-Campanato and related smoothness spaces

We study the interpolation of Morrey-Campanato spaces and some smoothness spaces based on Morrey spaces, e. g., Besov-type and Triebel-Lizorkin-type spaces. Various interpolation methods, including the complex method, the ±-method and the Peetre-Gagliardo method, are studied in such a framework. Special emphasis is given to the quasi-Banach case and to the interpolation property.     

Über eine zum Kreisproblem verwandte Summe

An equivalent form of the classical circle problem is the unproved conjecture (3) . In this note the corresponding conjecture with _k (.) (the 1-periodic Bernoulli polynomials of orderk2) instead of ₁(.) is settled in an affirmative way (even with =0). Moreover, a generalized sum (6) is estimated by means of an analogue to a classical result due tovan der Corput.     

Polyhedral <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">2</Emphasis></Subscript>

 Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They coincide with the usual K-theoretic groups in the special case when the polytope is a unit simplex and can be thought of as compact/polytopal substitutes for the tame automorphism groups of polynomial algebras. Relative to the classical case, many new aspects have to be taken into account. We describe these groups explicitly when the underlying polytope is 2-dimensional. Already this low-dimensional case provides interesting classes of groups. Received: 13 December 2001 / Revised version: 24 June 2002 The second author was supported by the Deutsche Forschungsgemeinschaft, INTAS grant 99-00817 and TMR grant ERB FMRX CT-97-0107 Mathematics Subject Classification (2000): 14L27, 14M25, 19C09, 52B20     

A New Method for Finding the Characteristic Roots of E<Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>/E<Subscript><Emphasis Type="Italic">m</Emphasis></Subscript>/1 Queues

In 1953, Smith (Proc Camb Philos Soc 49:449–461, 1953), and, following him, Syski (1960) suggested a method to find the waiting time distribution for one server queues with Erlang-n arrivals and Erlang-m service times by using characteristic roots. Syski shows that these roots can be determined from a very simple equation, but an equation of degree n + m. Syski also shows that almost all of the characteristic roots are complex. In this paper, we derive a set of equations, one for each complex root, which can be solved by Newton’s method using real arithmetic. This method simplifies the programming logic because it avoids deflation and the subsequent polishing of the roots. Using the waiting time distribution, Syski then derived the distribution of the number in the system after a departure. E _n /E _m /1 queues can also formulated as quasi birth-death (QBD) processes, and in this case, the characteristic roots discussed by Syski are closely related to the eigenvalues of the QBD process. The QBD process provides information about the number in system at random times, but they are much more difficult to formulate and solve.