Nonconforming finite element method for nonlinear parabolic equations

<正> A nonconforming finite element method for the nonlinear parabolic equations is studied inthis paper.The convergence analysis is presented and the optimal error estimate in L~2(‖·‖_h)norm isobtained through Ritz projection technique,where ‖·‖_h is a norm over the finite element space.     

A discontinuous Galerkin method combined with mixed finite element for seawater intrusion problem

<正> Seawater intrusion problem is considered in this paper.Its mathematical model is anonlinear coupled system of partial differential equations with initial boundary problem.It consistsof the water head equation and the salt concentration equation.A combined method is developedto approximate the water head equation by mixed finite element method and concentration equationby discontinuous Galerkin method.The scheme is continuous in time and optimal order estimates inH~1-norm and L~2-norm are derived for the errors.     

ACCURACY ANALYSIS FOR QUASI-CAREY ELEMENT*

In this paper, a new triangular element （Quasi-Carey element） is constructed by the idea of Specht element. It is shown that this Quasi-Carey element possesses a very special property, i.e., the consistency error is of order O（h^2）, one order higher than its interpolation error when the exact solution belongs to H^3（Ω）. However, the interpolation error and consistency error of Carey element are of order O（h）. It seems that the above special property has never been seen for other triangular elements for the second order problems.     

L ∞-estimates of mixed finite element methods for general nonlinear optimal control problems

This paper investigates L~∞-estimates for the general optimal control problems governed by two-dimensional nonlinear elliptic equations with pointwise control constraints using mixed finite element methods.The state and the co-state are approximated by the lowest order Raviart-Thomas mixed finite element spaces and the control is approximated by piecewise constant functions.The authors derive L~∞-estimates for the mixed finite element approximation of nonlinear optimal control problems.Finally,the numerical examples are given.     

Finite volume element method with Lagrangian cubic functions

This paper establishes a new finite volume element scheme for Poisson equation on triangular meshes. The trial function space is taken as Lagrangian cubic finite element space on triangular partition, and the test function space is defined as piecewise constant space on dual partition. Under some weak condition about the triangular meshes, the authors prove that the stiffness matrix is uniformly positive definite and convergence rate to be O(h ³) in H ¹-norm. Some numerical experiments confirm the theoretical considerations.     

High accuracy analysis of tensor-product linear pentahedral finite elements for variable coefficient elliptic equations

For a general second-order variable coefficient elliptic boundary value problem in three dimensions,the authors derive the weak estimate of the first type for tensor-product linear pentahedral finite elements.In addition,the estimate for the W^1,1 -seminorm of the discrete derivative Green’s function is given.Finally,the authors show that the derivatives of the finite element solution u_h and the corresponding interpolantΠ_u are superclose in the pointwise sense of the L^∞-norm.     

Least-squares Galerkin procedure for second-order hyperbolic equations

This paper proposes the least-squares Galerkin finite element scheme to solve second-order hyperbolic equations. The convergence analysis shows that the method yields the approximate solutions with optimal accuracy in (L ²(Ω))² × L ²(Ω) norms. Moreover, the method gets the approximate solutions with second-order accuracy in time increment. A numerical example testifies the efficiency of the novel scheme.     

Transient Queue Size Distribution Solution of Geom / G / 1 Queue with Feedback-A Recursive Method

This paper considers the Geom / G / 1 queueing model with feedback according to a late arrival system with delayed access (LASDA). Using recursive method, this paper studies the transient property of the queue size from the initial state N(0⁺) = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n ⁺ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n ⁻, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered (being different from the relations given in M / G / 1 queueing system). The model discussed in this paper can be widely applied in all kinds of communications and computer network. This research is supported by the National Natural Science Foundation of China under Grant No. 70871084, the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001, and the Scientific Research Fund of Southwestern University of Finance and Economics.     

Model checking for general linear error-in-covariables model with validation data

In this paper, model checking problem is considered for general linear model when covariables are measured with error and an independent validation data set is available. Without assuming any error model structure between the true variable and the surrogate variable, the author first apply nonparametric method to model the relationship between the true variable and the surrogate variable with the help of the validation sample. Then the author construct a score-type test statistic through model adjustment. The large sample behaviors of the score-type test statistic are investigated. It is shown that the test is consistent and can detect the alternative hypothesis close to the null hypothesis at the rate n ^−r with 0 ≤ r ≤ 1/2. Simulation results indicate that the proposed method works well.     

FORCED OSCILLATIONS OF A CLASS OF NONLINEAR DISPERSIVE WAVE EQUATIONS AND THEIR STABILITY

It has been observed in laboratory experiments that when nonlinear dispersive waves are forced periodically from one end of undisturbed stretch of the medium of propagation, the signal eventually becomes temporally periodic at each spatial point. The observation has been confirmed mathematically in the context of the damped Korteweg-de Vries （KdV） equation and the damped Benjamin-Bona-Mahony （BBM） equation. In this paper we intend to show the same results hold for the pure KdV equation （without the damping terms） posed on a finite domain. Consideration is given to the initial-boundary-value problem {ut＋ux＋uux＋uxxx=0, u（x,0）=φ（x）, 0〈x〈1, t〉0,u（0,t）=h（t）, u（1,t） = 0, ux（1,t） = 0, t〉0.It is shown that if the boundary forcing h is periodic with small ampitude, then the small amplitude solution u of （＊） becomes eventually time-periodic. Viewing （＊） （without the initial condition） as an infinite-dimensional dynamical system in the Hilbert space L^2（0, 1）, we also demonstrate that for a given periodic boundary forcing with small amplitude, the system （＊） admits a （locally） unique limit cycle, or forced oscillation, which is locally exponentially stable. A list of open problems are included for the interested readers to conduct further investigations.     

Two-scale finite element Green’s function approximations with applications to electrostatic potential computation

<正> In this paper,a two-scale finite element approach is proposed and analyzed for approximationsof Green's function in three-dimensions.This approach is based on a two-scale finite elementspace defined,respectively,on the whole domain with size H and on some subdomain containing singularpoints with size h (h H).It is shown that this two-scale discretization approach is very efficient.In particular,the two-scale discretization approach is applied to solve Poisson-Boltzmann equationssuccessfully.     

EXTENDED CLUSTERING COEFFICIENTS：GENERALIZATION OF CLUSTERING COEFFICIENTS IN SMALL-WORLD NETWORKS

The clustering coefficient C of a network, which is a measure of direct connectivity between neighbors of the various nodes, ranges from 0 （for no connectivity） to 1 （for full connectivity）. We define extended clustering coefficients C（h） of a small-world network based on nodes that are at distance h from a source node, thus generalizing distance-1 neighborhoods employed in computing the ordinary clustering coefficient C = C（1）. Based on known results about the distance distribution Pδ（h） in a network, that is, the probability that a randomly chosen pair of vertices have distance h, we derive and experimentally validate the law Pδ（h）C（h） ≤ c log N / N, where c is a small constant that seldom exceeds 1. This result is significant because it shows that the product Pδ（h）C（h） is upper-bounded by a value that is considerably smaller than the product of maximum values for Pδ（h） and C（h）. Extended clustering coefficients and laws that govern them offer new insights into the structure of small-world networks and open up avenues for further exploration of their properties.     

An Adjusted Gray Map Technique for Constructing Large Four-Level Uniform Designs

A uniform experimental design (UED) is an extremely used powerful and efficient methodology for designing experiments with high-dimensional inputs, limited resources and unknown underlying models. A UED enjoys the following two significant advantages: (i) It is a robust design, since it does not require to specify a model before experimenters conduct their experiments; and (ii) it provides uniformly scatter design points in the experimental domain, thus it gives a good representation of this domain with fewer experimental trials (runs). Many real-life experiments involve hundreds or thousands of active factors and thus large UEDs are needed. Constructing large UEDs using the existing techniques is an NP-hard problem, an extremely time-consuming heuristic search process and a satisfactory result is not guaranteed. This paper presents a new effective and easy technique, adjusted Gray map technique (AGMT), for constructing (nearly) UEDs with large numbers of four-level factors and runs by converting designs with s two-level factors and n runs to (nearly) UEDs with 2^t?1s four-level factors and 2^tn runs for any t ≥ 0 using two simple transformation functions. Theoretical justifications for the uniformity of the resulting four-level designs are given, which provide some necessary and/or sufficient conditions for obtaining (nearly) uniform four-level designs. The results show that the AGMT is much easier and better than the existing widely used techniques and it can be effectively used to simply generate new recommended large (nearly) UEDs with four-level factors.

     

Functional coefficient autoregressive conditional root model

This paper proposes an extended model based on ACR model:Functional coefficient autoregressive conditional root model（FCACR）.Under some assumptions,the authors show that the process is geometrically ergodic,stationary and all moments of the process exist.The authors use the polynomial spline function to approximate the functional coefficient,and show that the estimate is consistent with the rate of convergence O_p(h^v+1+n^-1/3).By simulation study,the authors discover the proposed method can approximate well the real model.Furthermore,the authors apply the model to real exchange rate data analysis.     

CONVERGENCE PROPERTIES OF THE DEPENDENT PRP CONJUGATE GRADIENT METHODS

In this paper, a new region of βk with respect to ;βk^PRP is given. With two Armijo-type line searches, the authors investigate the global convergence properties of the dependent PRP conjugate gradient methods, which extend the global convergence results of PRP conjugate gradient method proved by Grippo and Lucidi （1997） and Dai and Yuan （2002）.     

THE HAMMING DISTANCES OF NEGACYCLIC CODES OF LENGTH 2^s OVER GR （2^α, m）

The Hamming distances of all negacyclic codes of length 28 over the Gaiois ring GR （2^α, m） are given. In particular, the Lee distances of all negacyclic codes over Z4 of length 2^s are obtained. The Gray images of such negacyclic codes over Z4 are also determined under the Gray map.     

A MacWilliams type identity on Lee weight for linear codes over \mathbb{F}_2 + u\mathbb{F}_2^*

In this paper,the MacWilliams type identity for the m-ply Lee weight enumerator for linear codes over F₂ + uF₂ is determined.As an application of this identity,the authors obtain a MacWilliams type identity on Lee weight for linear codes over F_2^m+ uF_2^m.Furthermore,the authors prove a duality for the m-ply Lee weight distributions by taking advantage of the Krawtchouk polynomials.     

Orthogonal Arrays Robust to a Specified Set of Nonnegligible Effects

This paper considers experimental situations where the interested effects have to be orthogonal to a set of nonnegligible effects.It is shown that various types of orthogonal arrays with mixed strength are A-optimal for estimating the parameters in ANOVA high dimension model representation.Both cases including interactions or not are considered in the model.In particularly,the estimations of all main effects are A-optimal in a mixed strength(2,2)_3 orthogonal array and the estimations of all main effects and two-factor interactions in G_1×G_2 are A-optimal in a mixed strength(2,2)_4 orthogonal array.The properties are also illustrated through a simulation study.     

Upwind finite volume element methods for one-dimensional semiconductor device

A fully discrete implicit Euler upwind finite volume element method is derived and studied for one-dimensional semiconductor device. Upwind scheme is introduced to deal with the convection-dominated diffusion equations in the semiconductor model. With different time steps for the electrostatic potential and the other unknown quantities, the computational procedure of the method is obtained. The local mass conservation laws are preserved under the framework of the upwind finite volume element schemes. A first-order accuracy in the L ²-norm is proved. Numerical experiments are given to validate the usefulness and efficiency of the method.     

Proper reparametrization for inherently improper unirational varieties

In this paper, a class of lattice supports in the lattice space Z ^m is found to be inherently improper because any rational parametrization from C ^m to C ⁿ defined on such a support is improper. The improper index for such a lattice support is defined to be the gcd of the normalized volumes of all the simplex sub-supports. The structure of an improper support S is analyzed and shrinking transformations are constructed to transform S to a proper one. For a generic rational parametrization RP defined on an improper support S, we prove that its improper index is the improper index of S and give a proper reparametrization algorithm for RP. Finally, properties for rational parametrizations defined on an improper support and with numerical coefficients are also considered.