Search results for "LIMIT"

Uniqueness and nonexistence of limit cycles for the Fitzhugh equation

1983

Navier-Stokes equations on an exterior circular domain: construction of the solution and the zero viscosity limit

1997

Abstract In this Note, we consider the limit of Navier-Stokes equations on a circular domain. By an explicit construction of the solution, it is proved that, when viscosity goes to zero, solution converges to the Euler solution outside the boundary layer and to the Prandtl solution inside the boundary layer.

MUTUAL INDUCTANCE FOR AN EXPLICITLY FINITE NUMBER OF TURNS

2011

Non coaxial mutual inductance calculations, based on a Bessel function formulation, are presented for coils modelled by an explicitly flnite number of circular turns. The mutual inductance of two such turns can be expressed as an integral of a product of three Bessel functions and an exponential factor, and it is shown that the exponential factors can be analytically summed as a simple geometric progression, or other related sums. This allows the mutual inductance of two thin solenoids to be expressed as an integral of a single analytical expression. Sample numerical results are given for some representative cases and the approach to the limit where the turns are considered to be smeared ou…

Optimum free energy in the reference functional approach for the integral equations theory.

2011

We investigate the question of determining the bulk properties of liquids, required as input for practical applications of the density functional theory of inhomogeneous systems, using density functional theory itself. By considering the reference functional approach in the test particle limit, we derive an expression of the bulk free energy that is consistent with the closure of the Ornstein–Zernike equations in which the bridge functions are obtained from the reference system bridge functional. By examining the connection between the free energy functional and the formally exact bulk free energy, we obtain an improved expression of the corresponding non-local term in the standard referenc…

Associative and reflective connections between the limit of the difference quotient and limiting process

2006

Abstract This paper reports a study of how students may connect the limiting process inherent in the derivative to the limit of the difference quotient (LDQ) when solving problems. The data was collected mainly through task-based interviews with five eleventh grade students. It was found that the students used various kinds of limiting processes and connected them in different ways to LDQ. Some of them changed between these two representations, and some students explained one with the other. The two kinds of connections were, respectively, named as associative and reflective connections. One of the students, who made the associative connection, used LDQ skillfully. On the contrary, a studen…

A Simple Model for Ac Impedance Spectra in Bipolar Membranes

1996

A new model accounting for the ac impedance spectra of synthetic ion-exchange bipolar membranes is presented. The theoretical approach is based on the Nernst−Planck and Poisson equations and applies some of the concepts used in the semiconductor pn junctions to the case of a bipolar membrane. The results presented are the current−voltage curves and the impedance spectra at electric currents above the limiting current. It is shown that the model is able to identify the main contributions to the bipolar membrane impedance and gives valuable information about the bipolar junction structure and its influence on the characteristic parameters involved in the field-enhanced water dissociation phen…

A branch-and-cut algorithm for the Orienteering Arc Routing Problem

2016

[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…

Optimality conditions for shakedown design of trusses

1995

This paper deals with optimal shakedown design of truss structures constituted by elastic perfectly plastic material. The design problem is formulated by means of a statical approach on the grounds of the shakedown lower bound theorem, and by means of a kinematical approach on the grounds of the shakedown upper bound theorem. In both cases two different types of design problem are formulated: one searches for the minimum volume design whose shakedown limit load is assigned; the other searches for the maximum shakedown limit load design whose volume is assigned. The Kuhn-Tucker equations of the four problems here above mentioned are found by utilizing a variational approach; these equations …

A penalty-based finite element interface technology

2002

Abstract An effective and robust interface element technology able to connect independently modeled finite element subdomains is presented. This method has been developed using the penalty constraints and allows coupling of finite element models whose nodes do not coincide along their common interface. Additionally, the present formulation leads to a computational approach that is very efficient and completely compatible with existing commercial software. A significant effort has been directed toward identifying those model characteristics (element geometric properties, material properties and loads) that most strongly affect the required penalty parameter, and subsequently to developing si…

An exact algorithm for the min-cost network containment problem

2004

A network design problem which arises in the distribution of a public utility provided by several competitive suppliers is studied. The problem addressed is that of determining minimum-cost (generalized) arc capacities in order to accommodate any demand between given source–sink pairs of nodes, where demands are assumed to fall within predetermined ranges. Feasible flows are initially considered as simply bounded by the usual arc capacity constraints. Then, more general linear constraints are introduced which may limit the weighted sum of the flows on some subsets of arcs. An exact cutting plane algorithm is presented for solving both of the above cases and some computational results are re…