Equivalence of u–p and ζ–ψ formulations of the time-dependent Navier–Stokes equations

This paper deals with the non-stationary incompressible Navier--Stokes equations for two-dimensional flows expressed in terms of the velocity and pressure and of the vorticity and streamfunction. The equivalence of the two formulations is demonstrated, both formally and rigorously, by virtue of a condition of compatibility between the boundary and initial values of the normal component of velocity. This condition is shown to be the only compatibility condition necessary to allow for solutions of a minimal regularity, namely H¹ for the velocity, as in most current numerical schemes relying on spatial discretizations of local type.     

Integral Representation Formulas in Polydomains

Representation formulas are given for solutions to second order systems in polydomains composed by as well the Laplace as the Bitsadze operator in the single variables. They result from iterations of the respective formulas for the one variable case. This procedure is also applied to mixed systems of first and second order equations.     

Asymptotic Behavior of Solutions to the Difference Equation Using the Second Differences of a Liapunov Function

We introduce the concept of the second Liapunov differences in difference equations and show that, in the autonomous case, the second variations can guarantee the existence of solutions tending to zero while others starting arbitrarily near 0 go to ∞. These are based on Yorke's results for ordinary differential equations.     

Elimination of bounds in optimization problems by transforming variables

The problem of minimizing a nonlinear objective function ofn variables, with continuous first and second partial derivatives, subject to nonnegativity constraints or upper and lower bounds on the variables is studied. The advisability of solving such a constrained optimization problem by making a suitable transformation of its variables in order to change the problem into one of unconstrained minimization is considered. A set of conditions which guarantees that every local minimum of the new unconstrained problem also satisfies the first-order necessary (Kuhn—Tucker) conditions for a local minimum of the original constrained problem is developed. It is shown that there are certain conditions under which the transformed objective function will maintain the convexity of the original objective function in a neighborhood of the solution. A modification of the method of transformations which moves away from extraneous stationary points is introduced and conditions under which the method generates a sequence of points which converges to the solution at a superlinear rate are given.     

Marcus contextual languages consisting of primitive words

In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars.     

Extending Sets of Idempotents to Ring Extensions

In this paper the idea of an intrinsic extension of a ring, first proposed by Faith and Utumi, is generalized and studied in its own right. For these types of ring extensions, it is shown that, with relatively mild conditions on the base ring, R, a complete set of primitive idempotents (a complete set of left triangulating idempotents, a complete set of centrally primitive idempotents) can be constructed for an intrinsic extension, T, from a corresponding set in the base ring R. Examples and applications are given for rings that occur in functional analysis and group ring theory.     

An unusual decomposition of a complete 7-partite graph of order 28

A decomposition of the complete 7-partite graph on 28 vertices where each set in the partition has four vertices is given. Several unusual properties of this decomposition are discussed, giving rise to several natural questions.     

An efficient algorithm for solving the incompressible fluid flow equations

The present paper reports on a modified pressure implicit predictor corrector type scheme for solving the flow governing equations, in which a consistent formulation is combined with a multi-grid solver for the pressure correction. In addition a parabolic sublayer (PSL) approach for the treatment of the flow in the vicinity of solid walls is critically evaluated in terms of accuracy and computational efficiency. The lid-driven cavity flow is chosen as the test case and results are presented for Reynolds numbers ranging from 100 to 1000. Predictions with the proposed scheme indicate substantial computational savings and fairly good agreement when compared with previous work. The PSL approach reduces the computing time, but with increasing Reynolds numbers the accuracy of the solutions tends to deteriorate.