SPH modelling of fluid at the grain level in a porous medium

Computational modelling of the flow of fluids in porous media has traditionally been at a macroscopic level where the medium’s permeability and porosity are an input (from experiments for example). In many cases this is difficult, especially if the porous medium changes its solid structure as a function of time. This situation occurs in reactive systems such as “heap-leaching”, where biological and/or chemical solutions are introduced into the heap to dissolve or react with valuable materials. In this case, modelling fluid flow at the grain level is paramount and we show how this can be done with the SPH technique. We present three-dimensional SPH simulations of fluid flow in an idealised porous medium and show that the technique yields flows which are physically realistic. The permeability of the medium is then predicted.     

Improved Gagliardo-Nirenberg-Sobolev inequalities on manifolds with positive curvature

We apply the method of [J. Demange, From porous media equation to generalized Sobolev inequalities on a Riemannian manifold, preprint, http://www.lsp.ups-tlse.fr/Fp/Demange/, 2004] and [J. Demange, Porous Media equation and Sobolev inequalities under negative curvature, preprint, http://www.lsp.ups-tlse.fr/Fp/Demange/, 2004], based on the curvature-dimension criterion and the study of Porous Media equation, to the case of a manifold M with strictly positive Ricci curvature. This gives a new way to prove classical Sobolev inequalities on M. Moreover, this enables to improve non-critical Sobolev inequalities as well. As an application, we study the rate of convergence of the solutions of the Porous Media equation to the equilibrium.     

Goal programming sensitivity analysis using interval penalty weights

This paper presents an application of the vector-maximum research [4–8] to the sensitivity analysis of goal programming problems as several of the criterion function penalty weights are simultaneously and independently varied. A generalized goal programming capability is presented and a six-stage analytic procedure is described. The problem is generalized in the sense that the regular goal programming penalty weights can be expanded to intervals if desired. The solution procedure is new in that it depends upon an algorithm for the vector-maximum problem, criterion cone contraction procedures, and filtering techniques. Together they are able to generate and process all extreme points on the portion of the surface of the goal programming augmented feasible region corresponding to the interval penalty weights specified. In effect, the procedure and adapted algorithm of this paper delivers to goal programming an operational power of sensitivity analysis not previously available to users. A numerical example is provided in order to illustrate the computerized application of the total goal programming procedure outlined.     

The stability of a ring under the action of a linear torque,constant along the perimeter

Exact analytical solutions of problems on the static and dynamic forms of the loss of stability of a ring, under the action of a linear torque constant along the perimeter, are found using the consistent equations of the theory of plane curvilinear rods constructed earlier taking account of transverse shears. Two forms of torsion of the ring are examined: the external forces creating a torque remain in the plane of a cross-section of the ring in its initial undeformed state (“dead” forces, case 1) or in its deformed state (“follower” forces, case 2). It is shown that, in the second case, the solution of the static instability problem found is practically identical to the solution of the problem corresponding to the dynamic formulation and is reduced to an examination of the oscillations about the static equilibrium position. In the case of both forms of loading, loss of stability of the ring occurs without deformation of its axial line, with it bending predominantly in the plane of the ring accompanied by a slight distortion. It is established that a study of the forms of loss of stability of the ring for the type of loading considered is only possible using the equations constructed, taking account of transverse shear.     

A comparison of different quantity discount pricing policies in a two-echelon channel with stochastic and asymmetric demand information

In this paper, we study quantity discount pricing policies in a channel of one manufacturer and one retailer. The paper assumes that the channel faces a stochastic price-sensitive demand but the retailer can privately observe the realization of an uncertain demand parameter. The problem is analyzed as a Stackelberg game in which the manufacturer declares quantity discount pricing schemes to the retailer and then the retailer follows by selecting the retail price and associated quantity. Proposed in the paper are four quantity-discount pricing policies: “regular quantity discount”; “fixed percentage discount”; “incremental volume discount” and “fixed marginal-profit-rate discount”. Optimal solutions are derived, and numerical examples are presented to illustrate the efficiency of each discount policy.     

Global weak solutions to the Nordström-Vlasov system

The Nordström-Vlasov system is a Lorentz invariant model for a self-gravitating collisionless gas. We establish suitable a priori bounds on the solutions of this system, which together with energy estimates and the smoothing effect of “momentum averaging” yield the existence of global weak solutions to the corresponding initial value problem. In the process we improve the continuation criterion for classical solutions which was derived recently. The weak solutions are shown to preserve mass.     

Partly convex programming and zermelo's navigation problems

Mathematical programs, that become convex programs after freezing some variables, are termed partly convex. For such programs we give saddle-point conditions that are both necessary and sufficient that a feasible point be globally optimal. The conditions require cooperation of the feasible point tested for optimality, an assumption implied by lower semicontinuity of the feasible set mapping. The characterizations are simplified if certain point-to-set mappings satisfy a sandwich condition.The tools of parametric optimization and basic point-to-set topology are used in formulating both optimality conditions and numerical methods. In particular, we solve a large class of Zermelo's navigation problems and establish global optimality of the numerical solutions.Research partly supported by NSERC of Canada.     

Pullback permanence in a non-autonomous competitive Lotka-Volterra model

The goal of this work is to study in some detail the asymptotic behaviour of a non-autonomous Lotka-Volterra model, both in the conventional sense (as t→∞) and in the “pullback” sense (starting a fixed initial condition further and further back in time). The non-autonomous terms in our model are chosen such that one species will eventually die out, ruling out any conventional type of permanence. In contrast, we introduce the notion of “pullback permanence” and show that this property is enjoyed by our model. This is not just a mathematical artifice, but rather shows that if we come across an ecology that has been evolving for a very long time we still expect that both species are represented (and their numbers are bounded below), even if the final fate of one of them is less happy. The main tools in the paper are the theory of attractors for non-autonomous differential equations, the sub-supersolution method and the spectral theory for linear elliptic equations.     

Compensated split-step balanced methods for nonlinear stiff SDEs with jump-diffusion and piecewise continuous arguments

This paper deals with numerical solutions of nonlinear stiff stochastic differential equations with jump-diffusion and piecewise continuous arguments. By combining compensated split-step methods and balanced methods, a class of compensated split-step balanced (CSSB) methods are suggested for solving the equations. Based on the one-sided Lipschitz condition and local Lipschitz condition, a strong convergence criterion of CSSB methods is derived. It is proved under some suitable conditions that the numerical solutions produced by CSSB methods can preserve the mean-square exponential stability of the corresponding analytical solutions. Several numerical examples are presented to illustrate the obtained theoretical results and the effectiveness of CSSB methods. Moreover, in order to show the computational advantage of CSSB methods, we also give a numerical comparison with the adapted split-step backward Euler methods with or without compensation and tamed explicit methods.

     

Permutations with extremal number of fixed points

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting permutations we study their generating polynomials by number of excedances. Several techniques are used: Désarménien's desarrangement combinatorics, Gessel's hook-factorization and the analytical properties of two new permutation statistics “DEZ” and “lec.” Explicit formulas for the maximal case are derived by using symmetric function tools.     

Interval modeling of dynamics for multibody systems

Modeling of multibody systems is an important though demanding field of application for interval arithmetic. Interval modeling of dynamics is particularly challenging, not least because of the differential equations which have to be solved in the process. Most modeling tools transform these equations into a (non-autonomous) initial value problem, interval algorithms for solving of which are known. The challenge then consists in finding interfaces between these algorithms and the modeling tools. This includes choosing between “symbolic” and “numerical” modeling environments, transforming the usually non-autonomous resulting system into an autonomous one, ensuring conformity of the new interval version to the old numerical, etc. In this paper, we focus on modeling multibody systems’ dynamics with the interval extension of the “numerical” environment MOBILE, discuss the techniques which make the uniform treatment of interval and non-interval modeling easier, comment on the wrapping effect, and give reasons for our choice of MOBILE by comparing the results achieved with its help with those obtained by analogous symbolic tools.     

The numerical solution of forward-backward differential equations: Decomposition and related issues

This paper focuses on the decomposition, by numerical methods, of solutions to mixed-type functional differential equations (MFDEs) into sums of “forward” solutions and “backward” solutions. We consider equations of the form x^′(t)=ax(t)+bx(t−1)+cx(t+1) and develop a numerical approach, using a central difference approximation, which leads to the desired decomposition and propagation of the solution. We include illustrative examples to demonstrate the success of our method, along with an indication of its current limitations.     

A note on the wave propagation in water of variable depth

In the present work, utilizing the two dimensional equations of an incompressible inviscid fluid and the reductive perturbation method we studied the propagation of weakly nonlinear waves in water of variable depth. For the case of slowly varying depth, the evolution equation is obtained as the variable coefficient Korteweg-de Vries (KdV) equation. Due to the difficulties for the analytical solutions, a numerical technics so called “the method of integrating factor” is used and the evolution equation is solved under a given initial condition and the bottom topography. It is observed the parameters of bottom topography causes to the changes in wave amplitude, wave profile and the wave speed.     

The “Essential Tension” at Work in Qualitative Analysis: A Case Study of the Opposite Points of View of Poincaré and Enriques on the Relationships between Analysis and Geometry

An analysis of the different philosophic and scientific visions of Henri Poincaré and Federigo Enriques relative to qualitative analysis provides us with a complex and interesting image of the “essential tension” between “tradition” and “innovation” within the history of science. In accordance with his scientific paradigm, Poincaré viewed qualitative analysis as a means for preserving the nucleus of the classical reductionist program, even though it meant “bending the rules” somewhat. To Enriques's mind, qualitative analysis represented the affirmation of a synthetic, geometrical vision that would supplant the analytical/quantitative conception characteristic of 19th-century mathematics and mathematical physics. Here, we examine the two different answers given at the turn of the century to the question of the relationship between geometry and analysis and between mathematics, on the one hand, and mechanics and physics, on the other.Copyright 1998 Academic Press.Un'analisi delle diverse posizioni filosofiche e scientifiche di Henri Poincaré e Federigo Enriques nei riguardi dell'analisi qualitativa fornisce un'immagine complessa e interessante della “tensione essenziale” tra “tradizione” e “innovazione” nell'ambito della storia della scienza. In linea con il proprio paradigma scientifico, Poincaré vedeva nell'analisi qualitativa un mezzo per preservare il nucleo del programma riduzionista calssico, anche se cio comportava una lieve “distorsione delle regole”. Nella mente di Enriques, l'analisi qualitativa rappresentava l'affermazione di un punto di vista sintetico e geometrico che avrebbe soppiantato la concezione analitico-quantitativa caratteristica della matematica e della fisica matematica del 19° secolo. Il nostro scopo principale è di esaminare due diverse risposte date a cavallo del secolo alla questione dei rapporti tra geometria e analisi e tra matematica da un lato e meccanica e fisica dall'altro.Copyright 1998 Academic Press.AMS subject classification: 01A55     

Nonmonotone systems decomposable into monotone systems with negative feedback

Motivated by the work of Angeli and Sontag [Monotone control systems, IEEE Trans. Automat. Control 48 (2003) 1684-1698] and Enciso and Sontag [On the global attractivity of abstract dynamical systems satisfying a small gain hypothesis, with applications to biological delay systems, Discrete Continuous Dynamical Systems, to appear] in control theory, we show that certain finite and infinite dimensional semi-dynamical systems with “negative feedback” can be decomposed into a monotone “open-loop” system with “inputs” and a decreasing “output” function. The original system is reconstituted by “plugging the output into the input”. Employing a technique of Gouzé [A criterion of global convergence to equilibrium for differential systems with an application to Lotka-Volterra systems, Rapport de Recherche 894, INRIA] and Cosner [Comparison principles for systems that embed in cooperative systems, with applications to diffusive Lotka-Volterra models, Dynam. Cont., Discrete Impulsive Systems 3 (1997) 283-303] of imbedding the system into a larger symmetric monotone system, we are able to obtain information on the asymptotic behavior of solutions, including existence of positively invariant sets and global convergence.     

Darboux integrating factors: Inverse problems

We discuss planar polynomial vector fields with prescribed Darboux integrating factors, in a nondegenerate affine geometric setting. We establish a reduction principle which transfers the problem to polynomial solutions of certain meromorphic linear systems, and show that the space of vector fields with a given integrating factor, modulo a subspace of explicitly known “standard” vector fields, has finite dimension. For several classes of examples we determine this space explicitly.     

Hybrid mountain pass homoclinic solutions of a class of semilinear elliptic PDEs

Variational gluing arguments are employed to construct new families of solutions for a class of semilinear elliptic PDEs. The main tools are the use of invariant regions for an associated heat flow and variational arguments. The latter provide a characterization of critical values of an associated functional. Among the novelties of the paper are the construction of “hybrid” solutions by gluing minima and mountain pass solutions and an analysis of the asymptotics of the gluing process.     

Critical mass phenomenon for a chemotaxis kinetic model with spherically symmetric initial data

The goal of this paper is to exhibit a critical mass phenomenon occurring in a model for cell self-organization via chemotaxis. The very well-known dichotomy arising in the behavior of the macroscopic Keller–Segel system is derived at the kinetic level, being closer to microscopic features. Indeed, under the assumption of spherical symmetry, we prove that solutions with initial data of large mass blow-up in finite time, whereas solutions with initial data of small mass do not. Blow-up is the consequence of a momentum computation and the existence part is derived from a comparison argument. Spherical symmetry is crucial within the two approaches. We also briefly investigate the drift-diffusion limit of such a kinetic model. We recover partially at the limit the Keller–Segel criterion for blow-up, thus arguing in favour of a global link between the two models.     

Rough path limits of the Wong-Zakai type with a modified drift term

The Wong-Zakai theorem asserts that ODEs driven by “reasonable” (e.g. piecewise linear) approximations of Brownian motion converge to the corresponding Stratonovich stochastic differential equation. With the aid of rough path analysis, we study “non-reasonable” approximations and go beyond a well-known criterion of [Ikeda, Watanabe, North Holland, 1989] in the sense that our result applies to perturbations on all levels, exhibiting additional drift terms involving any iterated Lie brackets of the driving vector fields. In particular, this applies to the approximations by McShane ('72) and Sussmann ('91). Our approach is not restricted to Brownian driving signals. At last, these ideas can be used to prove optimality of certain rough path estimates.