The molecule solution of an extended discrete LotkaVolterra equation is constructed, from which a new sequence transformation is proposed. A convergence acceleration algorithm for implementing this sequence transformation is found. It is shown that our new sequence transformation accelerates some kinds of linearly convergent sequences and factorially convergent sequences with good numerical stability. Some numerical examples are also presented.

Improving efficiency for regression coefficients and predicting trajectories of individuals are two important aspects in the analysis of longitudinal data. Both involve estimation of the covariance function. Yet challenges arise in estimating the covariance function of longitudinal data collected at irregular time points. A class of semiparametric models for the covariance function by that imposes a parametric correlation structure while allowing a nonparametric variance function is proposed. A kernel estimator for estimating the nonparametric variance function is developed. Two methods for estimating parameters in the correlation structurea quasi-likelihood approach and a minimum generalized variance methodare proposed. A semiparametric varying coefficient partially linear model for longitudinal data is introduced, and an estimation procedure for model coefficients using a profile weighted least squares approach

We study the front dynamics of the bistable reaction-diffusion equations with periodic diffusion and/or convection coefficients in several space dimensions. When traveling wave solutions exist, the solutions of the initial value problem behave as wave fronts propagating with the effective speeds of traveling waves under various initial conditions. Yet due to the bistable nature of the nonlinearity, traveling waves may not always exist when the medium variations from the mean states are large enough. Their existence is closely related to the detailed forms of diffusion and convection coefficients, more so in multidimension than in one. We present a simple sufficient condition for the nonexistence of traveling waves (quenching) using perturbation method. Our two dimensional finite difference numerical computations show a variety of front behaviors, such as: the propagation, quenching and retreat of fronts. We found

No abstract uploaded!

We study the convergence rate of Glimm scheme for general systems of hyperbolic conservation laws without the assumption that each characteristic field is either genuinely nonlinear or linearly degenerate. We first give a sharper estimate of the error arising from the wave tracing argument by a careful analysis of the interaction between small waves. With this key estimate, the convergence rate is shown to be o (1) s 1 3| ln s| 1+ , which is sharper compared to o (1) s 1 4| ln s| given in [T. Yang, Convergence rate of Glimm scheme for general systems of hyperbolic conservation laws, Taiwanese J. Math. 7 (2)(2003) 195205]. However, it is still slower than o (1) s 1 2| ln s| given in [A. Bressan, A. Marson, Error bounds for a deterministic version of the Glimm scheme, Arch. Ration. Mech. Anal. 142 (2)(1998) 155176] for systems with each characteristic field being genuinely nonlinear or linearly degenerate. Here s is the

The aim of this study is to figure out the optimization of survival probability of the generals in the card game "Legends of the Three Kingdoms". First, based on combinatorics and probability theory, the PASCAL program was performed to analyze the probabilities of success when several popular generals perform their special skills in the game. The results are as follows: Second, seven typical generals, including Zhou Tai, Zhang Jiao, Zhen Ji, Lu Xun, Ma Chao, Xiahou Dun, and Guo Jia, were chosen, and their abilities including attacking and defense were arbitrarily quantified according to a model constructed in the present study. The scores are as follows: Card-drawing Changing Attacking Defense Blood-selling Zhen Ji 5.62 Zhou Tai 1.04 Ma Chao 1.68 Xiahou Dun 1.19 Guo Jia 3.36 Lu Xun 3.55 Zhang Jiao 2.55 The abilities of different generals were sorted, and by comparison with the statistical record online, the reliability of the model was proved. Thus, the irrationality of the game is identified in this study, and we recommend the game designer to modify the abilities of some generals and to obtain an optimized value according to the output of the model, by which the game would be more popular.

The polygonal approximation problem is a primary problem in computer graphics, pattern recognition, CAD/CAM, etc. In $R^2$, the cone intersection method (CIM) is one of the most eÆcient algorithms for approximating polygonal curves. With CIM Eu and Toussaint, by imposing an additional constraint and changing the given error criteria, resolve the three-dimensional weighted minimum number polygonal approximation problem with the parallel-strip error criterion (PS-WMN) under $L_2$ norm. In this paper, without any additional constraint and change of the error criteria, a CIM solution to the same problem with the line segment error criterion (LS-WMN) is presented, which is more frequently encountered than the PS-WMN is. Its time complexity is $O(n^3)$, and the space complexity is $O(n^2)$. An approximation algorithm is also presented, which takes $O(n^2)$ time and $O(n)$ space. Results of some examples are given to illustrate the eÆciency of these algorithms.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

In this paper, we review some recent progress made in [4, 5, 6] on finite difference schemes for viscous incompressible flows using vorticity formulation. The main purpose of this series of papers [4, 5, 6] is to resurrect the idea of using local vorticity boundary condition for unsteady calculation. The emphasis is on simplicity of the methods. Three main issues will be discussed: efficient time-stepping procedures and cell Reynolds number constraints, efficient methods in 3D on non-staggered grids and efficient high order methods using compact differencing.

We prove that for a large class of functions P and Q, the discrete bilinear operator T P, Q (f, g)(n)= m Z{0} f (n P (m)) g (n Q (m)) 1 m is bounded from l 2 l 2 into l 1+ , for any (0, 1].

In this article, we consider the Lorentz cone complementarity problems in infinite-dimensional real Hilbert space. We establish several results that are standard and important when dealing with complementarity problems. These include proving the same growth of the FishcherBurmeister merit function and the natural residual merit function, investigating property of bounded level sets under mild conditions via different merit functions, and providing global error bounds through the proposed merit functions. Such results are helpful for further designing solution methods for the Lorentz cone complementarity problems in Hilbert space.

1. Motivation and basic concepts In this note, we consider two signomial functions whose convexity play important roles in some recent papers [4, 6, 7, 8, 9] dealing with geometric programming problems. However, the verifications therein contain some certain flaws and those incorrect arguments are repeatedly appeared and cited. From point of scientific researchs view, we hereby provide correct proofs for them.

We describe a high-resolution, real-time 3D absolute coordinate measurement system based on a phase-shifting method. It acquires 3D shape at 30 frames per second (fps), with 266K points per frame. A tiny marker is encoded in the projected fringe pattern, and detected by software from the texture image and the gamma map. Absolute 3D coordinates are obtained from the detected marker position and the calibrated system parameters. To demonstrate the performance of the system, we measure a hand moving over a depth distance of approximately 700 mm, and human faces with expressions. Applications of such a system include manufacturing, inspection, entertainment, security, medical imaging.

The solvability in Sobolev spaces is proved for divergence form complex-valued higher order parabolic systems in the whole space, on a half-space, and on a Reifenberg flat domain. The leading coefficients are assumed to be merely measurable in one spacial direction and have small mean oscillations in the orthogonal directions on each small cylinder. The directions in which the coefficients are only measurable vary depending on each cylinder. The corresponding elliptic problem is also considered.

For a path in a compact finite dimensional Alexandrov space X with curv  , the two basic geometric invariants are the length and the turning angle (which measures the closeness from being a geodesic). We show that the sum of the two invariants of any loop is bounded from below in terms of , the dimension, diameter, and Hausdorff measure of X. This generalizes a basic estimate of Cheeger on the length of a closed geodesic in a closed Riemannian manifold ([Ch], [GP1,2]). To see that the above result also generalizes and improves an analog of the Cheeger type estimate in Alexandrov geometry in [BGP], we show that for a class of subsets of X, the n-dimensional Hausdorff measure and rough volume are proportional by a constant depending on n = dim(X).

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

The existence of solution for the 2D-Keller-Segel system in the subcritical case, i.e. when the initial mass is less than 8π, is reproved. Instead of using the entropy in the free energy and free energy dissipation, which was used in the proofs (Blanchet et al. in SIAM J. Numer. Anal. 46:691–721, 2008; Electron. J. Differ. Equ. Conf. 44:32, 2006 (electronic)), the potential energy term is fully utilized by adapting Delort’s theory on 2D incompressible Euler equation (Delort in J. Am. Math. Soc. 4:553–386, 1991).

In this paper, we derive an a-posteriori error indicator for the Generalized Multiscale Finite Element Method (GMsFEM) framework. This error indicator is further used to develop an adaptive enrichment algorithm for the linear elliptic equation with multiscale high-contrast coefficients. The GMsFEM, which has recently been introduced in [13], allows solving multiscale parameter-dependent problems at a reduced computational cost by constructing a reduced-order representation of the solution on a coarse grid. The main idea of the method consists of (1) the construction of snapshot space,(2) the construction of the offline space, and (3) the construction of the online space (the latter for parameter-dependent problems). In [13], it was shown that the GMsFEM provides a flexible tool to solve multiscale problems with a complex input space by generating appropriate snapshot, offline, and online spaces. In this paper, we

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!