Multilevel a posteriori error analysis for reaction–convection–diffusion problems

We present a new approach to the a posteriori error analysis of stable Galerkin approximations of reaction–convection–diffusion problems. It relies upon a non-standard variational formulation of the exact problem, based on the anisotropic wavelet decomposition of the equation residual into convection-dominated scales and diffusion-dominated scales. The associated norm, which is stronger than the standard energy norm, provides a robust (i.e., uniform in the convection limit) control over the streamline derivative of the solution. We propose an upper estimator and a lower estimator of the error, in this norm, between the exact solution and any finite dimensional approximation of it. We investigate the behaviour of such estimators, both theoretically and through numerical experiments. As an output of our analysis, we find that the lower estimator is quantitatively accurate and robust.     

Lower bounds of error estimates for singular perturbation problems with Jacobi-Spectral approximations

With weighted orthogonal Jacobi polynomials, we study spectral approximations for singular perturbation problems on an interval. The singular parameters of the model are included in the basis functions, and then its stiff matrix is diagonal. Considering the estimations for weighted orthogonal coefficients, a special technique is proposed to investigate the a posteriori error estimates. In view of the difficulty of a posteriori error estimates for spectral approximations, we employ a truncation projection to study lower bounds for the models. Specially, we present the lower bounds of a posteriori error estimates with two different weighted norms in details.     

Convergence of Finite Element Approximations and Multilevel Linearization for Ginzburg–Landau Model of d-Wave Superconductors

In this paper, we consider the finite element approximations of a recently proposed Ginzburg–Landau-type model for d-wave superconductors. In contrast to the conventional Ginzburg–Landau model the scalar complex valued order-parameter is replaced by a multicomponent complex order-parameter and the free energy is modified according to the d-wave paring symmetry. Convergence and optimal error estimates and some superconvergent estimates for the derivatives are derived. Furthermore, we propose a multilevel linearization procedure to solve the nonlinear systems. It is proved that the optimal error estimates and superconvergence for the derivatives are preserved by the multilevel linearization algorithm.     

Adaptive characteristic finite element approximation of convection–diffusion optimal control problems

In this article, a characteristic finite element approximation of quadratic optimal control problems governed by linear convection–diffusion equations is given. We derive some a posteriori error estimates for both the control and the state approximations, where the control variable is constrained by pointwise inequality. The derived error estimators are then used as an error indicator to guide the mesh refinement. In this sense, they are very important in developing adaptive finite element algorithm for the optimal control problems. Finally, a numerical example is given to validate the efficiency and reliability of the theoretical results. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Reliable,goal‐oriented postprocessing for FE‐discretizations

In this article we present strategies to improve the quality of adaptive FE‐approximations measured in terms of linear functionals. The ideas are based on the so called dual‐weighted‐residual (DWR) approach to a posteriori error control for FE‐schemes. In more details, we exploit those parts of an underlying error representation, which are completely computable, to improve the FE‐solution. Furthermore, the remaining parts of the error identity can be estimated by well‐established a posteriori energy estimates yielding reliable error bounds for the postprocessed values. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Adaptive synchronization of T–S fuzzy chaotic systems with unknown parameters

This paper presents a fuzzy model-based adaptive approach for synchronization of chaotic systems which consist of the drive and response systems. Takagi–Sugeno (T–S) fuzzy model is employed to represent the chaotic drive and response systems. Since the parameters of the drive system are assumed unknown, we design the response system that estimates the parameters of the drive system by adaptive strategy. The adaptive law is derived to estimate the unknown parameters and its stability is guaranteed by Lyapunov stability theory. In addition, the controller in the response system contains two parts: one part that can stabilize the synchronization error dynamics and the other part that estimates the unknown parameters. Numerical examples, including Duffing oscillator and Lorenz attractor, are given to demonstrate the validity of the proposed adaptive synchronization approach.     

A Petrov–Galerkin spectral method for fourth‐order problems

In this paper, we consider the Petrov–Galerkin spectral method for fourth‐order elliptic problems on rectangular domains subject to non‐homogeneous Dirichlet boundary conditions. We derive some sharp results on the orthogonal approximations in one and two dimensions, which play important roles in numerical solutions of higher‐order problems. By applying these results to a fourth‐order problem, we establish the H²‐error and L²‐error bounds of the Petrov–Galerkin spectral method. Numerical experiments are provided to illustrate the high accuracy of the proposed method and coincide well with the theoretical analysis. Copyright © 2013 John Wiley & Sons, Ltd.     

Interpolation approximations based on Gauss–Lobatto–Legendre–Birkhoff quadrature

We derive in this paper the asymptotic estimates of the nodes and weights of the Gauss–Lobatto–Legendre–Birkhoff (GLLB) quadrature formula, and obtain optimal error estimates for the associated GLLB interpolation in Jacobi weighted Sobolev spaces. We also present a user-oriented implementation of the pseudospectral methods based on the GLLB quadrature nodes for Neumann problems. This approach allows an exact imposition of Neumann boundary conditions, and is as efficient as the pseudospectral methods based on Gauss–Lobatto quadrature for PDEs with Dirichlet boundary conditions.     

An accurate numerical method for solving the linear fractional Klein–Gordon equation

In this article, an implementation of an efficient numerical method for solving the linear fractional Klein–Gordon equation (LFKGE) is introduced. The fractional derivative is described in the Caputo sense. The method is based upon a combination between the properties of the Chebyshev approximations and finite difference method (FDM). The proposed method reduces LFKGE to a system of ODEs, which is solved using FDM. Special attention is given to study the convergence analysis and deduce an error upper bound of the proposed method. Numerical example is given to show the validity and the accuracy of the proposed algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

Two-level Galerkin–Lagrange multipliers method for the stationary Navier–Stokes equations

In this paper, we combine the Galerkin–Lagrange multiplier (GLM) method with the two-level method to solve the stationary Navier–Stokes equations in order to avoid the time-consuming process and the construction of zero-divergence elements. Different quadrilateral partitions are used for approximating the velocity and the pressure. Then some error estimates are obtained and some numerical results of the GLM method and the two-level GLM method are given. The results show that the two-level method based on the GLM method is more efficient than the GLM method under the convergence rate of same order.     

A finite element method for computing the bifurcation function for semilinear elliptic BVPs

The method of alternative problems can be used to show that a semilinear elliptic boundary value problem (Lu + g(x, u) = 0 with g_u(x, u) bounded below) is equivalent to a finite-dimensional problem ( , ), in the sense that their solution sets, which are not necessarily singletons, are in a one-to-one correspondence. This correspondence is based on a map σ from low-frequency to high-frequency Fourier components of solutions. A numerical method is presented for approximating σ and hence also solutions of the BVP. The method uses finite element approximations and avoids the use of eigenfunction expansions. Existence, uniqueness, and error estimates for the approximations of σ and solutions u are derived.     

A posteriori error estimation and error control for finite element approximations of the time-dependent Navier–Stokes equations

We present an approach to estimate numerical errors in finite element approximations of the time-dependent Navier–Stokes equations along with a strategy to control these errors. The error estimators and the error control procedure are based on the residuals of the Navier–Stokes equations, which are shown to be comparable to error components in the velocity variable. The present methodology applies to the estimation of numerical errors due to the spatial discretization only. Its performance is demonstrated for two-dimensional channel flows past a cylinder in the periodic regime.     

Computational analysis of supersonic turbulent boundary layers over rough surfaces using the k–ω and the stress–ω models

The influence of surface roughness in the prediction of the mean flow and turbulent properties of a high-speed supersonic (M = 2.7, Re/m = 2 × 10⁷) turbulent boundary layer flow over a flat plate is numerically investigated. In particular, the performance of the k–ω and stress–ω turbulence models is evaluated against the available experimental data. Even though the performance of these models have been proven satisfactory in the computation of incompressible boundary layer flow over rough surfaces, their validity for high-speed compressible has not been investigated yet. It is observed from this study that, for smooth surface, both k–ω and stress–ω models perform very well in predicting the mean flow and turbulence quantities in supersonic flow. For rough surfaces, both models matched the experimental data fairly well for lower roughness heights but performed unsatisfactorily for higher roughness conditions. Overall the performance of the k–ω model is better than the stress–ω model. The stress–ω model does not show any strong advantages to make up for the extra computational cost associated with it. The predictions indicate that the ω boundary conditions at the wall in both models, especially the stress–ω model, need to be refined and reconsidered to include the geometric factor for supersonic flow over surfaces with large roughness values.     

A posteriori error estimate for the Stokes–Darcy system

We consider the a posteriori error estimates for finite element approximations of the Stokes–Darcy system. The finite element spaces adopted are the Hood–Taylor element for the velocity and the pressure in fluid region and conforming piecewise quadratic element for the pressure in porous media region. The a posteriori error estimate is based on a suitable evaluation on the residual of the finite element solution. It is proven that the a posteriori error estimate provided in this paper is both reliable and efficient. Copyright © 2011 John Wiley & Sons, Ltd.     

Corrected finite difference eigenvalues of periodic Sturm–Liouville problems

Computation of eigenvalues of regular Sturm–Liouville problems with periodic boundary conditions is considered. We show that a proof similar to that given by Andrew (1989) can be used to prove that a correction technique applied to a finite difference scheme given by Vanden Berghe et al. (1995) reduces the error in the kth eigenvalue estimate from O(k⁴h²) to O(kh²), where h is the uniform mesh length. We also provide a significantly shorter proof of a slightly weaker result.     

On the global existence and time decay estimates in critical spaces for the Navier–Stokes–Poisson system

We are concerned with the study of the Cauchy problem for the Navier–Stokes–Poisson system in the critical regularity framework. In the case of a repulsive potential, we first establish the unique global solvability in any dimension for small perturbations of a linearly stable constant state. Next, under a suitable additional condition involving only the low frequencies of the data and in the L²‐critical framework (for simplicity), we exhibit optimal decay estimates for the constructed global solutions, which are similar to those of the barotropic compressible Navier–Stokes system. Our results rely on new a priori estimates for the linearized Navier–Stokes–Poisson system about a stable constant equilibrium, and on a refined time‐weighted energy functional.     

WEB‐spline based mesh‐free finite element analysis for the heat equation and the time‐dependent Navier–Stokes equation: A survey

In this article, we give some numerical techniques and error estimates using web‐spline based mesh‐free finite element method for the heat equation and the time‐dependent Navier–Stokes equations on bounded domains. The web‐spline method uses weighted extended B‐splines on a regular grid as basis functions and does not require any grid generation. We demonstrate the method by providing numerical results for the Poisson's and stationary Stokes equation. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Two‐grid methods for semilinear interface problems

In this article, we consider two‐grid finite element methods for solving semilinear interface problems in d space dimensions, for d = 2 or d = 3. We consider semilinear problems with discontinuous diffusion coefficients, which includes problems containing subcritical, critical, and supercritical nonlinearities. We establish basic quasioptimal a priori error estimates for Galerkin approximations. We then design a two‐grid algorithm consisting of a coarse grid solver for the original nonlinear problem, and a fine grid solver for a linearized problem. We analyze the quality of approximations generated by the algorithm and show that the coarse grid may be taken to have much larger elements than the fine grid, and yet one can still obtain approximation quality that is asymptotically as good as solving the original nonlinear problem on the fine mesh. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

On approximation intractability of the path–distance–width problem

Path–distance–width of a graph G=(V,E), denoted by pdw(G), is the minimum integer k satisfying that there is a nonempty subset of SV such that the number of the nodes with distance i from S is at most k for any nonnegative integer i. It is known that given a positive integer k and a graph G, the decision problem pdw(G)k is NP-complete even if G is a tree (Yamazaki et al. Lecture Notes in Computer Science, vol. 1203, Springer, Berlin, 1997, pp. 276–287). In this paper, we show that it is NP-hard to approximate the path–distance–width of a graph within a ratio for any >0, even for trees.     

Highly efficient parallel algorithm for finite difference solution to Navier–Stoke''s equation on a hypercube

It has been shown in [Nuclear Science and Engineering 93 (1986) 6799] that the finite difference discretization of Navier–Stoke's equation leads to the solution of N×N system written in the matrix form as My=B, where M is a quasi-tridiagonal having non-zero elements at the top right and bottom left corners. We present an efficient parallel algorithm on a p-processor hypercube implemented in two phases. In phase I a generalization of an algorithm due to Kowalik [High Speed Computation, Springer, New York] is developed which decomposes the above matrix system into smaller quasi-tridiagonal (p+1)×(p+1) subsystem, which is then solved in Phase II using an odd–even reduction method.