Numerical and theoretical study of a Dual Mesh Method using finite volume schemes for two phase flow problems in porous media

Summary. In this paper we are interested in two phase flow problems in porous media. We use a Dual Mesh Method to discretize this problem with finite volume schemes. In a simplified case (elliptic - hyperbolic system) we prove the convergence of approximate solutions to the exact solutions. We use the Dual Mesh Method in physically complex problems (heterogeneous cases with non constant total mobility). We validate numerically the Dual Mesh Method on practical examples by computing error estimates for different test-cases. Received March 21, 1997 / Revised version received October 13, 1997     

The first <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-cohomology of some groups with one end

Let p be a real number greater than one. In this paper we study the vanishing and nonvanishing of the first L ^p -cohomology space of some groups that have one end. We also make a connection between the first L ^p -cohomolgy space and the Floyd boundary of the Cayley graph of a group. We apply the result about Floyd boundaries to show that there exists a real number p such that the first L ^p -cohomology space of a nonelementary hyperbolic group does not vanish. Received: 4 August 2006 Revised: 2 November 2006     

Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations

Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties of iterative solvers. Received August 5, 2000 / Published online June 20, 2001     

A comparison theorem for a piecewise Lipschitz continuous Hamiltonian and application to Shape-from-Shading problems

Summary The reconstruction from a shaded image of a Lambertian and not self-shadowing surface illuminated by a single distant pointwise light source may be written as a first-order Hamilton-Jacobi equation.In this paper, we continue the investigation begun in E. Rouy and A. Tourin into the uniqueness of the solution of this equation; the approach is based on the viscosity solutions theory and the dynamic programming principle.More precisely, we concentrate here on the uniqueness of the viscosity solution of this equation in case the measured luminous intensity reflected by the surface is discontinuous along a smooth curve. We prove a general comparison result for a piecewise Lipschitz continuous Hamiltonian and illustrate it by numerical experiments.     

Partially finite convex programming,Part I: Quasi relative interiors and duality theory

We study convex programs that involve the minimization of a convex function over a convex subset of a topological vector space, subject to a finite number of linear inequalities. We develop the notion of the quasi relative interior of a convex set, an extension of the relative interior in finite dimensions. We use this idea in a constraint qualification for a fundamental Fenchel duality result, and then deduce duality results for these problems despite the almost invariable failure of the standard Slater condition. Part II of this work studies applications to more concrete models, whose dual problems are often finite-dimensional and computationally tractable.     

A family of centered forms for a polynomial

The general centered form for multi-variate polynomials is investigated and a computing procedure is proposed that results in a certain superset. Based on this procedure the optimal centered forms for monomials and for some special cases of polynomials are investigated.     

Conley indices on convex sets, attractor-repeller pairs and applications to multiple solutions of nonlinear elliptic equations

We discuss the calculation of homotopy indices on closed convex sets in a Banach space and then use these ideas to prove the existence of multiple solutions of nonlinear elliptic equations. We obtain more information on the solutions than in earlier work. A key idea is to calculate the homotopy index of the stable and mountain pass solutions and the connections joining them. Dedicated to the memory of Jean Leray     

A diffusive predator-prey model in heterogeneous environment

In this paper, we demonstrate some special behavior of steady-state solutions to a predator-prey model due to the introduction of spatial heterogeneity. We show that positive steady-state solutions with certain prescribed spatial patterns can be obtained when the spatial environment is designed suitably. Moreover, we observe some essential differences of the behavior of our model from that of the classical Lotka-Volterra model that seem to arise only in the heterogeneous case.     

On divisibility properties of certain multinomial coefficients—II

A recent conjecture of Myerson and Sander concerns divisibility properties of certain multinomial coefficients. We obtain results in this direction by further pursuing a line of attack developed earlier by the first author.     

Numerosities of labelled sets: a new way of counting

The notions of “labelled set” and “numerosity” are introduced to generalize the counting process of finite sets. The resulting numbers, called numerosities, are then used to develop nonstandard analysis. The existence of a numerosity function is equivalent to the existence of a selective ultrafilter, hence it is independent of the axioms of ZFC.