DISSIPATIVITY AND EXPONENTIAL STABILITY OF θ-METHODS FOR SINGULARLY PERTURBED DELAY DIFFERENTIAL EQUATIONS WITH A BOUNDED LAG

This paper deals with analytic and numerical dissipativity and exponential stability of singularly perturbed delay differential equations with any bounded state-independent lag. Sufficient conditions will be presented to ensure that any solution of the singularly perturbed delay differential equations (DDEs) with a bounded lag is dissipative and exponentially stable uniformly for sufficiently small ε > 0. We will study the numerical solution defined by the linear θ-method and one-leg method and show that they are dissipative and exponentially stable uniformly for sufficiently small ε > 0 if and only if θ = 1.     

非线性刚性变延迟微分方程单支方法的D-收敛性

This paper is concerned with the error analysis of one-leg methods when applied to nonlinear stiff Delay Differential Equations(DDEs) with a variable delay. It is proved that a one-leg method with Lagrangian linear interpolation procedure is D-convergent of oder p if and only if it is A-stable and consistent of order p in the classical sense for ODEs. The results obtained can be regarded as extension of that for DDEs with constant delay presented by Huang Chenming et al. in 2001     

一个修正PRP共轭梯度法的全局收敛性

In this paper, a modified formula for βk^PRP is proposed for the conjugate gradient method of solving unconstrained optimization problems. The value of βk^PRP keeps nonnegative independent of the line search. Under mild conditions, the global convergence of modified PRP method with the strong Wolfe-Powell line search is established. Preliminary numerical results show that the modified method is efficient.     

THE NUMERICAL STABILITY OF THE BLOCK θ-METHODS FOR DELAY DIFFERENTIAL EQUATIONS

This paper focuses on the numerical stability of the block θ-methods adapted to differential equations with a dday argument. For the block θ-methods, an interpolation procedure is introduced which leads to the mumerical processes that satisfy an important asymptotic stability condition related to the class of test problems y＇ (t)=ay(t)+by(t-r) with a,b∈C, Re(a)＜- ｜b｜ and τ>0. We prove that the block θ-method is GP-stable if and only if the method is A-stable for ordinary differential equations. Furthermore, it is proved that the P-and GP-stability are equivalent for the block θ-method.     

二阶延迟微分方程θ-方法的TH-稳定性

This paper is concerned with the TH-stability of second order delay differential equation. A sufficient condition such that the system is asymptotically stable is derived. Furthermore, a sufficient condition is obtained for the hnear θ-method to be TH-stable. Finally, the plot of stability region for the particular case is presented.     

COMBINATION METHOD FOR PARALLEL COMPUTATION IN ODE

In this paper,a 4th order parallel computation method with four processes for solving ODEs is discussed.This method is the Runge-Kutta method combined with a linear multistep method,which overcomes the difficulties of the 4th order parallel Runge-Kutta method discussed in [1].The concept of critical speedup for parallel methods is also defined,and speedups of some methods are analyzed by using this concept.     

一种修正的谱CD共轭梯度算法的全局收敛性

In this paper,we present a new nonlinear modified spectral CD conjugate gradient method for solving large scale unconstrained optimization problems.The direction generated by the method is a descent direction for the objective function,and this property depends neither on the line search rule,nor on the convexity of the objective function.Moreover,the modified method reduces to the standard CD method if line search is exact.Under some mild conditions,we prove that the modified method with line search is globally convergent even if the objective function is nonconvex.Preliminary numerical results show that the proposed method is very promising.     

结合修正Curry-Altman步长搜索一个新的共轭梯度算法的收敛性

Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameter in the search directions. In this note, conditions are given on the parameter in the conjugate gradient directions to ensure the descent property of the search directions. Global convergence of such a class of methods is discussed. It is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continuously differentiable function with a modification of the Curry-Altman‘s step-size rule and a bounded level set. Combining PR method with our new method, PR method is modified to have global convergence property.Numerical experiments show that the new methods are efficient by comparing with FR conjugate gradient method.     

GLOBAL CONVERGENCE RESULTS OF A THREE TERM MEMORY GRADIENT METHOD WITH A NON-MONOTONE LINE SEARCH TECHNIQUE

In this paper, a new class of three term memory gradient method with nonmonotone line search technique for unconstrained optimization is presented. Global convergence properties of the new methods are discussed. Combining the quasi-Newton method with the new method, the former is modified to have global convergence property. Numerical results show that the new algorithm is efficient.     

BOOTSTRAP WAVELET IN THE NONPARAMETRIC REGRESSION MODEL WITH WEAKLY DEPENDENT PROCESSES

This paper introduces a method of bootstrap wavelet estimation in a nonparametric regression model with weakly dependent processes for both fixed and random designs. The asymptotic bounds for the bias and variance of the bootstrap wavelet estimators are given in the fixed design model. The conditional normality for a modified version of the bootstrap wavelet estimators is obtained in the fixed model. The consistency for the bootstrap wavelet estimator is also proved in the random design model. These results show that the bootstrap wavelet method is valid for the model with weakly dependent processes.     

A New Nonmonotone Trust Region Barzilai-Borwein Method for Unconstrained Optimization Problems

In this paper,we propose a new nonmonotone trust region Barzilai-Borwein(BB for short)method for solving unconstrained optimization problems.The proposed method is given by a novel combination of a modified Metropolis criterion,BB-stepsize and trust region method.The new method uses the reciprocal of BB-stepsize to approximate the Hessian matrix of the objective function in the trust region subproblems,and accepts some bad solutions according to the modified Metropolis criterion based on simulated annealing idea.Under some suitable assumptions,the global convergence of the new method is established.Some preliminary numerical results indicate that,the new method is more efficient compared with the existing trust region BB method.     

Comparison Results Between Preconditioned Jacobi and the AOR Iterative Method

The large scale linear systems with M-matrices often appear in a wide variety of areas of physical,fluid dynamics and economic sciences.It is reported in[1]that the convergence rate of the IMGS method,with the preconditioner I S_α,is superior to that of the basic SOR iterative method for the M-matrix.This paper considers the preconditioned Jacobi(PJ)method with the preconditioner P=I S_α S_β,and proves theoretically that the convergence rate of the PJ method is better than that of the basic AOR method.Numerical examples are provided to illustrate the main results obtained.     

A MODIFIED VARIABLE-PENALTY ALTERNATING DIRECTIONS METHOD FOR MONOTONE VARIATIONAL INEQUALITIES

Alternating directions method is one of the approaches for solving linearly constrained separate monotone variational inequalities. Experience on applications has shown that the number of iteration significantly depends on the penalty for the system of linearly constrained equations and therefore the method with variable penalties is advantageous in practice. In this paper, we extend the Kontogiorgis and Meyer method [12] by removing the monotonicity assumption on the variable penalty matrices. Moreover, we introduce a self-adaptive rule that leads the method to be more efficient and insensitive for various initial penalties. Numerical results for a class of Fermat-Weber problems show that the modified method and its self-adaptive technique are proper and necessary in practice.     

BLOCK-TRIANGULAR PRECONDITIONERS FOR SYSTEMS ARISING FROM EDGE-PRESERVING IMAGE RESTORATION

Signal and image restoration problems are often solved by minimizing a cost function consisting of an l2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization functions. In specific, half-quadratic regularization as a fixed-point iteration method is usually employed to solve this problem. The main aim of this paper is to solve the above-described signal and image restoration problems with the half-quadratic regularization technique by making use of the Newton method. At each iteration of the Newton method, the Newton equation is a structured system of linear equations of a symmetric positive definite coefficient matrix, and may be efficiently solved by the preconditioned conjugate gradient method accelerated with the modified block SSOR preconditioner. Our experimental results show that the modified block-SSOR preconditioned conjugate gradient method is feasible and effective for further improving the numerical performance of the half-quadratic regularization approach.     

On the dynamics of a family of entire functions

We prove that for any bounded type irrational number 0θ1,the boundary of the Siegel disk of fα(z)=e2πiθsin(z)+αsin3(z),α∈C,which centered at the origin,is a quasicircle passing through 2,4 or 6 critical points of fαcounted with multiplicity.     

Composition of fractional Orlicz maximal operators and A 1-weights on spaces of homogeneous type

For a Young function θ with 0 ≤α 〈 1, let Mα,θ be the fractional Orlicz maximal operator defined in the context of the spaces of homogeneous type （X, d, μ） by Mα,θf（x） = supx∈（B）α ｜｜f｜｜θ,B, where ｜｜f｜｜θ,B is the mean Luxemburg norm of f on a ball B. When α= 0 we simply denote it by Me. In this paper we prove that if Ф and ψare two Young functions, there exists a third Young function θ such that the composition Mα,ψ o MФ is pointwise equivalent to Mα,θ. As a consequence we prove that for some Young functions θ, if Mα,θf 〈∞a.e. and δ ∈（0,1） then （Mα,θf）δ is an A1-weight.     

MODIFIED NEWTON＇S ALGORITHM FOR COMPUTING THE GROUP INVERSES OF SINGULAR TOEPLITZ MATRICES

Newton＇s iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton＇s iteration can be done efficiently. We show that the convergence of the modified Newton iteration is still very fast. Numerical results are presented to demonstrate the fast convergence of the proposed method.     

MODIFIED MORLEY ELEMENT METHOD FOR A FOURTH ORDER ELLIPTIC SINGULAR PERTURBATION PROBLEM

This paper proposes a modified Morley element method for a fourth order ellipticsingular perturbation problem. The method also uses Morley element or rectangle Morleyelement, but linear or bilinear approximation of finite element functions is used in the lowerpart of the bilinear form. It is shown that the modified method converges uniformly in theperturbation parameter.     

Convergence to Diffusion Waves for Nonlinear Evolution Equations with Ellipticity and Damping, and with Different End States

In this paper, we consider the global existence and the asymptotic behavior of solutions to the Cauchy problem for the following nonlinear evolution equations with ellipticity and dissipative effects： {ψt=-（1-α）ψ-θx＋αψxx, θt=-（1-α）θ＋νψx＋（ψθ）x＋αθxx（E） with initial data （ψ,θ）（x,0）=（ψ0（x）,θ0（x））→（ψ±,θ±）as x→±∞ where α and ν are positive constants such that α 〈 1, ν 〈 4α（1 - α）. Under the assumption that ｜ψ＋ - ψ-｜ ＋ ｜θ＋ - θ-｜ is sufficiently small, we show the global existence of the solutions to Cauchy problem （E） and （I） if the initial data is a small perturbation. And the decay rates of the solutions with exponential rates also are obtained. The analysis is based on the energy method.     

A MODIFICATION OF POWELL-ZANGWILL'S METHOD AND ITS RATE OF CONVERGENCE

In this paper,a modified version of Powell-Zangwill's method for function minimizationwithout calculating derivatives is proposed.The new method possesses following properties:quadratic termination,global convergence for strictly convex function and Q-linearconvergence rate for uniformly convex function.Furthermore,the main part of this paperis to show that the rate of convergence of the new method is quadratic for every n(2n 1)line searches if the objective function is a uniformly convex and suitably smooth functionon R~n.