求m阶递推数列通项公式的两种方法

利用分析中的解析函数方法和代数中的矩阵方法,得到了m阶常系数齐次线性递推数列通项公式的解析表达式,是对已有结果的完善和推广.     

高等数学求极限教学的一些建议

分析极限教学中出现的一些问题,并给出相应建议．     

Generalized covering designs and clique coverings

Inspired by the “generalized t‐designs” defined by Cameron [P. J. Cameron, Discrete Math 309 (2009), 4835–4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both covering designs and covering arrays. We then obtain a number of bounds on the minimum sizes of these designs, and describe some methods of constructing them, which in some cases we prove are optimal. Many of our results are obtained from an interpretation of these designs in terms of clique coverings of graphs. © 2011 Wiley Periodicals, Inc. J Combin Designs 19:378‐406, 2011     

Robust multigrid preconditioners for the high‐contrast biharmonic plate equation

We study the high‐contrast biharmonic plate equation with Hsieh–Clough–Tocher discretization. We construct a preconditioner that is robust with respect to contrast size and mesh size simultaneously based on the preconditioner proposed by Aksoylu et al. (Comput. Vis. Sci. 2008; 11 :319–331). By extending the devised singular perturbation analysis from linear finite element discretization to the above discretization, we prove and numerically demonstrate the robustness of the preconditioner. Therefore, we accomplish a desirable preconditioning design goal by using the same family of preconditioners to solve the elliptic family of PDEs with varying discretizations. We also present a strategy on how to generalize the proposed preconditioner to cover high‐contrast elliptic PDEs of order 2k, k>2. Moreover, we prove a fundamental qualitative property of the solution to the high‐contrast biharmonic plate equation. Namely, the solution over the highly bending island becomes a linear polynomial asymptotically. The effectiveness of our preconditioner is largely due to the integration of this qualitative understanding of the underlying PDE into its construction. Copyright © 2010 John Wiley & Sons, Ltd.     

Strong immersion is a well-quasi-ordering for semicomplete digraphs

We prove that the strong immersion order is a well-quasi-ordering on the class of semicomplete digraphs, thereby strengthening a result of Chudnovsky and Seymour (2011, J. Comb. Theory, Series B, 101, 47–53) that this holds for the class of tournaments.     

A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar

A phased array radar (PAR) is used to detect new targets and update the information of those detected targets. Generally, a large number of tasks need to be performed by a single PAR in a finite time horizon. In order to utilize the limited time and the energy resources, it is necessary to provide an efficient task scheduling algorithm. However, the existing radar task scheduling algorithms can't be utilized to release the full potential of the PAR, because of those disadvantages such as full PAR task structure ignored, only good performance in one aspect considered and just heuristic or the meta-heuristic method utilized. Aiming at above issues, an optimization model for the PAR task scheduling and a hybrid adaptively genetic (HAGA) algorithm are proposed. The model considers the full PAR task structure and integrates multiple principles of task scheduling, so that multi-aspect performance can be guaranteed. The HAGA incorporates the improved GA to explore better solutions while using the heuristic task interleaving algorithm to utilize wait intervals to interleave subtasks and calculate fitness values of individuals in efficient manners. Furthermore, the efficiency and the effectiveness of the HAGA are both improved by adopting chaotic sequences for the population initialization, the elite reservation and the mixed ranking selection, as well as designing the adaptive crossover and the adaptive mutation operators. The simulation results demonstrate that the HAGA possesses merits of global exploration, faster convergence, and robustness compared with three state-of-art algorithms—adaptive GA, hybrid GA and highest priority and earliest deadline first heuristic (HPEDF) algorithm.     

Dissipativity and synchronization control of fractional‐order memristive neural networks with reaction‐diffusion terms

This paper deals with the dissipativity and synchronization control of fractional‐order memristive neural networks (FOMNNs) with reaction‐diffusion terms. By means of fractional Halanay inequality, Wirtinger inequality, and Lyapunov functional, some sufficient conditions are provided to ensure global dissipativity and exponential synchronization of FOMNNs with reaction‐diffusion terms, respectively. The underlying model and the obtained results are more general since the reaction‐diffusion terms are first introduced into FOMNNs. The given conditions are easy to be checked, and the correctness of the obtained results is confirmed by a living example.     

Fractional‐order orthogonal Bernstein polynomials for numerical solution of nonlinear fractional partial Volterra integro‐differential equations

In this paper, a new two‐dimensional fractional polynomials based on the orthonormal Bernstein polynomials has been introduced to provide an approximate solution of nonlinear fractional partial Volterra integro‐differential equations. For this aim, the fractional‐order orthogonal Bernstein polynomials (FOBPs) are constructed, and its operational matrices of integration, fractional‐order integration, and derivative in the Caputo sense and product operational matrix are derived. These operational matrices are utilized to reduce the under study problem to a nonlinear system of algebraic equations. Using the approximation of FOBPs, the convergence analysis and error estimate associated to the proposed problem have been investigated. Finally, several examples are included to clarify the validity, efficiency, and applicability of the proposed technique via FOBPs approximation.     

A reduced‐order extrapolated natural boundary element method based on POD for the 2D hyperbolic equation in unbounded domain

In this article, we primarily focuses to study the order‐reduction for the classical natural boundary element (NBE) method for the two‐dimensional (2D) hyperbolic equation in unbounded domain. To this end, we first build a semi‐discretized format about time for the hyperbolic equation and discuss the existence, stability, and convergence of the time semi‐discretized solutions. We then establish the classical fully discretized NBE format from the time semi‐discretized one and analyze the existence, stability, and convergence of the classical NBE solutions. Next, using proper orthogonal decomposition method, we build a reduced‐order extrapolated NBE (ROENBE) format containing very few unknowns but having adequately high accuracy, and we also discuss the existence, stability, and convergence of the ROENBE solutions. Finally, we use some numerical examples to show that the ROENBE method is far superior to the classical NBE one. It shows that the ROENBE method is reliable and effective for solving the 2D hyperbolic equation with the unbounded domain.     

Complex dynamics of a discrete fractional‐order Leslie‐Gower predator‐prey model

A proposed discretized form of fractional‐order prey‐predator model is investigated. A sufficient condition for the solution of the discrete system to exist and to be unique is determined. Jury stability test is applied for studying stability of equilibrium points of the discretized system. Then, the effects of varying fractional order and other parameters of the systems on its dynamics are examined. The system undergoes Neimark‐Sacker and flip bifurcation under certain conditions. We observe that the model exhibits chaotic dynamics following stable states as the memory parameter α decreases and step size h increases. Theoretical results illustrate the rich dynamics and complexity of the model. Numerical simulation validates theoretical results and demonstrates the presence of rich dynamical behaviors include S‐asymptotically bounded periodic orbits, quasi‐periodicity, and chaos. The system exhibits a wide range of dynamical behaviors for fractional‐order α key parameter.