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     

Polling systems with synchronization constraints

We introduce a new service discipline, called thesynchronized gated discipline, for polling systems. It arises when there are precedence (or synchronization) constraints between the order that jobs in different qucues should be served. These constraints are described as follows: There areN stations which are fathers of (zero or more)synchronized stations (children). Jobs that arrive at synchronized stations have to be processed only after jobs that arrived prior to them at their corresponding father station have been processed. We analyze the performance of the synchronized gated discipline and obtain expressions for the first two moments and the Laplace-Stieltjes transform (LST) of the waiting times in different stations, and expressions for the moments and LST of other quantities of interest, such as cycle duration and generalized station times. We also obtain a pscudo conservation law for the synchronized gated discipline, and determine the optimal network topology that minimizes the weighted sum of the mean waiting times, as defined in the pseudo conservation law. Numerical examples are given for illustrating the dependence of the performance of the synchronized gated discipline on different parameters of the network.Supported by a Grant from the France-Israel Scientific Cooperation (in Computer Science and Engineering) between the French Ministry of Research and Technology and the Israeli Ministry of Science and Technology, Grant No. 3321190.     

Anmerkungen betreffend eine „Statistische Technologie“

Zusammenfassung Der Zweck einer Statistischen Technologie im Bereiche der Unternehmensforschung wird kurz zu begründen versucht. Die Verarbeitung extensionaler und intensionaler statistischer Nachrichten durch eine Kalkültechnik soll nach dem Baukastenprinzip organisiert werden.

---

Summary The purpose of a Statistical Technology within operations research is demonstrated. It is intended to build up the processing of extensional and intensional statistical informations similar to the principle of component parts.

     

Martingale transforms and Hardy spaces

Summary Burkholder's martingale transforms are especially useful in studying predictable martingale Hardy spaces. Characterizations of such spaces via martingale transforms are provided. In particular, it is shown that for 0<p<, a martingale inh ^p , defined by the conditioned square function, is the martingale transform of a bmo₂ martingale with a multiplier sequence whose maximal function is inL ^p .     

Charakterisierung semisimplizialer Mengen durch Unterteilung und Graphen

We define a subdivision functor G for semisimplicial sets such that GXGY implies XY for all pairs of semisimplicial sets X, Y and (GX)¹(GY)¹ implies XY, too, but only, as far as we know, for pairs of weakly degenerate semisimplicial sets X, Y. These results are analogous to theorems on simplicial complexes which have been proved by Finney [1] and Segal [6].

---

---

In der Literatur werden semisimpliziale Mengen auch oft als complete semisimplicial complexes, abgekürzt css complexes bezeichnet. Wir halten uns hier im wesentlichen an die Terminologie von K. Lamotke [5].     

An existence and uniqueness theorem for wave equations with scalar nonlinearities

We prove an existence and uniqueness theorem of global solutions for wave equations with scalar nonlinearities. Our paper is a generalization of the work of R. W. Dickey [6].

---

Zusammenfassung Es wird ein Existenz- und Eindeutigkeitssatz für globale Lösungen von Wellengleichungen mit skalaren Nichtlinearitäten bewiesen. Die Arbeit stellt eine Verallgemeinerung der Arbeit [6] von R. W. Dickey dar.

     

Local invariants of differential equations

We consider an analytic system X=(X) in the neighborhood of the fixed point X=0. Depending on the characteristic numbers of the matrix (/x)₀, we define the integer d 0 as the dimension of the normal form or as the multiplicity of the resonance. We show that a system with d=1, subject to certain additional assumptions, has a finite number of invariants relative to reversible formal changes of variablesx = (Y). All these invariants are the coefficients of some normal form. We touch upon questions concerning invariants of relatively smooth and continuous substitutions.Translated from Matematicheskie Zametki, Vol. 14, No. 4, pp. 499–507, October, 1973.     

Strong coupling limit for a certain class of polaron models

Summary It will be shown, that a Polaron-like asymptotic is given for a class of functions which are called of decreasing interaction and nicely approximable with respect to the Wiener process. Using Large Deviation techniques one can see, that the asymptotics for thestrong coupling limit for those Polaron models is given by a meanfield model and can be described by a variational problem.     

More pathological examples for network flow problems

Two examples are presented. The first example is bad for a large subset of the primal minimum cost flow algorithms, namely those algorithms which start with the required amount ofs – t flow distributed in a feasible, but nonoptimal manner, and which get optimal by sending flow about negative cycles. In particular, the example is bad for the primal method which always sends flow about a cycle which yields the largest decrease in the objective function.The second example requires O(n ³) flow augmentations using tie-breaking variants of either the Edmonds—Karp shortest path or fewest reverse arcs in path maximum flow algorithms. This example implies that it is not possible to substantially improve the performance (in a worst case sense) of either algorithm by resolving ties.     

Stochastically monotone Markov Chains

Summary A real-valued discrete time Markov Chain {X _n} is defined to be stochastically monotone when its one-step transition probability function pr {X _n+1y¦ X _n=x} is non-increasing in x for every fixed y. This class of Markov Chains arises in a natural way when it is sought to bound (stochastically speaking) the process {X _n} by means of a smaller or larger process with the same transition probabilities; the class includes many simple models of applied probability theory. Further, a given stochastically monotone Markov Chain can readily be bounded by another chain {Y _n}, with possibly different transition probabilities and not necessarily stochastically monotone, and this is of particular value when the latter process leads to simpler algebraic manipulations. A stationary stochastically monotone Markov Chain {X _n} has cov(f(X ₀), f(X _n)) cov(f(X ₀), f(X _n+1))0 (n =1, 2,...) for any monotonic function f(·). The paper also investigates the definition of stochastic monotonicity on a more general state space, and the properties of integer-valued stochastically monotone Markov Chains.     

On the Mechanism for Nonlinear Representations of the Lorentz Group Arising in Quantum Field Theory

A mechanism is identified that leads to the correct law for the relativistic Wigner function transformation with respect to the Lorentz group as long as the corresponding relativistic wave functions have special transformation properties.     

Allgemeine Programmierung von Abläufen des industriellen,administrativen und kaufmännischen Rechnungswesens

Zusammenfassung Am Beispiel des Mischens zweier Listen von Informationen werden wesentliche Gesichtspunkte der Programmierung von Aufgaben des industriellen Rechnungswesens dargestellt und erläutert. Das den wissenschaftlichen und den kaufmännischen Aufgaben gemeinsamemethodische Fundament wird betont.

---

Summary The example Merging of two lists with informations shows and explains the important points of the programming of industrial accounting problems. Themethodic basis — common to scientific and commercial problems — is emphasized.

     

Averaging of Systems with Slow Variables

We justify the averaging method for systems with delay described by both slow and fast variables. The results obtained are applied to the analysis of one problem in control theory.     

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

Feine Topologie am Martinrand eines Standardprozesses

Summary For a Standard process admitting a dual process and satisfying Hypothesis (B) of Kunita and Watanabe, we investigate the limit behavior of excessive functions. First we analyse two concepts of fine topology on the Martin compactification of the state space, which are suggested by classical potential theory. We then prove several versions of the Fatou-Doob theorem: h-excessive functions have a limit in _h -almost every Martin boundary point — a) almost surely along -paths, b) with respect to the fine topology, c) with respect to the Martin topology outside of a set which is thin in .

---

---

Die Arbeit entstand im Rahmen eines von der Deutschen Forschungsgemeinschaft finanzierten Forschungsvorhabens.     

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.     

Parameters of the periodic response of a system with friction-affected constraints and harmonic excitation

Summary The periodic response of a single-freedom multi-body system with friction-affected constraints acted upon by a harmonic excitation is determined by numerical simulation. The contribution of the constraints to the generalized friction force, the influence of gravity and zero-gravity environment, and the consequences, when several constraints are considered without friction, are investigated. The effects of a small artificial damping on the response, and the possibilities of an equivalent damping for the friction-affected constraints are also examined.

---

Zusammenfassung Die periodische Bewegung eines Mehrkörpersystems mit einem Freiheitsgrad und reibungsbehafteten Bindungen bei harmonischer Erregung wird durch numerische Simulation bestimmt. Untersucht werden der Beitrag der Bindungen zur verallgemeinerten Reibungskraft, der Einfluß des Schwerefeldes und der Schwerelosigkeit und die Folgen, wenn einige Bindungen als reibungsfrei angenommen werden. Die Auswirkungen einer kleinen künstlichen Dämpfung auf die Bewegung, und die Möglichkeiten einer äquivalenten Dämpfung an Stelle der reibungsbehafteten Bindungen wird auch untersucht.

     

A monte carlo model for simulation of tank battles

A Monte Carlo model for simulation of company-level tank battles is described. The simulation is started with an observation phase. The probability of discovery is dependent upon properties of the terrain etc. Target selection is simulated deterministically with priority rules. Every unit belongs to one of the following states of fight: undamaged, able to shoot only, able to move only, shocked and out of action.It is possible to simulate surprise attacks and battles after a sudden contact if the units are assumed to fight from the same position during the whole battle. In a later version of the model, the units are permitted to show as much of themselves as they wish during the battle. Thus it is possible to simulate (small) changes of position, initiated by the current events.     

Nonexistence of new order-9 projective plane with order-13 collineation

The order-9 Desarguesian projective plane and the known self-dual non-Desarguesian plane (Carmichael or Hughes plane) each have a 13-collineation displacing all points and all lines. We show that no previously undiscovered 9-plane has this property.     

Topology optimization of multi-purpose structures

Whilst most of the literature on topology optimization of structures deals with so-called selfadjoint problems involving highly idealized, single-purpose structures, this paper discusses topology optimization of multi-purpose structures which concerns nonselfadjoint problems. General methods based on the so-called layout theory, application to trusses and perforated plates and computational difficulties are discussed.