Computations in choice groupoids

Defining achoice as a mapping of the subsets of a setX into their respective subsets, a one-to-one (and naturally) corresponding binary operation,sequential choice, is identified under which the power set ofX is closed as achoice groupoid. A complete logical diagram is given, exhibiting all the implications between conjunctions of the seven conditions: (1) idempotence, (2) consistency, (3) absorbence, and (4) homomorphism of a choice, and (5) commutativity, (6) associativity, and (7) path-independence of the corresponding sequential choice.     

On the continuity of midpoint hull convex set-valued functions

Summary The concept of hull convexity (midpoint hull convexity) for set-valued functions in vector spaces is examined. This concept, introduced by A. V. Fiacco and J. Kyparisis (Journal of Optimization Theory and Applications,43 (1986), 95–126), is weaker than one of convexity (midpoint convexity).The main result is a sufficient condition for a midpoint hull convex set-valued function to be continuous. This theorem improves a result obtained by K. Nikodem (Bulletin of the Polish Academy of Sciences, Mathematics,34 (1986), 393–399).     

Discrete Newton methods and iterated defect corrections

Summary In this paper we present a general theory for discrete Newton methods, iterated defect corrections via neighbouring problems and deferred corrections based on asymptotic expansions of the discretization error.Dedicated to Professor Dr. J. Weisinger on the occasion of his sixty-fifth birthday     

Fehlerabschätzungen für Koeffizienten von Exponentialsummen und Polynomen

Zusammenfassung Für Polynome und Exponentialsummen mit festen Frequenzen werden die Normäquivalenzkonstanten zwischen Parameterraum und Funktionenraum untersucht. Dies führt im Exponentialsummenfall auf Tschebyscheff-Exponentialsummen als Verallgemeinerung der Tschebyscheff-Polynome, wenn man nach numerisch praktikablen Strategien zur Fehlerabschätzung im Parameterraum sucht; für theoretische Zwecke wird eine Ungleichung von Markoff-Typ für Exponentialsummen hergeleitet. Im Falle der Polynome ergeben sich asymptotisch optimale Konstanten als Verschärfungen von Resultaten von Gautschi. Ferner wird eine elementare Herleitung der Normäquivalenzkonstanten für den Fall der Monombasis angegeben.

---

Error estimation in coefficients of exponential sums and polynomials

Summary Equivalence constants for the norms on parameter and function space are considered for both polynomials and exponential sums. In the latter case Chebyshev exponential sums are introduced as generalizations of the Chebyshev polynomials, providing a practical method for error estimation in parameter space. For theoretical purposes a Markoff-type inequality is proved. In the case of polynomials asymptotically optimal constants are derived, thus improving on earlier results of Gautschi. Furthermore, a simple construction of the equivalence constants for the monomial basis is included.

Diese Arbeit entstand als Studie Nr.2 des SFB 135 Ökosysteme auf Kalkgestein unter teiweiser Förderung durch die Deutsche Forschungsgemeinschaft. Die numerischen Rechnungen wurden auf der Rechenanlage der Gesellschaft für wissenschaftliche Datenverarbeitung in Göttingen durchgeführt     

On two methods for accelerating convergence of series

Summary The Euler-Knopp transformation and a recently considered transformation, effective for entire function of order 1, are applied to series involving completely monotonic coefficients. Some properties of the resulting series are analyzed; these include uniform convergence with respect to the index, a priori and a posteriori estimates of the remainder. For the latter transformation a compact recursive algorithm is established which enables one to make effective use of the transformation. To illustrate the effectiveness of the transformations three applications, with examples, are included.     

A Kantorovich-type convergence analysis for the Gauss-Newton-Method

Summary We present a (semilocal) Kantorovich-type convergence analysis for the Gauss-Newton-Method which reduces to the wellknown Newton-Kantorovich-Theorem for the Newton-Method in a natural way. Additionnally a classification of the nonlinear regression problem into adequate and not-adequate models is obtained.     

Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen

Brugesser and Mani proved that the boundary-complex of a convex polytope can be shelled. This result lead to McMullen's proof of the Upper-bound-conjecture. We show that the shellability of complexes has a close connection to the theory of stellar operations. Several results on special shelling procedures and on non-shellable complexes are obtained.     

A general module theoretic framework for vector M-Padé and matrix rational interpolation

A general module theoretic framework is used to solve several classical interpolation problems and generalizations thereof in a unified way. These problems are divided into two main families. The first family contains the classical linearized Padé, Padé-Hermite and M-Padé problems and the generalization to the vector M-Padé problem. The second family consists of the Padé problem, the scalar, vector and matrix rational interpolation problems. The solution method is straightforward, recursive and efficient. It can follow any path in the solution table even if this solution table is nonnormal (nonperfect). Reordering of the interpolation data is not required.     

A Nonlinear Problem Associated to the Motion of a Membrane

A nonlinear model associated to the motion of a membrane is considered as limit of a sequence of approximate models, for which a global existence and uniqueness theorem can be proved. The paper investigates the relationship between the solutions of the real and approximate models.     

Central limit theorem for shot noise fields

One investigates the asymptotic normality of integrals over unboundedly increasing sets of a random field, describing a shot noise in ^d ,d1. One shows how important here are roles played by the growth character of the considered sets and by the dimension d.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 177, pp. 28–36, 1989.     

Borel fibrations and G-spaces

Considering discrete groups G only, we present an elementary proof of the familiar equivalence of the category of G-spaces (with maps equivariant up to homotopy) and the category of Borel fibrations over BG.     

The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation

This paper presents the exact asymptotics of the steady state behavior of a broad class of single-node queueing systems. First we show that the asymptotic probability functions derived using large deviations theory are consistent (in a certain sense) with the result using dominant pole approximations. Then we present an exact asymptotic formula for the cumulative probability function of the queue occupancy and relate it to the cell loss ratio, an important performance measure for service systems such as ATM networks. The analysis relies on a new generalization of the Taylor coefficients of a complex function which we call characteristic coefficients. Finally we apply our framework to obtain new results for the M/D/1 system and for a more intricate multiclass M/D/n system.     

Previsible sets for hyperfinite filtrations

Summary Previsible (or predictable) stochastic processes are defined for any filtration over a probability space (Dellacherie and Meyer (1978), IV. 61). This technical definition gives previsible processes certain predictability properties such as not being able to oscillate in unison with martingale differentials. Thus previsibility has become one essential ingredient in The General Theory of Stochastic Processes.We show that previsible sets for Keisler's (1984) special hyperfinite filtration are given both combinatorially and by a left filtration. Keisler's scheme has many other interesting features.Our main technical tool is an extension of Henson's (1979) analysis of analytic sets and the standard part map.     

Algorithms for cardinal interpolation using box splines and radial basis functions

Summary We describe an algorithm for (bivariate) cardinal interpolation which can be applied to translates of basis functions which include box splines or radial basis functions. The algorithm is based on a representation of the Fourier transform of the fundamental interpolant, hence Fast Fourier Transform methods are available. In numerical tests the 4-directional box spline (transformed to the characteristical submodule of ²), the thin plate spline, and the multiquadric case give comparably equal and good results.     

Positivity and Stability for One-Sided Coupled Operator Matrices

Many evolutionary systems can be described by an abstract Cauchy problem governed by an operator matrix. Assuming this problem to be one-sided coupled and well-posed we study in this paper the positivity and the stability of the associated matrix semigroup. The abstract results are illustrated by several examples.     

On Dirichlet series satisfying Riemann's functional equation

Summary According to convention, Hamburger's theorem (1921) says-roughly-that Riemann's (s) is uniquely determined by its functional equation. In 1944 Hecke pointed out that there are two distinct versions of Hamburger's theorem. Hecke's remark has led me, in examining just how rough the convention is, to prove that, with a weakening of certain auxiliary conditions, there are infinitely many linearly independent solutions of Riemann's functional equation (Theorem 1). In Theorem 1, as in Hamburger's theorem, the weight parameter is 1/2. In Theorem 2 we obtain stronger results when this parameter is 2: a Mittag-Leffler theorem for Dirichlet series with functional equations.Oblatum 23-XII-1992 & 9-IX-1993Research supported in part by NSA/MSP Grant MDA 90-H-4025 To the memory of Martin Eichler     

Zur Stützpunktwahl beim Schnittverfahren der nichtlinearen Programmierung

Zusammenfassung In dem vonK. Kleibohm vorgeschlagenen Schnittverfahren der konvexen Programmierung ist die Wahl des Stützpunktes von großer Bedeutung. Die Untersuchung der für Stützebenen eingeführten Relation besser sowie des für dieses Schnittverfahren charakteristischen Ablösemechanismus für Stützebenen erlauben die Formulierung und Begründung zweier Forderungen zur Stützpunktwahl. Die Realisierung dieser Forderung führt zur Lösung eines Entscheidungsproblems.

---

Summary The efficiency of the cutting plane method of the convex programming suggested byK. Kleibohm may be increased by a skillful choice of the so-called Stützpunkt. The study of the relation besser, defined for supporting hyperplanes, as the study of the detach-mechanism of supporting hyperplanes characteristic for this cutting plane method will allow to formulate and propose two demands concerning the choice of the Stützpunkt. The realisation of these demands leads to the solution of a decision problem.

     

On the convergence of the multivariate “homogeneous”qd-algorithm

The convergence of columns in the univariateqd-algorithm to reciprocals of polar singularities of meromorphic functions has often proved to be very useful. A multivariateqd-algorithm was discovered in 1982 for the construction of the so-called homogeneous Padé approximants.In the first section we repeat the univariate convergence results. In the second section we summarize the homogeneous multivariateqd-algorithm. In the third section a multivariate convergence result is proved by combining results from the previous sections. This convergence result is compared with another theorem for the general order multivariateqdg-algorithm. The main difference lies in the fact that the homogeneous form detects the polar singularities pointwise while the general form detects them curvewise.     

Construction of Pseudorandom Binary Sequences Using Additive Characters

In earlier papers the authors studied finite pseudorandom binary sequences, and they constructed sequences with strong pseudorandom properties. In these earlier constructions multiplicative characters were used. In this paper a new construction is presented which utilizes properties of additive characters. These new sequences can be computed fast, they are well-distributed relative to arithmetic progressions and their correlations of small order are small, but the price paid for the fast computation is that the correlations of large order can be large.     

Schopenhauer's Prolegomenon to Fuzziness

Prolegomenon means something said in advance of something else. In this study, we posit that part of the work by Arthur Schopenhauer (1788–1860) can be thought of as a prolegomenon to the existing concept of fuzziness. His epistemic framework offers a comprehensive and surprisingly modern framework to study individual decision making and suggests a bridgeway from the Kantian program into the concept of fuzziness, which may have had its second prolegomenon in the work by Frege, Russell, Wittgenstein, Peirce and Black. In this context, Zadeh's seminal contribution can be regarded as the logical consequence of the Kant-Schopenhauer representation framework.