How to compute the volume in high dimension?

 In some areas of theoretical computer science we feel that randomized algorithms are better and in some others we can prove that they are more efficient than the deterministic ones. Approximating the volume of a convex n-dimensional body, given by an oracle is one of the areas where this difference can be proved. In general, if we use a deterministic algorithm to approximate the volume, it requires exponentially many oracle questions in terms of n as n→∞. Dyer, Frieze and Kannan gave a randomized polynomial approximation algorithm for the volume of a convex body K⊆ℝ ⁿ , given by a membership oracle. The DKF algorithm was improved in a sequence of papers. The area is full of deep and interesting problems and results. This paper is an introduction to this field and also a survey. Received: January 28, 2003 / Accepted: April 29, 2003 Published online: May 28, 2003     

L'intégration graphique des équations différentielles ordinaires

In the period which precedes the appearance of computers, needs in calculation of the scientists and engineers led to an important development of graphic methods of integration. To contribute to the study of this little known phenomenon, the article presents techniques and instruments used for the graphic integration of ordinary differential equations, and looks for their historic origins by going back to the beginning of calculus: processes of geometric calculation by the polygonal method or the method of radius of curvature, use of tractional motion for the conception of integraphs, reduction to graphic quadratures in finite or infinite number.     

Parallel Newton Two-Stage Multisplitting Iterative Methods for Nonlinear Systems

Parallel Newton two-stage iterative methods to solve nonlinear systems are studied. These algorithms are based on both the multisplitting technique and the two-stage iterative methods. Convergence properties of these methods are studied when the Jacobian matrix is either monotone or an H-matrix. Furthermore, in order to illustrate the performance of the algorithms studied, computational results about these methods on a distributed memory multiprocessor are discussed.This revised version was published online in October 2005 with corrections to the Cover Date.     

Pointwise gradient estimates of solutions to onedimensional nonlinear parabolic equations

We present here an improved version of the method introduced by the first author to derive pointwise gradient estimates for the solutions of one-dimensional parabolic problems. After considering a general qualinear equation in divergence form we apply the method to the case of a nonlinear diffusion-convection equation. The conclusions are stated first for classical solutions and then for generalized and mild solutions. In the case of unbounded initial datum we obtain several regularizing effects for t > 0. Some unilateral pointwise gradient estimates are also obtained. The case of the Dirichlet problem is also considered. Finally, we collect, in the last section, several comments showing the connections among these estimates and the study of the free boundaries associated to the solutions of the diffusion-convection equation.     

Functional Quantization and Small Ball Probabilities for Gaussian Processes

Quantization consists in studying the L ^r -error induced by the approximation of a random vector X by a vector (quantized version) taking a finite number n of values. We investigate this problem for Gaussian random vectors in an infinite dimensional Banach space and in particular, for Gaussian processes. A precise link proved by Fehringer⁽⁴⁾ and Dereich et al. ⁽³⁾ relates lower and upper bounds for small ball probabilities with upper and lower bounds for the quantization error, respectively. We establish a complete relationship by showing that the same holds for the direction from the quantization error to small ball probabilities. This allows us to compute the exact rate of convergence to zero of the minimal L ^r -quantization error from logarithmic small ball asymptotics and vice versa.     

Asymptotic behaviour of the least squares estimator of the mean of AR(1) models

The aim of the paper is to investigate the limit behaviour of the least squares estimator of the shift parameter of nearly unstable, nearly stable, and nearly explosive AR(1) models. Both zero start and stationary cases are treated. Connection with the maximum likelihood estimator of the shift parameter of continuous time AR(1) processes is also discussed.     

Banach spaces which are somewhat uniformly noncreasy

We consider a family of spaces wider than r-UNC spaces and we give some fixed point results in the setting of these spaces.     

Geometric formulas for Smale invariants of codimension two immersions

We give three formulas expressing the Smale invariant of an immersion f of a (4k−1)-sphere into (4k+1)-space. The terms of the formulas are geometric characteristics of any generic smooth map g of any oriented 4k-dimensional manifold, where g restricted to the boundary is an immersion regularly homotopic to f in (6k−1)-space.The formulas imply that if f and g are two non-regularly homotopic immersions of a (4k−1)-sphere into (4k+1)-space then they are also non-regularly homotopic as immersions into (6k−1)-space. Moreover, any generic homotopy in (6k−1)-space connecting f to g must have at least a_k(2k−1)! cusps, where a_k=2 if k is odd and a_k=1 if k is even.     

Derivation of the k–ε model for locally homogeneous turbulence by homogenization techniques

We derive the incompressible and compressible k–ε model for locally homogeneous turbulence. The model is rigorously derived on formal mathematical grounds using the MPP modelling technique. This lets us calculate by either analytical or numerical means the closure constants of the model. To cite this article: T. Chacón Rebollo, D. Franco Coronil, C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

The number of k‐SAT functions

We study the number SAT(k; n) of Boolean functions of n variables that can be expressed by a k‐SAT formula. Equivalently, we study the number of subsets of the n‐cube 2ⁿ that can be represented as the union of (n ? k)‐subcubes. In The number of 2‐SAT functions (Isr J Math, 133 (2003), 45–60) the authors and Imre Leader studied SAT(k; n) for k ≤ n/2, with emphasis on the case k = 2. Here, we prove bounds on SAT(k; n) for k ≥ n/2; we see a variety of different types of behavior. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 22: 227–247, 2003