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.     

An hp‐adaptive Newton‐Galerkin finite element procedure for semilinear boundary value problems

In this paper, we develop an hp‐adaptive procedure for the numerical solution of general, semilinear elliptic boundary value problems in 1d, with possible singular perturbations. Our approach combines both a prediction‐type adaptive Newton method and an hp‐version adaptive finite element discretization (based on a robust a posteriori residual analysis), thereby leading to a fully hp‐adaptive Newton–Galerkin scheme. Numerical experiments underline the robustness and reliability of the proposed approach for various examples. Copyright © 2016 John Wiley & Sons, Ltd.     

hp–Adaptive composite discontinuous Galerkin methods for elliptic problems on complicated domains

In this article, we develop the a posteriori error estimation of hp–version discontinuous Galerkin composite finite element methods for the discretization of second‐order elliptic partial differential equations. This class of methods allows for the approximation of problems posed on computational domains which may contain a huge number of local geometrical features, or microstructures. Although standard numerical methods can be devised for such problems, the computational effort may be extremely high, as the minimal number of elements needed to represent the underlying domain can be very large. In contrast, the minimal dimension of the underlying composite finite element space is independent of the number of geometric features. Computable bounds on the error measured in terms of a natural (mesh‐dependent) energy norm are derived. Numerical experiments highlighting the practical application of the proposed estimators within an automatic hp–adaptive refinement procedure will be presented. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1342–1367, 2014     

Adaptive operator splitting finite element method for Allen–Cahn equation

In this paper, a new numerical method is proposed and analyzed for the Allen–Cahn (AC) equation. We divide the AC equation into linear section and nonlinear section based on the idea of operator splitting. For the linear part, it is discretized by using the Crank–Nicolson scheme and solved by finite element method. The nonlinear part is solved accurately. In addition, a posteriori error estimator of AC equation is constructed in adaptive computation based on superconvergent cluster recovery. According to the proposed a posteriori error estimator, we design an adaptive algorithm for the AC equation. Numerical examples are also presented to illustrate the effectiveness of our adaptive procedure.     

Patch‐wise local projection stabilized finite element methods for convection–diffusion–reaction problems

In this article, we develop patch‐wise local projection‐stabilized conforming and nonconforming finite element methods for the convection–diffusion–reaction problems. It is a composition of the standard Galerkin finite element method, the patch‐wise local projection stabilization, and weakly imposed Dirichlet boundary conditions on the discrete solution. In this paper, a priori error analysis is established with respect to a patch‐wise local projection norm for the conforming and the nonconforming finite element methods. The numerical experiments confirm the efficiency of the proposed stabilization technique and validate the theoretical convergence rates.     

Blow‐up of smooth solutions to the Navier–Stokes–Poisson equations

The main purpose of this paper is concerned with blow‐up smooth solutions to Navier–Stokes–Poisson (N‐S‐P) equations. First, we present a sufficient condition on the blow up of smooth solutions to the N‐S‐P system. Then we construct a family of analytical solutions that blow up in finite time. Copyright © 2010 John Wiley & Sons, Ltd.     

Minimum residual iteration for a dual–dual mixed formulation of exterior transmission problems

We investigate the minimum residual method for symmetric, indefinite linear systems of a so‐called dual–dual structure. These systems arise when using a combined dual‐mixed finite element method with a Dirichlet‐to‐Neumann mapping to solve a class of exterior transmission problems. As a model problem we consider an elliptic equation of divergence form coupled with the Laplace equation in an unbounded region of the plane. We give abstract convergence results for the preconditioned minimum residual method for the solution of linear systems of the special dual–dual structure. For our model problem, we show that this iterative method provides an efficient solution procedure where standard preconditioners can directly be used. Copyright © 2001 John Wiley & Sons, Ltd.     

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 fully adaptive approximation for quenching‐type reaction‐diffusion equations over circular domains

This article studies a fully adaptive finite difference method for solving quenching‐type nonlinear reaction‐diffusion equations over circular domains. Although an auxiliary condition at the origin and radial symmetry are imposed, adaptations are accomplished via arc‐length‐based monitoring functions in space and time, respectively. The monotonicity and positivity of the numerical solution are proved following a suitable grid constraint, and the numerical stability is ensured in the von Neumann sense. Theoretical bounds of the critical quenching radius are obtained and then refined through the computation. Computational examples are provided to illustrate the effectiveness and plausibility of the new adaptive computational procedure developed. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 472–489, 2014     

Decoupled characteristic stabilized finite element method for time‐dependent Navier–Stokes/Darcy model

In this article, we propose and analyze a new decoupled characteristic stabilized finite element method for the time‐dependent Navier–Stokes/Darcy model. The key idea lies in combining the characteristic method with the stabilized finite element method to solve the decoupled model by using the lowest‐order conforming finite element space. In this method, the original model is divided into two parts: one is the nonstationary Navier–Stokes equation, and the other one is the Darcy equation. To deal with the difficulty caused by the trilinear term with nonzero boundary condition, we use the characteristic method. Furthermore, as the lowest‐order finite element pair do not satisfy LBB (Ladyzhen‐Skaya‐Brezzi‐Babuska) condition, we adopt the stabilized technique to overcome this flaw. The stability of the numerical method is first proved, and the optimal error estimates are established. Finally, extensive numerical results are provided to justify the theoretical analysis.     

Spike patterns in a reaction–diffusion ODE model with Turing instability

We explore a mechanism of pattern formation arising in processes described by a system of a single reaction–diffusion equation coupled with ordinary differential equations. Such systems of equations arise from the modeling of interactions between cellular processes and diffusing growth factors. We focus on the model of early carcinogenesis proposed by Marciniak‐Czochra and Kimmel, which is an example of a wider class of pattern formation models with an autocatalytic non‐diffusing component. We present a numerical study showing emergence of periodic and irregular spike patterns because of diffusion‐driven instability. To control the accuracy of simulations, we develop a numerical code on the basis of the finite‐element method and adaptive mesh grid. Simulations, supplemented by numerical analysis, indicate a novel pattern formation phenomenon on the basis of the emergence of nonstationary structures tending asymptotically to a sum of Dirac deltas. Copyright © 2013 John Wiley & Sons, Ltd.     

Fractional Crank–Nicolson–Galerkin finite element scheme for the time‐fractional nonlinear diffusion equation

This article presents a finite element scheme with Newton's method for solving the time‐fractional nonlinear diffusion equation. For time discretization, we use the fractional Crank–Nicolson scheme based on backward Euler convolution quadrature. We discuss the existence‐uniqueness results for the fully discrete problem. A new discrete fractional Gronwall type inequality for the backward Euler convolution quadrature is established. A priori error estimate for the fully discrete problem in L²(Ω) norm is derived. Numerical results based on finite element scheme are provided to validate theoretical estimates on time‐fractional nonlinear Fisher equation and Huxley equation.     

Least‐squares finite element method on adaptive grid for PDEs with shocks

We apply the least‐squares finite element method with adaptive grid to nonlinear time‐dependent PDEs with shocks. The least‐squares finite element method is also used in applying the deformation method to generate the adaptive moving grids. The effectiveness of this method is demonstrated by solving a Burgers' equation with shocks. Computational results on uniform grids and adaptive grids are compared for the purpose of evaluation. The results show that the adaptive grids can capture the shock more sharply with significantly less computational time. For moving shock, the adaptive grid moves correctly with the shock. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

BEM‐FEM coupling for the 1D Klein–Gordon equation

A transmission (bidomain) problem for the one‐dimensional Klein–Gordon equation on an unbounded interval is numerically solved by a boundary element method‐finite element method (BEM‐FEM) coupling procedure. We prove stability and convergence of the proposed method by means of energy arguments. Several numerical results are presented, confirming theoretical results. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 2042–2082, 2014     

Galerkin‐type space‐time finite elements for volumetrically coupled problems

The study focuses on error estimation techniques for a coupled problem with two constituents based on the Theory of Porous Media. After developing space‐time finite elements for this mixed problem, we extend the numerical scheme to a coupled space‐time adaptive strategy. Therefore, an adjoint or dual problem is formulated and discussed, which is solved lateron numerically. One advantage of the presented technique is the high flexibility of the error indicator with respect to the error measure.     

Adaptive Coupling and Fast Solution of FEM–BEM Equations for Parabolic–Elliptic Interface Problems

In this paper we prove an a posteriori error estimate for the symmetric coupling of finite elements and boundary elements applied to linear parabolic–elliptic interface problems. The discontinuous Galerkin method is used for the discretization in time. We present an adaptive algorithm for choosing the mesh size in space and time and we analyse the Hybrid Modified Conjugate Residual (HMCR) method as a solution method for the linear systems which arise. Computational results show that the number of HMCR-iterations grows slowly with the problem size. © 1997 by B. G. Teubner Stuttgart–John Wiley & Sons Ltd.     

The fast scalar auxiliary variable approach with unconditional energy stability for nonlocal Cahn–Hilliard equation

Comparing with the classical local gradient flow and phase field models, the nonlocal models such as nonlocal Cahn–Hilliard equations equipped with nonlocal diffusion operator can describe more practical phenomena for modeling phase transitions. In this paper, we construct an accurate and efficient scalar auxiliary variable approach for the nonlocal Cahn–Hilliard equation with general nonlinear potential. The first contribution is that we have proved the unconditional energy stability for nonlocal Cahn–Hilliard model and its semi‐discrete schemes carefully and rigorously. Second, what we need to focus on is that the nonlocality of the nonlocal diffusion term will lead the stiffness matrix to be almost full matrix which generates huge computational work and memory requirement. For spatial discretizaion by finite difference method, we find that the discretizaition for nonlocal operator will lead to a block‐Toeplitz–Toeplitz‐block matrix by applying four transformation operators. Based on this special structure, we present a fast procedure to reduce the computational work and memory requirement. Finally, several numerical simulations are demonstrated to verify the accuracy and efficiency of our proposed schemes.     

Quasi‐optimality of the adaptive finite element method for the eigenvalue problem arising from the vibration frequencies of the cavity flow

In this article, we present a posteriori error analysis for the regularization formulation of the eigenvalue problem arising from the vibration frequencies of the cavity flow. The quasi‐optimality of the adaptive finite element method is also proved for the single eigenvalues under the Dörfler's marking strategy without marking the oscillation terms and enforcing the so‐called interior node property. Numerical examples illustrate the quasi‐optimality of the adaptive finite element method. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 900–922, 2015     

A posteriori error analysis of an augmented fully mixed formulation for the nonisothermal Oldroyd–Stokes problem

In this article, we consider an augmented fully mixed variational formulation that has been recently proposed for the nonisothermal Oldroyd–Stokes problem, and develop an a posteriori error analysis for the 2‐D and 3‐D versions of the associated mixed finite element scheme. More precisely, we derive two reliable and efficient residual‐based a posteriori error estimators for this problem on arbitrary (convex or nonconvex) polygonal and polyhedral regions. The reliability of the proposed estimators draws mainly upon the uniform ellipticity of the bilinear forms of the continuous formulation, suitable assumptions on the domain and the data, stable Helmholtz decompositions, and the local approximation properties of the Clément and Raviart–Thomas operators. On the other hand, inverse inequalities, the localization technique based on bubble functions, and known results from previous works are the main tools yielding the efficiency estimate. Finally, several numerical results confirming the properties of the a posteriori error estimators and illustrating the performance of the associated adaptive algorithms are reported.     

A shift‐adaptive meshfree method for solving a class of initial‐boundary value problems with moving boundaries in one‐dimensional domain

A new shift‐adaptive meshfree method for solving a class of time‐dependent partial differential equations (PDEs) in a bounded domain (one‐dimensional domain) with moving boundaries and nonhomogeneous boundary conditions is introduced. The radial basis function (RBF) collocation method is combined with the finite difference scheme, because, unlike with Kansa's method, nonlinear PDEs can be converted to a system of linear equations. The grid‐free property of the RBF method is exploited, and a new adaptive algorithm is used to choose the location of the collocation points in the first time step only. In fact, instead of applying the adaptive algorithm on the entire domain of the problem (like with other existing adaptive algorithms), the new adaptive algorithm can be applied only on time steps. Furthermore, because of the radial property of the RBFs, the new adaptive strategy is applied only on the first time step; in the other time steps, the adaptive nodes (obtained in the first time step) are shifted. Thus, only one small system of linear equations must be solved (by LU decomposition method) rather than a large linear or nonlinear system of equations as in Kansa's method (adaptive strategy applied to entire domain), or a large number of small linear systems of equations in the adaptive strategy on each time step. This saves a lot in time and memory usage. Also, Stability analysis is obtained for our scheme, using Von Neumann stability analysis method. Results show that the new method is capable of reducing the number of nodes in the grid without compromising the accuracy of the solution, and the adaptive grading scheme is effective in localizing oscillations due to sharp gradients or discontinuities in the solution. The efficiency and effectiveness of the proposed procedure is examined by adaptively solving two difficult benchmark problems, including a regularized long‐wave equation and a Korteweg‐de Vries problem. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1622–1646, 2016