一类常微分方程组的紧支撑样条小波方法探讨

应用三次紧支撑样条小波插值函数得到了求一类常微分方程组数值解的隐式公式,并求得到其局部截断误差为O(-h5).在此基础上给出1个显式校正求解公式,并讨论得到其局部截断误差为O(-h4).     

Degradative chain transfer in vinyl acetate polymerizations using toluene as solvent

In this work, we propose that retardation in vinyl acetate polymerization rate in the presence of toluene is due to degradative chain transfer. The transfer constant to toluene (C_trs) determined using the Mayo method is equal to 3.8 × 10^?3, which is remarkably similar to the value calculated from the rate data, assuming degradative chain transfer (2.7 × 10^?3). Simulations, including chain‐length‐dependent termination, were carried out to compare our degradative chain transfer model with experimental results. The conversion–time profiles showed excellent agreement between experiment and simulation. Good agreement was found for the M_n data as a function of conversion. The experimental and simulation data strongly support the postulate that degradative chain transfer is the dominant kinetic mechanism. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 3620–3625, 2007     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.     

Ergodic theory and the Strong Law of Large Numbers on Riesz spaces

In [W.-C. Kuo, C.C.A. Labuschagne, B.A. Watson, Discrete-time stochastic processes on Riesz spaces, Indag. Math. (N.S.) 15 (3) (2004) 435-451], we introduced the concepts of conditional expectations, martingales and stopping times on Riesz spaces. Here we formulate and prove order theoretic analogues of the Birkhoff, Hopf and Wiener ergodic theorems and the Strong Law of Large Numbers on Riesz spaces (vector lattices).     

On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

Convergence Rates in the Law of Large Numbers under Sublinear Expectations

In this note, we study convergence rates in the law of large numbers for independent and identically distributed random variables under sublinear expectations. We obtain a strong L^p-convergence version and a strongly quasi sure convergence version of the law of large numbers.     

A mixed‐FEM formulation for nonlinear incompressible elasticity in the plane

This article deals with an expanded mixed finite element formulation, based on the Hu‐Washizu principle, for a nonlinear incompressible material in the plane. We follow our related previous works and introduce both the stress and the strain tensors as further unknowns, which yields a two‐fold saddle point operator equation as the corresponding variational formulation. A slight generalization of the classical Babu?ka‐Brezzi's theory is applied to prove unique solvability of the continuous and discrete formulations, and to derive the corresponding a priori error analysis. An extension of the well‐known PEERS space is used to define an stable associated Galerkin scheme. Finally, we provide an a posteriori error analysis based on the classical Bank‐Weiser approach. © 2002 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 18: 105–128, 2002     

On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

EFFICIENT SIXTH ORDER P-STABLE METHODS WITH MINIMAL LOCAL TRUNCATION ERROR FOR y"=f(x,y)

1. IntroductionWe consider a class of direct hybrid methods proposed in [11 for solving the second orderinitial value problemy" = f(t,y), y(0),y'(0) given (1.1)The basic method has the formandHere t. = nh and we define t.l.. = t. I aih, i = 1, 2 and n=0,1…