The Crank‐Nicolson/Adams‐Bashforth scheme for the time‐dependent Navier‐Stokes equations with nonsmooth initial data

In this article, we study the stability and convergence of the Crank‐Nicolson/Adams‐Bashforth scheme for the two‐dimensional nonstationary Navier‐Stokes equations with a nonsmooth initial data. A finite element method is applied for the spatial approximation of the velocity and pressure. The time discretization is based on the implicit Crank‐Nicolson scheme for the linear terms and the explicit Adams‐Bashforth scheme for the nonlinear term. Moreover, we prove that the scheme is almost unconditionally stable for a nonsmooth initial data u₀ with div u₀ = 0, i.e., the time step τ satisfies: τ ≤ C₀ if u₀ ∈ H¹ ∩ L^∞; τ |log h| ≤ C₀ if u₀ ∈ H¹ for the mesh size h and some positive constant C₀. Finally, we obtain some error estimates for the discrete velocity and pressure under the above stability condition. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 28: 155‐187, 2012     

非定常Burgers方程基于POD方法的全二阶差分格式降阶外推算法

利用特征投影分解方法和奇值分解技术对非定常Burgers 方程的经典全二阶有限差分格式做降阶处理, 给出一种时间和空间变量都是二阶精度的降阶差分格式, 并给出这种降阶全二阶精度差分解的误差估计和外推算法的实现, 最后用数值例子说明数值结果与理论结果是相吻合的.     

Adaptive Q–S synchronization between coupled chaotic systems with stochastic perturbation and delay

This work investigates the adaptive Q–S synchronization of coupled chaotic (or hyper-chaotic) systems with stochastic perturbation, delay and unknown parameters. The sufficient conditions for achieving Q–S synchronization of two stochastic chaotic systems are derived based on the invariance principle of stochastic differential equation. By the adaptive control technique, the control laws and the corresponding parameter update laws are proposed such that the stochastic Q–S synchronization of non-identical chaotic (or hyper-chaotic) systems is to be obtained. Finally, two illustrative numerical simulations are also given to demonstrate the effectiveness of the proposed scheme.     

Bessel collocation approach for solving continuous population models for single and interacting species

In this paper, we present a collocation method to obtain the approximate solutions of continuous population models for single and interacting species. By using the Bessel polynomials and collocation points, this method transforms population model into a matrix equation. The matrix equation corresponds to a system of nonlinear equations with the unknown Bessel coefficients. The reliability and efficiency of the proposed scheme are demonstrated by two numerical examples and performed on the computer algebraic system Maple.     

Bifurcating periodic solution for a class of first-order nonlinear delay differential equation after Hopf bifurcation

In this paper, we predict the accurate bifurcating periodic solution for a general class of first-order nonlinear delay differential equation with reflectional symmetry by constructing an approximate technique, named residue harmonic balance. This technique combines the features of the homotopy concept with harmonic balance which leads to easy computation and gives accurate prediction on the periodic solution to the desired accuracy. The zeroth-order solution using just one Fourier term is applied by solving a set of nonlinear algebraic equations containing the delay term. The unbalanced residues due to Fourier truncation are considered iteratively by solving linear equations to improve the accuracy and increase the number of Fourier terms of the solutions successively. It is shown that the solutions are valid for a wide range of variation of the parameters by two examples. The second-order approximations of the periodic solutions are found to be in excellent agreement with those obtained by direct numerical integration. Moreover, the residue harmonic balance method works not only in determining the amplitude but also the frequency of the bifurcating periodic solution. The method can be easily extended to other delay differential equations.     

A new Jacobi operational matrix: An application for solving fractional differential equations

In this paper, we derived the shifted Jacobi operational matrix (JOM) of fractional derivatives which is applied together with spectral tau method for numerical solution of general linear multi-term fractional differential equations (FDEs). A new approach implementing shifted Jacobi operational matrix in combination with the shifted Jacobi collocation technique is introduced for the numerical solution of nonlinear multi-term FDEs. The main characteristic behind this approach is that it reduces such problems to those of solving a system of algebraic equations which greatly simplifying the problem. The proposed methods are applied for solving linear and nonlinear multi-term FDEs subject to initial or boundary conditions, and the exact solutions are obtained for some tested problems. Special attention is given to the comparison of the numerical results obtained by the new algorithm with those found by other known methods.     

A new branch and bound algorithm for cell formation problem

Cell formation (CF) is the first and the most important problem in designing cellular manufacturing systems. Due to its non-polynomial nature, various heuristic and metaheuristic algorithms have been proposed to solve CF problem. Despite the popularity of heuristic algorithms, few studies have attempted to develop exact algorithms, such as branch and bound (B&B) algorithms, for this problem. We develop three types of branch and bound algorithms to deal with the cell formation problem. The first algorithm uses a binary branching scheme based on the definitions provided for the decision variables. Unlike the first algorithm, which relies on the mathematical model, the second one is designed based on the structure of the cell formation problem. The last algorithm has a similar structure to the second one, except that it has the ability to eliminate duplicated nodes in branching trees. The proposed branch and bound algorithms and a hybrid genetic algorithm are compared through some numerical examples. The results demonstrate the effectiveness of the modified problem-oriented branch and bound algorithm in solving relatively large size cell formation problems.     

Multigrid Solution of a Lavrentiev-Regularized State-Constrained Parabolic Control Problem

A mesh-independent, robust, and accurate multigrid scheme to solve a linear state-constrained parabolic optimal control problem is presented. We first consider a Lavrentiev regularization of the state-constrained optimization problem. Then, a multigrid scheme is designed for the numerical solution of the regularized optimality system. Central to this scheme is the construction of an iterative pointwise smoother which can be formulated as a local semismooth Newton iteration. Results of numerical experiments and theoretical two-grid local Fourier analysis estimates demonstrate that the proposed scheme is able to solve parabolic state-constrained optimality systems with textbook multigrid efficiency.     

Approximate Controllability of Neutral Functional Differential Systems with State-Dependent Delay

This paper deals with the approximate controllability of semilinear neutral functional differential systems with state-dependent delay. The fractional power theory and α-norm are used to discuss the problem so that the obtained results can apply to the systems involving derivatives of spatial variables. By methods of functional analysis and semigroup theory, sufficient conditions of approximate controllability are formulated and proved. Finally, an example is provided to illustrate the applications of the obtained results.     

On Differential Equations with Retarded Argument

We study the limit properties of solutions to one class of systems of differential equations as the number of equations and some parameters tend to infinity. We establish a close connection between solutions to these systems and differential equations with retarded argument. Our convergence theorems provide a new method for approximation of solutions to nonlinear differential equations with retarded argument.Original Russian Text Copyright © 2005 Demidenko G. V. and Likhoshvai V. A.The authors were supported by the Russian Foundation for Basic Research (Grants 03-01-00328, 03-04-48506, 03-04-48829, 03-07-96833, 04-01-00458, 05-04-49068, and 05-07-90274), the Integration Grant of the Siberian Branch of the Russian Academy of Sciences (No. 119 and 148), the Program Development of the Scientific Potential of Higher School of the Ministry for Education of the Russian Federation (Grant 8273), and NSF:FIBR (Grant EF-0330786).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 538–552, May–June, 2005.