Permanence of a delayed discrete mutualism model with feedback controls

This paper discusses a two species discrete model of mutualism with delays and feedback controls. Sufficient conditions are obtained for the permanence of the system. The results show that feedback control variables have no influence on the persistence property of the system.     

Maximizing the Product of Two Linear Functions In 0-1 Variables

We study both the continuous and discrete problems of maximizing the product of two linear functions subject to all variables being between 0 and 1. We first give linear and low-order polynomial algorithms for the solution of the continuous problem. In addition, we describe penalties that help to fix variables in the discrete problem. Extensive computational tests demonstrate the effectiveness of these results.     

Bound states of discrete Schrödinger operators with super-critical inverse square potentials

We consider discrete one-dimensional Schrödinger operators whose potentials decay asymptotically like an inverse square. In the super-critical case, where there are infinitely many discrete eigenvalues, we compute precise asymptotics of the number of eigenvalues below a given energy as this energy tends to the bottom of the essential spectrum.

     

Completely J —positive linear systems of finite order

Completely J — positive linear systems of finite order are introduced as a generalization of completely symmetric linear systems. To any completely J — positive linear system of finite order there is associated a defining measure with respect to which the transfer function has a certain integral representation. It is proved that these systems are asymptotically stable. The observability and reachability operators obey a certain duality rule and the number of negative squares of the Hankel operator is estimated. The Hankel operator is bounded if and only if a certain measure associated with the defining measure is of Carleson type. We prove that a real symmetric operator valued function which is analytic outside the unit disk has a realization with a completely J — symmetric linear space which is reachable, observable and parbalanced. Uniqueness and spectral minimality of the completely J — symmetric realizations are discussed.     

Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints

This note presents an efficient method for the routine solution of the subproblem associated with the Lagrangian dual of discrete programming problems having separable non-linear objective function and linear constraints. An additional advantage for subgradient methods is described.     

A methodology for the development of discrete adjoint solvers using automatic differentiation tools

A methodology for the rapid development of adjoint solvers for computational fluid dynamics (CFD) models is presented. The approach relies on the use of automatic differentiation (AD) tools to almost completely automate the process of development of discrete adjoint solvers. This methodology is used to produce the adjoint code for two distinct 3D CFD solvers: a cell-centred Euler solver running in single-block, single-processor mode and a multi-block, multi-processor, vertex-centred, magneto-hydrodynamics (MHD) solver. Instead of differentiating the entire source code of the CFD solvers using AD, we have applied it selectively to produce code that computes the transpose of the flux Jacobian matrix and the other partial derivatives that are necessary to compute sensitivities using an adjoint method. The discrete adjoint equations are then solved using the Portable, Extensible Toolkit for Scientific Computation (PETSc) library. The selective application of AD is the principal idea of this new methodology, which we call the AD adjoint (ADjoint). The ADjoint approach has the advantages that it is applicable to any set of governing equations and objective functions and that it is completely consistent with the gradients that would be computed by exact numerical differentiation of the original discrete solver. Furthermore, the approach does not require hand differentiation, thus avoiding the long development times typically required to develop discrete adjoint solvers for partial differential equations, as well as the errors that result from the necessary approximations used during the differentiation of complex systems of conservation laws. These advantages come at the cost of increased memory requirements for the discrete adjoint solver. However, given the amount of memory that is typically available in parallel computers and the trends toward larger numbers of multi-core processors, this disadvantage is rather small when compared with the very significant advantages that are demonstrated. The sensitivities of drag and lift coefficients with respect to different parameters obtained using the discrete adjoint solvers show excellent agreement with the benchmark results produced by the complex-step and finite-difference methods. Furthermore, the overall performance of the method is shown to be better than most conventional adjoint approaches for both CFD solvers used.     

Body fitted link-cell algorithm for particulate flow simulation in curved pipeline domain

The link-cell (LC) algorithm is widely used in discrete element method (DEM) simulation, in order to increase computational efficiency. The common way is to divide the entire computational domain into a series of square sub-cells. A huge index matrix, Ω$\Omega$, is required to store the information of particles located in each of these sub-cells. However, most of these sub-cells are always empty for some anomalistic computational domain, such as particulate flow in a pipeline. These empty sub-cells also consume the limited memory bandwidth and lower the computational power. In order to reduce the size of the index matrix, a body fitted link-cell (BFLC) algorithm is established to identify the neighbors quickly. Furthermore, a simplified algorithm for simulation of two dimensional particulate flow in curved pipelines is presented. Lastly, an example is presented to validate the BFLC algorithm.     

NUMERICAL SOLUTION OF THE UNSTEADY INCOMPRESSIBLE NAVIER-STOKES EQUATIONS ON THE CURVILINEAR HALF-STAGGERED MESH NUMERICAL SOLUTION OF THE UNSTEADY INCOMPRESSIBLE NAVIER-STOKES EQUATIONS ON THE CURVILINEAR HALF-STAGGERED MESH

1. IntroductionLet us consider the unsteady incompressible Navier--Stokes equatinns (qSE)on a twedimensional reginn n with boundary On. Here w is the velocity vector; interms of its Caxtesian,components w = (u, v)"; p is the Pressure. The initial conditionis given assatisheng (1.2). We are concerned mainly with the solid wall boundary conditiollbut we will also briefly discuss the outflow boundary conditinn. Note the convectionterm can ajBo be written in conservative form (w' glad)w = div(…