Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

Numerical solution of the Monge–Ampère equation by a Newton's algorithm

We solve numerically the Monge–Ampère equation with periodic boundary condition using a Newton's algorithm. We prove convergence of the algorithm, and present some numerical examples, for which a good approximation is obtained in 10 iterations. To cite this article: G. Loeper, F. Rapetti, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Convergence of multistep discretizations of DAEs

Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405.     

The existence of equilibria in certain games,separation for families of convex functions and a theorem of Borsuk-Ulam type

The existence of a Nash equilibrium in the undiscounted repeated two-person game of incomplete information on one side is established. The proof depends on a new topological result resembling in some respect the Borsuk-Ulam theorem.     

A Hilbert Space Approach to Bounded Analytic Interpolation

We generalize several results on bounded analytic interpolation of Fitzgerald and Horn, which work by majorization by positive definite kernels, to the cases of several complex variables and operator-valued interpolation. Using a lemma of Kolmogorov, we complement a simplification due to Szafraniec in the proofs of the theorems. Received: November 21, 2006. Accepted: August 03, 2007.     

On α-I-continuous and α-I-open functions

Montgomery and Vaughan improved a theorem of Erd?s and Fuchs for an arbitrary sequence. Sárközy extended this theorem of Erd?s and Fuchs for two arbitrary sequences which are "near" in a certain sense. Using the idea of Jurkat (differentiation of the generating function), we will extend similarly the result of Montgomery and Vaughan for "sufficiently near" sequences.