Superconvergence of discontinuous Galerkin finite element method for the stationary Navier‐Stokes equations

This article focuses on discontinuous Galerkin method for the two‐ or three‐dimensional stationary incompressible Navier‐Stokes equations. The velocity field is approximated by discontinuous locally solenoidal finite element, and the pressure is approximated by the standard conforming finite element. Then, superconvergence of nonconforming finite element approximations is applied by using least‐squares surface fitting for the stationary Navier‐Stokes equations. The method ameliorates the two noticeable disadvantages about the given finite element pair. Finally, the superconvergence result is provided under some regular assumptions. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 23: 421–436, 2007     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

OnQ-order andR-order of convergence

We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper.     

Dynamical Running Mass of Quark in the Dyson-Schwinger Equation Approach

Based on the Dyson-Schwinger equations of QCD in the "rainbow" approximation, the fully dressed quarkpropagator Sf(p) is investigated, and then an algebraic parametrization form of the propagator is obtained as a solutionof the equations. The dressed quark amplitudes Af and Bf built up the fully dressed quark propagator and the dynamicalrunning masses Mf defined by Af and Bf for light quarks u, d and s are calculated, respectively. Using the predictedrunning masses Mf, quark condensates <0|q(0)q(0)|0> = -(0.255 GeV)a for u, d quarks, and <0|s s|0> = 0.8<0|q(0)q(0)]0)for s quark, and experimental pion decay constant fπ = 0.093 GeV, the masses of Goldstone bosons K, π, and η are alsoevaluated. The numerical results show that the masses of quarks are dependent on their momentum p2. The fully dressedquark amplitudes Af and Bf have correct behaviors which can be used for many purposes in our future researches onnonperturbative QCD.     

Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

OPTIMAL INSTAR PARASITIZATION IN A STAGE STRUCTURED HOST-PARASITOID MODEL

A stage structured host-parasitoid model is derived and the equilibria studied. It is shown under what conditions the parasitoid controls an exponentially growing host in the sense that a coexistence equilibrium exists. Furthermore, for host populations whose inherent growth rate is not too large it is proved that in order to minimize the adult host equilibrium level it is necessary that the parasitoids attack only one of the larval stages. It is also proved in this case that the minimum adult host equilibrium level is attained when the parasitoids attack that larval stage which also maximizes the expected number of emerging adult parasitoid per larva at equilibrium. Numerical simulations tentatively indicate that the first conclusion remains in general valid for the model. However, numerical studies also show that it is not true in general that the optimal strategy will maximize the number of emerging adult parasitoid per larva at equilibrium.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

Dynamics of liquid membranes. II: Adaptive finite difference methods

Two domain-adaptive finite difference methods are presented and applied to study the dynamic response of incompressible, inviscid, axisymmetric liquid membranes subject to imposed sinusoidal pressure oscillations. Both finite difference methods map the time-dependent physical domain whose downstream boundary is unknown onto a fixed computational domain. The location of the unknown time-dependent downstream boundary of the physical domain is determined from the continuity equation and results in an integrodifferential equation which is non-linearly coupled with the partial differential equations which govern the conservation of mass and linear momentum and the radius of the liquid membrane. One of the finite difference methods solves the non-conservative form of the governing equations by means of a block implicit iterative method. This method possesses the property that the Jacobian matrix of the convection fluxes has an eigenvalue of algebraic multiplicity equal to four and of geometric multiplicity equal to one. The second finite difference procedure also uses a block implicit iterative method, but the governing equations are written in conservation law form and contain an axial velocity which is the difference between the physical axial velocity and the grid speed. It is shown that these methods yield almost identical results and are more accurate than the non-adaptive techniques presented in Part I. It is also shown that the actual value of the pressure coefficient determined from linear analyses can be exceeded without affecting the stability and convergence of liquid membranes if the liquid membranes are subjected to sinusoidal pressure variations of sufficiently high frequencies.     

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.     

Optimal control of unsteady compressible viscous flows

The control of complex, unsteady flows is a pacing technology for advances in fluid mechanics. Recently, optimal control theory has become popular as a means of predicting best case controls that can guide the design of practical flow control systems. However, most of the prior work in this area has focused on incompressible flow which precludes many of the important physical flow phenomena that must be controlled in practice including the coupling of fluid dynamics, acoustics, and heat transfer. This paper presents the formulation and numerical solution of a class of optimal boundary control problems governed by the unsteady two‐dimensional compressible Navier–Stokes equations. Fundamental issues including the choice of the control space and the associated regularization term in the objective function, as well as issues in the gradient computation via the adjoint equation method are discussed. Numerical results are presented for a model problem consisting of two counter‐rotating viscous vortices above an infinite wall which, due to the self‐induced velocity field, propagate downward and interact with the wall. The wall boundary control is the temporal and spatial distribution of wall‐normal velocity. Optimal controls for objective functions that target kinetic energy, heat transfer, and wall shear stress are presented along with the influence of control regularization for each case. Copyright © 2002 John Wiley & Sons, Ltd.