Superconvergence of H 1-Galerkin mixed finite element methods for parabolic problems

In this article, we study the semidiscrete H ¹-Galerkin mixed finite element method for parabolic problems over rectangular partitions. The well-known optimal order error estimate in the L ²-norm for the flux is of order 𝒪(h ^k+1) (SIAM J. Numer. Anal. 35 (2), (1998), pp. 712–727), where k ≥ 1 is the order of the approximating polynomials employed in the Raviart–Thomas element. We derive a superconvergence estimate of order 𝒪(h ^k+3) between the H ¹-Galerkin mixed finite element approximation and an appropriately defined local projection of the flux variable when k ≥ 1. A the new approximate solution for the flux with superconvergence of order 𝒪(h ^k+3) is realized via a postprocessing technique using local projection methods.     

Piecewise-linear,discontinuous Galerkin method for a fractional diffusion equation

We use a piecewise-linear, discontinuous Galerkin method for the time discretization of a fractional diffusion equation involving a parameter in the range − 1 < α < 0. Our analysis shows that, for a time interval (0,T) and a spatial domain Ω, the error in L_￥((0,T);L₂(W))L_\infty\bigr((0,T);L_2(\Omega)\bigr) is of order k ^2 + α , where k denotes the maximum time step. Since derivatives of the solution may be singular at t = 0, our result requires the use of non-uniform time steps. In the limiting case α = 0 we recover the known O(k ²) convergence for the classical diffusion (heat) equation. We also consider a fully-discrete scheme that employs standard (continuous) piecewise-linear finite elements in space, and show that the additional error is of order h ²log(1/k). Numerical experiments indicate that our O(k ^2 + α ) error bound is pessimistic. In practice, we observe O(k ²) convergence even for α close to − 1.     

Error estimates of a linear decoupled Euler–FEM scheme for a mass diffusion model

We present error estimates of a linear fully discrete scheme for a three-dimensional mass diffusion model for incompressible fluids (also called Kazhikhov–Smagulov model). All unknowns of the model (velocity, pressure and density) are approximated in space by C ⁰-finite elements and in time an Euler type scheme is used decoupling the density from the velocity–pressure pair. If we assume that the velocity and pressure finite-element spaces satisfy the inf–sup condition and the density finite-element space contains the products of any two discrete velocities, we first obtain point-wise stability estimates for the density, under the constraint lim_(h,k)→0 h/k = 0 (h and k being the space and time discrete parameters, respectively), and error estimates for the velocity and density in energy type norms, at the same time. Afterwards, error estimates for the density in stronger norms are deduced. All these error estimates will be optimal (of order O(h+k){\mathcal{O}(h+k)}) for regular enough solutions without imposing nonlocal compatibility conditions at the initial time. Finally, we also study two convergent iterative methods for the two problems to solve at each time step, which hold constant matrices (independent of iterations).     

Repelling periodic points of given periods of rational functions

Let R(z) be a rational function of degree d≥2. Then R(z) has at least one repelling periodic point of given period k≥2, unless k = 4 and d = 2, or k = 3 and d≤3, or k = 2 and d≤8. Examples show that all exceptional cases occur.     

A two-grid method with expanded mixed element for nonlinear reaction-diffusion equations

Expanded mixed finite element approximation of nonlinear reaction-diffusion equations is discussed. The equations considered here are used to model the hydrologic and bio-geochemical phenomena. To linearize the mixed-method equations, we use a two-grid method involving a small nonlinear system on a coarse gird of size H and a linear system on a fine grid of size h. Error estimates are derived which demonstrate that the error is O(△t + h k+1 + H 2k+2 d/2 ) (k ≥ 1), where k is the degree of the approximating space for the primary variable and d is the spatial dimension. The above estimates are useful for determining an appropriate H for the coarse grid problems.     

Remark on the phase shift in the Kuzmak-Whitham ansatz

We consider one-phase (formal) asymptotic solutions in the Kuzmak-Whitham form for the nonlinear Klein-Gordon equation and for the Korteweg-de Vries equation. In this case, the leading asymptotic expansion term has the form X(S(x, t)/h+Φ(x, t), I(x, t), x, t) +O(h), where h ≪ 1 is a small parameter and the phase S}(x, t) and slowly changing parameters I(x, t) are to be found from the system of “averaged” Whitham equations. We obtain the equations for the phase shift Φ(x, t) by studying the second-order correction to the leading term. The corresponding procedure for finding the phase shift is then nonuniform with respect to the transition to a linear (and weakly nonlinear) case. Our observation, which essentially follows from papers by Haberman and collaborators, is that if we incorporate the phase shift Φ into the phase and adjust the parameter Ĩ by setting $ \tilde S $ \tilde S = S +hΦ+O(h ²),Ĩ = I + hI ₁ + O(h ²), then the functions $ \tilde S $ \tilde S (x, t, h) and Ĩ(x, t, h) become solutions of the Cauchy problem for the same Whitham system but with modified initial conditions. These functions completely determine the leading asymptotic term, which is X($ \tilde S $ \tilde S (x, t, h)/h, Ĩ(x, t, h), x, t) + O(h).     

A Priori Error Estimates for Finite Element Methods for H (2,1)-Elliptic Equations

The convergence of finite element methods for linear elliptic boundary value problems of second and forth order is well understood. In this article, we introduce finite element approximations of some linear semi-elliptic boundary value problem of mixed order on a two-dimensional rectangular domain Q. The equation is of second order in one direction and forth order in the other and appears in the optimal control of parabolic partial differential equations if one eliminates the control and the state (or the adjoint state) in the first order optimality conditions. We establish a regularity result and estimate for the finite element error of conforming approximations of this equation. The finite elements in use have a tensor product structure, in one dimension we use linear, quadratic or cubic Lagrange elements in the other dimension cubic Hermite elements. For these elements, we prove the error bound O(h ² + τ ^k ) in the energy norm and O((h ² + τ ^k )(h ² + τ)) in the L ²(Q)-norm.     

On Hong’s conjecture for power LCM matrices

A set S={x ₁,...,x _n } of n distinct positive integers is said to be gcd-closed if (x _i , x _j ) ∈ S for all 1 ⩽ i, j ⩽ n. Shaofang Hong conjectured in 2002 that for a given positive integer t there is a positive integer k(t) depending only on t, such that if n ⩽ k(t), then the power LCM matrix ([x _i , x _j ] ^t ) defined on any gcd-closed set S={x ₁,...,x _n } is nonsingular, but for n ⩾ k(t) + 1, there exists a gcd-closed set S={x ₁,...,x _n } such that the power LCM matrix ([x _i , x _j ] ^t ) on S is singular. In 1996, Hong proved k(1) = 7 and noted k(t) ⩾ 7 for all t ⩾ 2. This paper develops Hong’s method and provides a new idea to calculate the determinant of the LCM matrix on a gcd-closed set and proves that k(t) ⩾ 8 for all t ⩾ 2. We further prove that k(t) ⩾ 9 iff a special Diophantine equation, which we call the LCM equation, has no t-th power solution and conjecture that k(t) = 8 for all t ⩾ 2, namely, the LCM equation has t-th power solution for all t ⩾ 2.     

On the order of certain close to regular graphs without a matching of given size

A graph G is a {d, d+k}-graph, if one vertex has degree d+k and the remaining vertices of G have degree d. In the special case of k = 0, the graph G is d-regular. Let k, p ⩾ 0 and d, n ⩾ 1 be integers such that n and p are of the same parity. If G is a connected {d, d+k{-graph of order n without a matching M of size 2|M| = n − p, then we show in this paper the following: If d = 2, then k ⩾ 2(p + 2) and

Tension spline solution of nonlinear sine-Gordon equation

The sine-Gordon equation plays an important role in modern physics. By using spline function approximation, two implicit finite difference schemes are developed for the numerical solution of one-dimensional sine-Gordon equation. Stability analysis of the method has been given. It has been shown that by choosing the parameters suitably, we can obtain two schemes of orders O(k²+k²h²+h²)\mathcal{O}(k^{2}+k^{2}h^{2}+h^{2}) and O(k²+k²h²+h⁴)\mathcal{O}(k^{2}+k^{2}h^{2}+h^{4}). At the end, some numerical examples are provided to demonstrate the effectiveness of the proposed schemes.     

On projectively normal embeddings of generalk-gonal curves

Fix integersg, k andt witht>0,k≥3 andtk<g/2−1. LetX be a generalk-gonal curve of genusg andR∈Pic ^k (X) the uniqueg _k ¹ onX. SetL:=K _X⊗(R ^*)^⊗t.L is very ample. Leth _L:X→P(H ⁰(X, L)^*) be the associated embedding. Here we prove thath _L(X) is projectively normal. Ifk≥4 andtk<g/2−2 the curveh _L(X) is scheme-theoretically cut out by quadrics. The author was partially supported by MURST and GNSAGA of CNR (Italy).     

On polarized 3-folds (X, L) withg(L)=q(X)+1 andh 0(L)≥4

Let (X, L) be a polarized 3-fold over the complex number field. In [Fk3], we proved thatg(L)≥q(X) ifh ⁰(L)≥2 and moreover we classified (X, L) withh ⁰(L)≥3 andg(L)=q(X), whereg(L) is the sectional genus of (X, L) andq(X)=dimH ¹(O _X ) the irregularity ofX. In this paper we will classify polarized 3-folds (X, L) withh ⁰(L)≥4 andg(L)=q(X)+1 by the method of [Fk3].     

On thek dimensional Piatetski-Shapiro prime number theorem

Thek-dimensional Piatetski-Shapiro prime number problem fork⩾3 is studied. Let π(x ₁ c ₁,⋯,c _k ) denote the number of primesp withp⩽x, , where 1<c ₁<⋯<c _k are fixed constants. It is proved that π(x;c ₁,⋯,c _k ) has an asymptotic formula ifc ₁ ⁻¹ +⋯+c _k ⁻¹ >k−k/(4k ²+2). Project supported by the National Natural Science Foundation of China (Grant No. 19801021) and the Natural Science Foundation of Shandong Province (Grant No.Q98A02110).     

On the general additive divisor problem

We obtain a new upper bound for the sum Σ _h≤H Δ _k (N, h) when 1 ≤ H ≤ N, k ∈ ℕ, k ≥ 3, where Δ _k (N, h) is the (expected) error term in the asymptotic formula for Σ _N<n≤2N d _k (n)d _k (n + h), and d _k (n) is the divisor function generated by ζ(s) ^k . When k = 3, the result improves, for H ≥ N ^1/2, the bound given in a recent work of Baier, Browning, Marasingha and Zhao, who dealt with the case k = 3.     

On extremal sizes of locally k-tree graphs

A graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k ⩾ 0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k ⩾ 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the number of edges in an n-vertex locally k-tree graph is between Ω(n) and O(n ²), where both bounds are asymptotically tight. In contrast, the number of edges in an n-vertex k-tree is always linear in n.     

On conditional edge-connectivity of graphs

1. IntroductionIn this paper, a graph G ~ (V,E) always means a simple graph (without loops andmultiple edges) with the vertex-set V and the edge-set E. We follow [1] for graph-theoreticalterllilnology and notation not defined here.It is well known that when the underlying topology of a computer interconnectionnetwork is modeled by a graph G, the edge-connectivity A(G) of G is an important measurefor fault-tolerance of the network. However, it has many deficiencies (see [2]). MotiVatedby t…     

Primarite DeL p(L r), 1<p,r<∞

In this article we show thatL ^p(L ^r) is primary forp andr in ]1,+∞[. If (h _k) _k≧1 denote the Haar basis, we begin with a study of the sequence (h _k ⊗h _i) and, in particular, the space generated by a subsequence of this sequence. In the first part we study the base ofL ^p(L ^r) and in the second part we show that this space is primary.     

On the Perfect Matchings of Near Regular Graphs

Let k, h be positive integers with k ≤ h. A graph G is called a [k, h]-graph if k ≤ d(v) ≤ h for any v ? V(G){v \in V(G)}. Let G be a [k, h]-graph of order 2n such that k ≥ n. Hilton (J. Graph Theory 9:193–196, 1985) proved that G contains at least ?k/3?{\lfloor k/3\rfloor} disjoint perfect matchings if h = k. Hilton’s result had been improved by Zhang and Zhu (J. Combin. Theory, Series B, 56:74–89, 1992), they proved that G contains at least ?k/2?{\lfloor k/2\rfloor} disjoint perfect matchings if k = h. In this paper, we improve Hilton’s result from another direction, we prove that Hilton’s result is true for [k, k + 1]-graphs. Specifically, we prove that G contains at least ?\fracn3?+1+(k-n){\lfloor\frac{n}3\rfloor+1+(k-n)} disjoint perfect matchings if h = k + 1.     

The Crossing Number of P(N, 3)

 It is proved that the crossing number of the Generalized Petersen Graph P(3k+h,3) is k+h if h∈{0,2} and k+3 if h=1, for each k≥3, with the single exception of P(9,3), whose crossing number is 2. Received: May 7, 1999 Final version received: April 8, 2000     

On the weak non-defectivity of veronese embeddings of projective spaces

Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<( _n ^n+x ). Here we prove that the order x Veronese embedding ofP ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ singular at each point of S has dimension ( _n ^/n+x )−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I _2S (x)| has an ordinary double point at each P∈ S and Sing (F)=S. The author was partially supported by MIUR and GNSAGA of INdAM (Italy).