Superconvergence of a 3D finite element method for stationary Stokes and Navier‐Stokes problems

For the Poisson equation on rectangular and brick meshes it is well known that the piecewise linear conforming finite element solution approximates the interpolant to a higher order than the solution itself. In this article, this type of supercloseness property is established for a special interpolant of the Q₂ ? P element applied to the 3D stationary Stokes and Navier‐Stokes problem, respectively. Moreover, applying a Q₃ ? P postprocessing technique, we can also state a superconvergence property for the discretization error of the postprocessed discrete solution to the solution itself. Finally, we show that inhomogeneous boundary values can be approximated by the Lagrange Q₂‐interpolation without influencing the superconvergence property. Numerical experiments verify the predicted convergence rates. Moreover, a cost‐benefit analysis between the two third‐order methods, the post‐processed Q₂ ? P discretization, and the Q₃ ? P discretization is carried out. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Entropy Numbers in Weighted Function Spaces and Eigenvalue Distributions of Some Degenerate Pseudodifferential Operators II

This paper is the continuation of [17]. We investigate mapping and spectral properties of pseudodifferential operators of type Ψ with χ χ ? ? and 0 ≤ γ ≤ 1 in the weighted function spaces B (?ⁿ, w(x)) and F (?ⁿ, w(x)) treated in [17]. Furthermore, we study the distribution of eigenvalues and the behaviour of corresponding root spaces for degenerate pseudodifferential operators preferably of type b₂(x) b(x, D) b₁(x), where b₁(x) and b₂(x) are appropriate functions and b(x, D) ? Ψ. Finally, on the basis of the Birman-Schwinger principle, we deal with the “negative spectrum” (bound states) of related symmetric operators in L₂.     

Superconvergence for a time‐discretization procedure for the mixed finite element approximation of miscible displacement in porous media

A time‐stepping procedure is established and analyzed for the problem of miscible displacement in porous medium. The fluid velocity based on mixed element method is post‐processed by interpolation along Gauss lines. Error analysis shows that this procedure has a superconvergence error bound O(h) with respect to the parameter h_p, which is one order higher than the conventional Galerkin or mixed finite element procedures. Compared with the results in the references, the parameter constraint conditions in this article are obviously relaxed. © 2011Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

Subelliptic Estimates for a Class of Degenerate Elliptic Integro-Differential Operators

In this paper we prove subelliptic estimates for operators of the form Δ_x + λ² (x)S in ?^N = ? × ?, where the operator S is an elliptic integro - differential operator in ?^N and λ is a nonnegative Lipschitz continuous function.     

Stability of Cahn‐Hilliard fronts

We prove stability of the kink solution of the Cahn‐Hilliard equation ∂_tu = ∂( ∂u − u/2 + u³/2), x ∈ ℝ. The proof is based on an inductive renormalization group method, and we obtain detailed asymptotics of the solution as t → ∞. We prove stability of the kink solution of the Cahn‐Hilliard equation ∂_tu = ∂( ∂u − u/2 + u³/2), x ∈ ℝ. The proof is based on an inductive renormalization group method, and we obtain detailed asymptotics of the solution as t → ∞. © 1999 John Wiley & Sons, Inc.     

Enumeration of graphs by degree sequence

The degree sequence (d₀, d₁, …, d_p-1) of a graph G of order p is defined by d_k = the number of points of G of degree k. Methods of Robinson are extended to produce a generating function F(x₀, x₁, x₂, …) where the coefficient of x…x is the number of graphs of order p having degree sequence (d₀, …, d_p-1).     

On Σ1-definable Functions Provably Total in I ∏

We prove the following theorem: Let φ(x) be a formula in the language of the theory PA^? of discretely ordered commutative rings with unit of the form ?yφ′(x,y) with φ′ and let ∈ Δ₀ and let fφ: ? → ? such that f_φ(x) = y iff φ′(x,y) & (?z < y) φ′(x,z). If I ∏ ∈(?x ≥ 0), φ then there exists a natural number K such that I ∏ ? ?y?x(x > y ? ?φ(x) < x^K). Here I ∏₁^? denotes the theory PA^? plus the scheme of induction for formulas φ(x) of the form ?yφ′(x,y) (with φ′) with φ′ ∈ Δ₀.     

Iteratively reweighted least squares minimization for sparse recovery

Under certain conditions (known as the restricted isometry property, or RIP) on the m × N matrix Φ (where m < N), vectors x ∈ ?^N that are sparse (i.e., have most of their entries equal to 0) can be recovered exactly from y := Φx even though Φ^?1(y) is typically an (N ? m)—dimensional hyperplane; in addition, x is then equal to the element in Φ^?1(y) of minimal ??₁‐norm. This minimal element can be identified via linear programming algorithms. We study an alternative method of determining x, as the limit of an iteratively reweighted least squares (IRLS) algorithm. The main step of this IRLS finds, for a given weight vector w, the element in Φ^?1(y) with smallest ??₂(w)‐norm. If x⁽ⁿ⁾ is the solution at iteration step n, then the new weight w⁽ⁿ⁾ is defined by w := [|x|² + ε]^?1/2, i = 1, …, N, for a decreasing sequence of adaptively defined ε_n; this updated weight is then used to obtain x^{(n + 1)} and the process is repeated. We prove that when Φ satisfies the RIP conditions, the sequence x⁽ⁿ⁾ converges for all y, regardless of whether Φ^?1(y) contains a sparse vector. If there is a sparse vector in Φ^?1(y), then the limit is this sparse vector, and when x⁽ⁿ⁾ is sufficiently close to the limit, the remaining steps of the algorithm converge exponentially fast (linear convergence in the terminology of numerical optimization). The same algorithm with the “heavier” weight w = [|x|² + ε]^?1+τ/2, i = 1, …, N, where 0 < τ < 1, can recover sparse solutions as well; more importantly, we show its local convergence is superlinear and approaches a quadratic rate for τ approaching 0. © 2009 Wiley Periodicals, Inc.     

Entropy Numbers in Weighted Function Spaces and Eigenvalue Distributions of Some Degenerate Pseudodifferential Operators I

In this paper we study weighted function spaces of type B(?ⁿ, Q(x)) and F(?ⁿ, Q(x)), where Q(x) is a weight function of at most polynomial growth. Of special interest are the weight functions Q(x) = (1 + |x|²)^α/2 with α ? ?. The main result deals with estimates for the entropy numbers of compact embeddings between spaces of this type.     

On invariant measures of extensions of Markov transition functions

By using the LITTLEWOOD matrices A_2n we generalize CLARKSON' S inequalities, or equivalently, we determine the norms ‖A_2n: l(L_P) → l(L_P)‖ completely. The result is compared with the norms ‖A_2n: l → l‖, which are calculated implicitly in PIETSCH [6].     

Tangential Convergence of Temperatures and Harmonic Functions in Besov and in Triebel-Lizorkin Spaces

We study the maximal function Mf(x) = sup |f(x + y, t)| when Ω is a region in the (y,t) Ω upper half space R and f(x, t) is the harmonic extension to R₊^N+1 of a distribution in the Besov space B^α_p,q(R^N) or in the Triebel-Lizorkin space F^α_p,q(R^N). In particular, we prove that when Ω= {|_y|^{N/ (N-αp)} < t < 1} the operator M is bounded from F (R^N) into L^p (R^N). The admissible regions for the spaces B (R^N) with p < q are more complicated.     

Global attractor and decay estimates of solutions to a class of nonlinear evolution equations

In this work, we prove the existence of global attractor for the nonlinear evolution equation u_tt?Δu?Δu_t?Δu_tt + g(x, u)=f(x) in X=(H²(Ω)∩H(Ω)) × (H²(Ω)∩H(Ω)). This improves a previous result of Xie and Zhong in (J. Math. Anal. Appl. 2007; 336 :54–69.) concerning the existence of global attractor in H(Ω) × H(Ω) for a similar equation. Further, the asymptotic behavior and the decay property of global solution are discussed. Copyright © 2010 John Wiley & Sons, Ltd.     

Semilinear wave equation with time dependent potential

We consider the following semilinear wave equation: (1) for (t,x) ∈ ?_t × ?. We prove that if the potential V(t,x) is a measurable function that satisfies the following decay assumption: ∣V(t,x)∣?C(1+t)(1+∣x∣) for a.e. (t,x) ∈ ?_t × ? where C, σ₀>0 are real constants, then for any real number λ that satisfies there exists a real number ρ(f,g,λ)>0 such that the equation has a global solution provided that 0<ρ?ρ(f,g,λ). Copyright © 2004 John Wiley & Sons, Ltd.     

An artificial boundary condition for an advection–diffusion equation

Consider the advection–diffusion equation: u₁ + au_x1 ? vδu = 0 in ?ⁿ × ?⁺ with initial data u⁰; the Support of u⁰ is contained in ?(x₁ < 0) and a: ?ⁿ → ? is positive. In order to approximate the full space solution by the solution of a problem in ? × ?⁺, we propose the artificial boundary condition: u₁ + au_x1 = 0 on ∑. We study this by means of a transmission problem: the error is an O(v²) for small values of the viscosity v.     

On series of signed vectors and their rearrangements

Let x₁,…,x_m∈ \input amssym $ \Bbb R$ n be a sequence of vectors with ∥x_i∥₂ ≤ 1 for all i. It is proved that there are signs ε₁,…,ε_m = ±1 such that where C₁, C₂ are some numerical constants. It is also proved that there are signs ε,…,ε = ±1 and a permutation π of {1,…,m} such that where C^′ is some other numerical constant. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

A multilevel finite element method in space‐time for the Navier‐Stokes problem

A multilevel finite element method in space‐time for the two‐dimensional nonstationary Navier‐Stokes problem is considered. The method is a multi‐scale method in which the fully nonlinear Navier‐Stokes problem is only solved on a single coarsest space‐time mesh; subsequent approximations are generated on a succession of refined space‐time meshes by solving a linearized Navier‐Stokes problem about the solution on the previous level. The a priori estimates and error analysis are also presented for the J‐level finite element method. We demonstrate theoretically that for an appropriate choice of space and time mesh widths: h_j ～ h, k_j ～ k, j = 2, …, J, the J‐level finite element method in space‐time provides the same accuracy as the one‐level method in space‐time in which the fully nonlinear Navier‐Stokes problem is solved on a final finest space‐time mesh. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

On the Lorentz-Marcinkiewicz Operator Ideal

This article deals with the LORENTZ-MARCINKIEWICZ operator ideal ?? generated by an additive s-function and the LORENTZ-MARCINKIEWICZ sequence space λ^q(φ). We give eigenvalue distributions for operators belonging to ?? (E, E) and we show the interpolation properties of ??-ideals. Furthermore, we study certain SCHAUDER bases in ?? (H, K), H and K Hilbert spaces.     

Blowup for nonlinear wave equations describing boson stars

We consider the nonlinear wave equation modeling the dynamics of (pseudorelativistic) boson stars. For spherically symmetric initial data, u₀(x) ∈ C (?³), with negative energy, we prove blowup of u(t, x) in the H^1/2‐norm within a finite time. Physically this phenomenon describes the onset of “gravitational collapse” of a boson star. We also study blowup in external, spherically symmetric potentials, and we consider more general Hartree‐type nonlinearities. As an application, we exhibit instability of ground state solitary waves at rest if m = 0. © 2007 Wiley Periodicals, Inc.     

Longtime behavior for a nonlinear wave equation arising in elasto‐plastic flow

The paper studies the longtime behavior of solutions to the initial boundary value problem (IBVP) for a nonlinear wave equation arising in elasto‐plastic flow u_tt?div{|?u|^m?1?u}?λΔu_t+Δ²u+g(u)=f(x). It proves that under rather mild conditions, the dynamical system associated with above‐mentioned IBVP possesses a global attractor, which is connected and has finite Hausdorff and fractal dimension in the phase spaces X₁=H(Ω) × L²(Ω) and X=(H³(Ω)∩H(Ω)) × H(Ω), respectively. Copyright © 2008 John Wiley & Sons, Ltd.     

The circular chromatic number of the Mycielskian of G

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph μ(G), we now call the Mycielskian of G, which has the same clique number as G and whose chromatic number equals χ(G) + 1. Chang, Huang, and Zhu [G. J. Chang, L. Huang, & X. Zhu, Discrete Math, to appear] have investigated circular chromatic numbers of Mycielskians for several classes of graphs. In this article, we study circular chromatic numbers of Mycielskians for another class of graphs G. The main result is that χ_c(μ(G)) = χ(μ(G)), which settles a problem raised in [G. J. Chang, L. Huang, & X. Zhu, Discrete Math, to appear, and X. Zhu, to appear]. As χ_c(G) = and χ(G) = , consequently, there exist graphs G such that χ_c(G) is as close to χ(G) − 1 as you want, but χ_c(μ(G)) = χ(μ(G)). © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 63–71, 1999