Finite‐region stabilization via dynamic output feedback for 2‐D Roesser models

Finite‐region stability (FRS), a generalization of finite‐time stability, has been used to analyze the transient behavior of discrete two‐dimensional (2‐D) systems. In this paper, we consider the problem of FRS for discrete 2‐D Roesser models via dynamic output feedback. First, a sufficient condition is given to design the dynamic output feedback controller with a state feedback‐observer structure, which ensures the closed‐loop system FRS. Then, this condition is reducible to a condition that is solvable by linear matrix inequalities. Finally, viable experimental results are demonstrated by an illustrative example.     

Finite‐time stability and boundedness of switched nonlinear time‐delay systems under state‐dependent switching

This article investigates the finite‐time stability, stabilization, and boundedness problems for switched nonlinear systems with time‐delay. Unlike the existing average dwell‐time technique based on time‐dependent switching strategy, largest region function strategy, that is, state‐dependent switching control strategy is adopted to design the switching signal, which does not require the switching instants to be given in advance. Some sufficient conditions which guarantee finite‐time stable, stabilization, and boundedness of switched nonlinear systems with time‐delay are presented in terms of linear matrix inequalities. Detail proofs are given using multiple Lyapunov‐like functions. A numerical example is given to illustrate the effectiveness of the proposed methods. © 2014 Wiley Periodicals, Inc. Complexity 21: 267–275, 2015     

Mixed two‐grid finite difference methods for solving one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations

The aim of this paper is to propose mixed two‐grid finite difference methods to obtain the numerical solution of the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. The finite difference equations at all interior grid points form a large‐sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a family of finite difference methods for discretizing the spatial and time derivatives. The obtained system has been solved by two‐grid method, where the two‐grid method is used for solving the large‐sparse linear systems. Also, in the proposed method, the spectral radius with local Fourier analysis is calculated for different values of h and Δt. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. Copyright © 2016 John Wiley & Sons, Ltd.     

Finite element method for two‐dimensional time‐fractional tricomi‐type equations

In this article, we consider the finite element method (FEM) for two‐dimensional linear time‐fractional Tricomi‐type equations, which is obtained from the standard two‐dimensional linear Tricomi‐type equation by replacing the first‐order time derivative with a fractional derivative (of order α, with 1 <α< 2 ). The method is based on finite element method for space and finite difference method for time. We prove that the method is unconditionally stable, and the error estimate is presented. The comparison of the FEM results with the exact solutions is made, and numerical experiments reveal that the FEM is very effective. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

Inf‐sup stability of Petrov‐Galerkin immersed finite element methods for one‐dimensional elliptic interface problems

In this article, we analyze the Petrov‐Galerkin immersed finite element method (PG‐IFEM) when applied to one‐dimensional elliptic interface problems. In the PG‐IFEM (T. Hou, X. Wu and Y. Zhang, Commun. Math. Sci., 2 (2004), 185‐205, and S. Hou and X. Liu, J. Comput. Phys., 202 (2005), 411‐445), the classic immersed finite element (IFE) space was taken as the trial space while the conforming linear finite element space was taken as the test space. We first prove the inf‐sup condition of the PG‐IFEM and then show the optimal error estimate in the energy norm. We also show the optimal estimate of the condition number of the stiffness matrix. The results are extended to two dimensional problems in a special case.     

Analytical and numerical solutions of a two‐dimensional multi‐term time‐fractional Oldroyd‐B model

In this paper, we consider a two‐dimensional multi‐term time‐fractional Oldroyd‐B equation on a rectangular domain. Its analytical solution is obtained by the method of separation of variables. We employ the finite difference method with a discretization of the Caputo time‐fractional derivative to obtain an implicit difference approximation for the equation. Stability and convergence of the approximation scheme are established in the L_∞ ‐norm. Two examples are given to illustrate the theoretical analysis and analytical solution. The results indicate that the present numerical method is effective for this general two‐dimensional multi‐term time‐fractional Oldroyd‐B model.     

A geometric‐based algebraic multigrid method for higher‐order finite element equations in two‐dimensional linear elasticity

In this paper, we will discuss the geometric‐based algebraic multigrid (AMG) method for two‐dimensional linear elasticity problems discretized using quadratic and cubic elements. First, a two‐level method is proposed by analyzing the relationship between the linear finite element space and higher‐order finite element space. And then a geometric‐based AMG method is obtained with the existing solver used as a solver on the first coarse level. The resulting AMG method is applied to some typical elasticity problems including the plane strain problem with jumps in Young's modulus. The results of various numerical experiments show that the proposed AMG method is much more robust and efficient than a classical AMG solver that is applied directly to the high‐order systems alone. Moreover, we present the corresponding theoretical analysis for the convergence of the proposed AMG algorithms. These theoretical results are also confirmed by some numerical tests. Copyright © 2008 John Wiley & Sons, Ltd.     

Finite‐time synchronization of a class of N‐coupled complex partial differential systems with time‐varying delay

This study examines finite‐time synchronization for a class of N‐coupled complex partial differential systems (PDSs) with time‐varying delay. The problem of finite‐time synchronization for coupled drive‐response PDSs with time‐varying delay is similarly considered. The synchronization error dynamic of the PDSs is defined in the q‐dimensional spatial domain. We construct a feedback controller to achieve finite‐time synchronization. Sufficient conditions are derived by using the Lyapunov‐Krasoviskii stability approach and inequalities technology to ensure that the proposed networks achieve synchronization in finite time. The proposed systems demonstrate extensive application. Finally, an example is used to verify the theoretical results.     

Klein‐Gordon‐Zakharov system in energy space: Blow‐up profile and subsonic limit

In this paper, we prove finite‐time blowup in energy space for the three‐dimensional Klein‐Gordon‐Zakharov (KGZ) system by modified concavity method. We obtain the blow‐up rates of solutions in local and global space, respectively. In addition, by using the energy convergence, we study the subsonic limit of the Cauchy problem for KGZ system and prove that any finite energy solution converges to the corresponding solution of Klein‐Gordon equation in energy space.     

Finite‐time synchronization of memristive neural networks with time‐varying delays via two control methods

In this paper, on the basis of the Lyapunov stability theory and finite‐time stability lemma, the finite‐time synchronization problem for memristive neural networks with time‐varying delays is studied by two control methods. First, the discontinuous state‐feedback control rule containing integral part for square sum of the synchronization error and the discontinuous adaptive control rule are designed for realizing synchronization of drive‐response memristive neural networks in finite time, respectively. Then, by using some important inequalities and defining suitable Lyapunov functions, some algebraic sufficient criteria guaranteeing finite‐time synchronization are deduced for drive‐response memristive neural networks in finite time. Furthermore, we give the estimation of the upper bounds of the settling time of finite‐time synchronization. Lastly, the effectiveness of the obtained sufficient criteria guaranteeing finite‐time synchronization is validated by simulation.     

A multigrid compact finite difference method for solving the one‐dimensional nonlinear sine‐Gordon equation

The aim of this paper is to propose a multigrid method to obtain the numerical solution of the one‐dimensional nonlinear sine‐Gordon equation. The finite difference equations at all interior grid points form a large sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a compact finite difference scheme of fourth‐order for discretizing the spatial derivative and the standard second‐order central finite difference method for the time derivative. The proposed method uses the Richardson extrapolation method in time variable. The obtained system has been solved by V‐cycle multigrid (VMG) method, where the VMG method is used for solving the large sparse linear systems. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional sine‐Gordon equation. Copyright © 2014 John Wiley & Sons, Ltd.     

Stability analysis of memristor‐based complex‐valued recurrent neural networks with time delays

This article addresses stability analysis of a general class of memristor‐based complex‐valued recurrent neural networks (MCVNNs) with time delays. Some sufficient conditions to guarantee the boundedness on a compact set that globally attracts all trajectories of the MCVNNs are obtained by utilizing local inhibition. Moreover, some sufficient conditions for exponential stability and the global stability of the MCVNNs are established with the help of local invariant sets and linear matrix inequalities using Lyapunov–Krasovskii functional. The analysis results in the article, based on the results from the theory of differential equations with discontinuous right‐hand sides as introduced by Filippov. Finally, two numerical examples are also presented to show the effectiveness and usefulness of our theoretical results. © 2014 Wiley Periodicals, Inc. Complexity 21: 14–39, 2016     

Relaxation‐time limit of the three‐dimensional hydrodynamic model with boundary effects

In this paper, we study three‐dimensional (3D) unipolar and bipolar hydrodynamic models and corresponding drift‐diffusion models from semiconductor devices on bounded domain. Based on the asymptotic behavior of the solutions to the initial boundary value problems with slip boundary condition, we investigate the relation between the 3D hydrodynamic semiconductor models and the corresponding drift‐diffusion models. That is, we discuss the relation‐time limit from the 3D hydrodynamic semiconductor models to the corresponding drift‐diffusion models by comparing the large‐time behavior of these two models. These results can be showed by energy arguments. Copyrightcopyright 2011 John Wiley & Sons, Ltd.     

Finite differences and collocation methods for the solution of the two‐dimensional heat equation

In this article, we combine finite difference approximations (for spatial derivatives) and collocation techniques (for the time component) to numerically solve the two‐dimensional heat equation. We employ, respectively, second‐order and fourth‐order schemes for the spatial derivatives, and the discretization method gives rise to a linear system of equations. We show that the matrix of the system is nonsingular. Numerical experiments carried out on serial computers show the unconditional stability of the proposed method and the high accuracy achieved by the fourth‐order scheme. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 54–63, 2001     

Two‐grid methods for time‐harmonic Maxwell equations

In this paper, we develop several two‐grid methods for the Nédélec edge finite element approximation of the time‐harmonic Maxwell equations. We first present a two‐grid method that uses a coarse space to solve the original problem and then use a fine space to solve a corresponding symmetric positive definite problem. Then, we present two types of iterative two‐grid methods, one is to add the kernel of the curl ‐operator in the fine space to a coarse mesh space to solve the original problem and the other is to use an inner iterative method for dealing with the kernel of the curl ‐operator in the fine space and the coarse space, separately. We provide the error estimates for the first two methods and present numerical experiments to show the efficiency of our methods.Copyright © 2012 John Wiley & Sons, Ltd.     

Two grid finite element discretization method for semi‐linear hyperbolic integro‐differential equations

In this paper, we will investigate a two grid finite element discretization method for the semi‐linear hyperbolic integro‐differential equations by piecewise continuous finite element method. In order to deal with the semi‐linearity of the model, we use the two grid technique and derive that once the coarse and fine mesh sizes H, h satisfy the relation h = H² for the two‐step two grid discretization method, the two grid method achieves the same convergence accuracy as the ordinary finite element method. Both theoretical analysis and numerical experiments are given to verify the results.     

A FEM–DtN formulation for a non‐linear exterior problem in incompressible elasticity

In this paper, we combine the usual finite element method with a Dirichlet‐to‐Neumann (DtN) mapping, derived in terms of an infinite Fourier series, to study the solvability and Galerkin approximations of an exterior transmission problem arising in non‐linear incompressible 2d‐elasticity. We show that the variational formulation can be written in a Stokes‐type mixed form with a linear constraint and a non‐linear main operator. Then, we provide the uniqueness of solution for the continuous and discrete formulations, and derive a Cea‐type estimate for the associated error. In particular, our error analysis considers the practical case in which the DtN mapping is approximated by the corresponding finite Fourier series. Finally, a reliable a posteriori error estimate, well suited for adaptive computations, is also given. Copyright © 2003 John Wiley & Sons, Ltd.     

On the subdomain‐Galerkin/least squares method for 2‐ and 3‐D mixed elliptic problems with reaction terms

In this article we apply the subdomain‐Galerkin/least squares method, which is first proposed by Chang and Gunzburger for first‐order elliptic systems without reaction terms in the plane, to solve second‐order non‐selfadjoint elliptic problems in two‐ and three‐dimensional bounded domains with triangular or tetrahedral regular triangulations. This method can be viewed as a combination of a direct cell vertex finite volume discretization step and an algebraic least‐squares minimization step in which the pressure is approximated by piecewise linear elements and the flux by the lowest order Raviart‐Thomas space. This combined approach has the advantages of both finite volume and least‐squares methods. Among other things, the combined method is not subject to the Ladyzhenskaya‐Babus?ka‐Brezzi condition, and the resulting linear system is symmetric and positive definite. An optimal error estimate in the H¹(Ω) × H(div; Ω) norm is derived. An equivalent residual‐type a posteriori error estimator is also given. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 738–751, 2002; Published online in Wiley InterScience (www.interscience.wiley.com); DOI 10.1002/num.10030.     

Single‐cell compact finite‐difference discretization of order two and four for multidimensional triharmonic problems

In this article, we discuss finite‐difference methods of order two and four for the solution of two‐and three‐dimensional triharmonic equations, where the values of u,(?²u/?n²) and (?⁴u/?n⁴) are prescribed on the boundary. For 2D case, we use 9‐ and for 3D case, we use 19‐ uniform grid points and a single computational cell. We introduce new ideas to handle the boundary conditions and do not require to discretize the boundary conditions at the boundary. The Laplacian and the biharmonic of the solution are obtained as byproduct of the methods. The resulting matrix system is solved by using the appropriate block iterative methods. Computational results are provided to demonstrate the fourth‐order accuracy of the proposed methods. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

On regularized Hermitian splitting iteration methods for solving discretized almost‐isotropic spatial fractional diffusion equations

The shifted finite‐difference discretization of the one‐dimensional almost‐isotropic spatial fractional diffusion equation results in a discrete linear system whose coefficient matrix is a sum of two diagonal‐times‐Toeplitz matrices. For this kind of linear systems, we propose a class of regularized Hermitian splitting iteration methods and prove its asymptotic convergence under mild conditions. For appropriate circulant‐based approximation to the corresponding regularized Hermitian splitting preconditioner, we demonstrate that the induced fast regularized Hermitian splitting preconditioner possesses a favorable preconditioning property. Numerical results show that, when used to precondition Krylov subspace iteration methods such as generalized minimal residual and biconjugate gradient stabilized methods, the fast preconditioner significantly outperforms several existing ones.