A Two‐Parameter Stabilized Finite Element Method for Incompressible Flows

Based on two‐grid discretizations, a two‐parameter stabilized finite element method for the steady incompressible Navier–Stokes equations at high Reynolds numbers is presented and studied. In this method, a stabilized Navier–Stokes problem is first solved on a coarse grid, and then a correction is calculated on a fine grid by solving a stabilized linear problem. The stabilization term for the nonlinear Navier–Stokes equations on the coarse grid is based on an elliptic projection, which projects higher‐order finite element interpolants of the velocity into a lower‐order finite element interpolation space. For the linear problem on the fine grid, either the same stabilization approach (with a different stabilization parameter) as that for the coarse grid problem or a completely different stabilization approach could be employed. Error bounds for the discrete solutions are estimated. Algorithmic parameter scalings of the method are also derived. The theoretical results show that, with suitable scalings of the algorithmic parameters, this method can yield an optimal convergence rate. Numerical results are provided to verify the theoretical predictions and demonstrate the effectiveness of the proposed method. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 425–444, 2017     

Analysis of Two Linearized Problems Modeling Viscous Two‐Layer Flows

Two problems that appear in the linearization of certain free boundary value problems of the hydrodynamics of two viscous fluids are studied in the strip‐like domain Π = {x = (x₁, x₂) ∈ ℝ² : x₁ ∈ ℝ¹, (0 < x₂ < h_*) ∨ (h_* < x₂ < 1)}. The first problem arises in the linearization of a two‐layer flow down a geometrically perturbed inclined plane. The second one appears after the linearization of a two‐layer flow in a geometrically perturbed inclined channel with one moving (smooth) wall. For this purpose the unknown flow domain was mapped onto the double strip Π. The arising linear elliptic problems contain additional unknown functions in the boundary conditions. The paper is devoted to the investigation of these boundary problems by studying the asymptotics of the eigenvalues of corresponding operator pencils. It can be proved that the boundary value problems are uniquely solvable in weighted Sobolev spaces with exponential weight. The study of the full (nonlinear) free boundary value problems will be the topic of a forthcoming paper.     

Global Solutions of Two‐Dimensional Incompressible Viscoelastic Flows with Discontinuous Initial Data

The global existence of weak solutions of the incompressible viscoelastic flows in two spatial dimensions has been a longstanding open problem, and it is studied in this paper. We show global existence if the initial deformation gradient is close to the identity matrix in L² ∩ L^∞ and the initial velocity is small in L² and bounded in L^p for some p > 2. While the assumption on the initial deformation gradient is automatically satisfied for the classical Oldroyd‐B model, the additional assumption on the initial velocity being bounded in L^p for some p > 2 may due to techniques we employed. The smallness assumption on the L² norm of the initial velocity is, however, natural for global well‐posedness. One of the key observations in the paper is that the velocity and the “ effective viscous flux” are sufficiently regular for positive time. The regularity of leads to a new approach for the pointwise estimate for the deformation gradient without using L^∞ bounds on the velocity gradients in spatial variables. © 2015 Wiley Periodicals, Inc.     

Remarks on a Strongly Nonlinear Model for Two‐Layer Flows with a Top Free Surface

We revisit in this paper the strongly nonlinear long wave model for large amplitude internal waves in two‐layer flows with a free surface proposed by Choi and Camassa [1] and Barros et al. [2]. Its solitary‐wave solutions were the object of the work by Barros and Gavrilyuk [3], who proved that such solutions are governed by a Hamiltonian system with two degrees of freedom. A detailed analysis of the critical points of the system is presented here, leading to some new results. It is shown that conjugate states for the long wave model are the same as those predicted by the fully nonlinear Euler equations. Some emphasis will be given to the baroclinic mode, where interfacial waves are known to change polarity according to different values of density and depth ratios. A critical depth ratio separates these two regimes and its analytical expression is derived directly from the model. In addition, we prove that such waves cannot exist throughout the whole range of speeds.     

Generalized Quadrangles and Transitive Pseudo‐Hyperovals

A pseudo‐hyperoval of a projective space , q even, is a set of subspaces of dimension such that any three span the whole space. We prove that a pseudo‐hyperoval with an irreducible transitive stabilizer is elementary. We then deduce from this result a classification of the thick generalized quadrangles that admit a point‐primitive, line‐transitive automorphism group with a point‐regular abelian normal subgroup. Specifically, we show that is flag‐transitive and isomorphic to , where is either the regular hyperoval of PG(2, 4) or the Lunelli–Sce hyperoval of PG(2, 16).     

Pseudo‐c‐archimedean and pseudo‐finite cyclically ordered groups

Robinson and Zakon gave necessary and sufficient conditions for an abelian ordered group to satisfy the same first‐order sentences as an archimedean abelian ordered group (i.e., which embeds in the group of real numbers). The present paper generalizes their work to obtain similar results for infinite subgroups of the group of unimodular complex numbers. Furthermore, the groups which satisfy the same first‐order sentences as ultraproducts of finite cyclic groups are characterized.     

Pseudo‐reflection phenomena for singularities in thin elastic shells

We consider problems of statics of thin elastic shells with hyperbolic middle surface subjected to boundary conditions ensuring the geometric rigidity of the surface. The asymptotic behaviour of the solutions when the relative thickness tends to zero is then given by the membrane approximation. It is a hyperbolic problem propagating singularities along the characteristics. We address here the reflection phenomena when the propagated singularities arrive to a boundary. As the boundary conditions are not the classical ones for a hyperbolic system, there are various cases of reflection. Roughly speaking, singularities provoked elsewhere are not reflected at all at a free boundary, whereas at a fixed (or clamped) boundary the reflected singularity is less singular than the incident one. Reflection of singularities provoked along a non‐characteristic curve C are also considered. Copyright © 2003 John Wiley & Sons, Ltd.     

Two‐grid methods for time‐harmonic Maxwell equations

In this paper, we develop several two‐grid methods for the Nédélec edge finite element approximation of the time‐harmonic Maxwell equations. We first present a two‐grid method that uses a coarse space to solve the original problem and then use a fine space to solve a corresponding symmetric positive definite problem. Then, we present two types of iterative two‐grid methods, one is to add the kernel of the curl ‐operator in the fine space to a coarse mesh space to solve the original problem and the other is to use an inner iterative method for dealing with the kernel of the curl ‐operator in the fine space and the coarse space, separately. We provide the error estimates for the first two methods and present numerical experiments to show the efficiency of our methods.Copyright © 2012 John Wiley & Sons, Ltd.     

Two‐stage algorithms for covering array construction

Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, functionally correct components may interact in unforeseen ways to cause a fault. Covering arrays are used to test for interactions among components systematically. A two‐stage framework, providing a number of concrete algorithms, is developed for the efficient construction of covering arrays. In the first stage, a time and memory efficient randomized algorithm covers most of the interactions. In the second stage, a more sophisticated search covers the remainder in relatively few tests. In this way, the storage limitations of the sophisticated search algorithms are avoided; hence, the range of the number of components for which the algorithm can be applied is extended, without increasing the number of tests. Many of the framework instantiations can be tuned to optimize a memory‐quality trade‐off, so that fewer tests can be achieved using more memory.     

Two‐grid methods for semilinear interface problems

In this article, we consider two‐grid finite element methods for solving semilinear interface problems in d space dimensions, for d = 2 or d = 3. We consider semilinear problems with discontinuous diffusion coefficients, which includes problems containing subcritical, critical, and supercritical nonlinearities. We establish basic quasioptimal a priori error estimates for Galerkin approximations. We then design a two‐grid algorithm consisting of a coarse grid solver for the original nonlinear problem, and a fine grid solver for a linearized problem. We analyze the quality of approximations generated by the algorithm and show that the coarse grid may be taken to have much larger elements than the fine grid, and yet one can still obtain approximation quality that is asymptotically as good as solving the original nonlinear problem on the fine mesh. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Bounds and Constructions for Two‐Dimensional Variable‐Weight Optical Orthogonal Codes

Optical orthogonal codes (1D constant‐weight OOCs or 1D CWOOCs) were first introduced by Salehi as signature sequences to facilitate multiple access in optical fibre networks. In fiber optic communications, a principal drawback of 1D CWOOCs is that large bandwidth expansion is required if a big number of codewords is needed. To overcome this problem, a two‐dimensional (2D) (constant‐weight) coding was introduced. Many optimal 2D CWOOCs were obtained recently. A 2D CWOOC can only support a single QoS (quality of service) class. A 2D variable‐weight OOC (2D VWOOC) was introduced to meet multiple QoS requirements. A 2D VWOOC is a set of 0, 1 matrices with variable weight, good auto, and cross‐correlations. Little is known on the construction of optimal 2D VWOOCs. In this paper, new upper bound on the size of a 2D VWOOC is obtained, and several new infinite classes of optimal 2D VWOOCs are obtained.     

3‐Flows and Combs

Tutte's 3‐Flow Conjecture states that every 2‐edge‐connected graph with no 3‐cuts admits a 3‐flow. The 3‐Flow Conjecture is equivalent to the following: let G be a 2‐edge‐connected graph, let S be a set of at most three vertices of G; if every 3‐cut of G separates S then G has a 3‐flow. We show that minimum counterexamples to the latter statement are 3‐connected, cyclically 4‐connected, and cyclically 7‐edge‐connected.     

Uniqueness of Tangent Cones for Two‐Dimensional Almost‐Minimizing Currents

We consider two‐dimensional integer rectifiable currents that are almost area minimizing and show that their tangent cones are everywhere unique. Our argument unifies a few uniqueness theorems of the same flavor, which are all obtained by a suitable modification of White's original theorem for area‐minimizing currents in the euclidean space. This note is also the first step in a regularity program for semicalibrated two‐dimensional currents and spherical cross sections of three‐dimensional area‐minimizing cones.© 2017 Wiley Periodicals, Inc.     

Two‐sided Group Digraphs and Graphs

We study a family of digraphs (directed graphs) that generalises the class of Cayley digraphs. For nonempty subsets of a group G, we define the two‐sided group digraph to have vertex set G, and an arc from x to y if and only if for some and . In common with Cayley graphs and digraphs, two‐sided group digraphs may be useful to model networks as the same routing and communication scheme can be implemented at each vertex. We determine necessary and sufficient conditions on L and R under which may be viewed as a simple graph of valency , and we call such graphs two‐sided group graphs. We also give sufficient conditions for two‐sided group digraphs to be connected, vertex‐transitive, or Cayley graphs. Several open problems are posed. Many examples are given, including one on 12 vertices with connected components of sizes 4 and 8.     

Two‐step Newton‐type methods for solving inverse eigenvalue problems

In this paper, we apply the two‐step Newton method to solve inverse eigenvalue problems, including exact Newton, Newton‐like, and inexact Newton‐like versions. Our results show that both two‐step Newton and two‐step Newton‐like methods converge cubically, and the two‐step inexact Newton‐like method is super quadratically convergent. Numerical implementations demonstrate the effectiveness of new algorithms.     

Two‐level preconditioners for serendipity finite element matrices

In this paper an approach to construct algebraic multilevel preconditioners for serendipity finite element matrices is presented. Two‐level preconditioners constructed in the paper allow to obtain multilevel preconditioners in serendipity case using multilevel preconditioners for linear finite element matrices. Copyright © 2006 John Wiley & Sons, Ltd.     

Two‐grid methods for mixed finite‐element solution of coupled reaction‐diffusion systems

We develop 2‐grid schemes for solving nonlinear reaction‐diffusion systems: where p = (p, q) is an unknown vector‐valued function. The schemes use discretizations based on a mixed finite‐element method. The 2‐grid approach yields iterative procedures for solving the nonlinear discrete equations. The idea is to relegate all the Newton‐like iterations to grids much coarser than the final one, with no loss in order of accuracy. The iterative algorithms examined here extend a method developed earlier for single reaction‐diffusion equations. An application to prepattern formation in mathematical biology illustrates the method's effectiveness. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 589–604, 1999     

Singular Limits of Stiff Relaxation and Dominant Diffusion for Nonlinear Systems

We are concerned with singular limits of stiff relaxation and dominant diffusion for general 2×2 nonlinear systems of conservation laws, that is, the relaxation time τ tends to zero faster than the diffusion parameter ε, τ=o(ε), ε→0. We establish the following general framework: If there exists an a priori L^∞ bound that is uniformly with respect to ε for the solutions of a system, then the solution sequence converges to the corresponding equilibrium solution of this system. Our results indicate that the convergent behavior of such a limit is independent of either the stability criterion or the hyperbolicity of the corresponding inviscid quasilinear systems, which is not the case for other type of limits. This framework applies to some important nonlinear systems with relaxation terms, such as the system of elasticity, the system of isentropic fluid dynamics in Eulerian coordinates, and the extended models of traffic flows. The singular limits are also considered for some physical models, without L^∞ bounded estimates, including the system of isentropic fluid dynamics in Lagrangian coordinates and the models of traffic flows with stiff relaxation terms. The convergence of solutions in L^p to the equilibrium solutions of these systems is established, provided that the relaxation time τ tends to zero faster than ε.