The limit behavior of the second‐grade fluid equations

In the paper, the limit behavior of solutions to the second‐grade fluid system with no‐slip boundary conditions is studied as both ν→0 and α→0. More precisely, it is verified that the convergence from second‐grade fluid system to Euler system holds as ν→0 and α→0 independently under the radial symmetry case.     

Numerical analysis and iteration acceleration of a fully implicit scheme for nonlinear diffusion problem with second‐order time evolution

Fully implicit schemes with second‐order time evolutions have been applied to simulate nonlinear diffusion problems precisely for a long time, but there is seldom theoretical study for either their convergence properties or efficient iterations. Here, a second‐order time evolution fully implicit scheme for two‐dimensional nonlinear divergence diffusion problem is analyzed. The unique existence of its solution is given. Two new methods are provided to prove its convergence, including entire inductive hypothesis reasoning and a two‐step reasoning process. Rigorous analysis shows the scheme is stable; its solution has second‐order convergence in both space and time to the exact solution of the problem. The convergence is applied to analyze a Newton iteration accelerating the computation and show its quadratic convergent speed and second‐order accuracy. The reasoning techniques also adapt to first‐order time accuracy schemes, and can be extended to analyze a wide class of nonlinear schemes for nonlinear problems. Numerical tests highlight the theoretical results and demonstrate the high performance of the algorithms. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 121–140, 2016     

A new one‐step smoothing newton method for the second‐order cone complementarity problem

In this paper, we present a new one‐step smoothing Newton method for solving the second‐order cone complementarity problem (SOCCP). Based on a new smoothing function, the SOCCP is approximated by a family of parameterized smooth equations. At each iteration, the proposed algorithm only need to solve one system of linear equations and perform only one Armijo‐type line search. The algorithm is proved to be convergent globally and superlinearly without requiring strict complementarity at the SOCCP solution. Moreover, the algorithm has locally quadratic convergence under mild conditions. Numerical experiments demonstrate the feasibility and efficiency of the new algorithm. Copyright © 2010 John Wiley & Sons, Ltd.     

Analytic approximate solution of three‐dimensional Navier‐Stokes equations of flow between two stretchable disks

The similarity transform for the steady three‐dimensional Navier‐Stokes equations of flow between two stretchable disks gives a system of nonlinear ordinary differential equations which is analytically solved by applying a newly developed method, namely, the homotopy analysis method. The analytic solutions of the system of nonlinear ordinary differential equations are constructed in the series form. The convergence of the obtained series solutions is analyzed. The validity of our solutions is verified by the numerical results. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Fast terminal sliding mode controller design for nonlinear second‐order systems with time‐varying uncertainties

This article investigates a novel fast terminal sliding mode control approach combined with global sliding surface structure for the robust tracking control of nonlinear second‐order systems with time‐varying uncertainties. The suggested control technique is formulated based on the Lyapunov stability theory and guarantees the existence of the sliding mode around the sliding surface in a finite time. Using the new form of switching surface, the reaching phase elimination and the robustness improvement of the whole system are satisfied. Simulation results demonstrate the efficiency of the proposed technique. © 2014 Wiley Periodicals, Inc. Complexity 21: 239–244, 2015     

Unconditional non‐linear stability for a fluid of third grade

The thermal convection in a layer of a third grade fluid is investigated, with viscosity being a general function of temperature. We develop a non‐linear stability analysis and prove that unconditional non‐linear stability criterion is achieved using a natural energy approach. This shows that, in some sense, the equations for a fluid of third grade are preferable to those for a fluid of second grade or a dipolar fluid. Copyright © 2004 John Wiley & Sons, Ltd.     

Boundary value problems on half‐line for second‐order nonlinear impulsive differential equations

We obtain sufficient conditions for existence and uniqueness of solutions of boundary value problems on half‐line for a class of second‐order nonlinear impulsive differential equations. Our technique is different than the traditional ones, as it is based on asymptotic integration method involving principal and nonprincipal solutions. Examples are provided to illustrate the relevance of the results.     

Convergence analysis for second‐order accurate schemes for the periodic nonlocal Allen‐Cahn and Cahn‐Hilliard equations

In this paper, we provide a detailed convergence analysis for fully discrete second‐order (in both time and space) numerical schemes for nonlocal Allen‐Cahn and nonlocal Cahn‐Hilliard equations. The unconditional unique solvability and energy stability ensures ? ⁴ stability. The convergence analysis for the nonlocal Allen‐Cahn equation follows the standard procedure of consistency and stability estimate for the numerical error function. For the nonlocal Cahn‐Hilliard equation, because of the complicated form of the nonlinear term, a careful expansion of its discrete gradient is undertaken, and an H ^?1 inner‐product estimate of this nonlinear numerical error is derived to establish convergence. In addition, an a priori bound of the numerical solution at the discrete level is needed in the error estimate. Such a bound can be obtained by performing a higher order consistency analysis by using asymptotic expansions for the numerical solution. Following the technique originally proposed by Strang (eg, 1964), instead of the standard comparison between the exact and numerical solutions, an error estimate between the numerical solution and the constructed approximate solution yields an O (s ³+h ⁴) convergence in norm, in which s and h denote the time step and spatial mesh sizes, respectively. This in turn leads to the necessary bound under a standard constraint s ≤C h . Here, we also prove convergence of the scheme in the maximum norm under the same constraint.     

The modulus‐based matrix splitting algorithms for a class of weakly nonlinear complementarity problems

In this paper, we study a class of weakly nonlinear complementarity problems arising from the discretization of free boundary problems. By reformulating the complementarity problems as implicit fixed‐point equations based on splitting of the system matrices, we propose a class of modulus‐based matrix splitting algorithms. We show their convergence by assuming that the system matrix is positive definite. Moreover, we give several kinds of typical practical choices of the modulus‐based matrix splitting iteration methods based on the different splitting of the system matrix. Numerical experiments on two model problems are presented to illustrate the theoretical results and examine the numerical effectiveness of our modulus‐based matrix splitting algorithms. Copyright © 2016 John Wiley & Sons, Ltd.     

A correction method for finding lower bounds of eigenvalues of the second‐order elliptic and Stokes operators

In this paper, for the second‐order elliptic and Stokes eigenvalue problems with variable coefficients, we propose a correction method to nonconforming eigenvalue approximations and prove that the corrected eigenvalues converge to the exact ones asymptotically from below. In particular, the asymptotic lower bound property of corrected eigenvalues is always valid whether the eigenfunctions are smooth or singular. Finally, we prove that the convergence order of corrected eigenvalues is still the same as that of uncorrected eigenvalues.     

The max‐length‐vector line of best fit to a set of vector subspaces and an optimization problem over a set of hyperellipsoids

Let be a collection of subspaces of a finite‐dimensional real vector space V. Let L denote a one‐dimensional subspace of V, and let θ(L,V_i) denote the principal angle between L and V_i. Motivated by a problem in data analysis, we seek an L that maximizes the function . Conceptually, this is the line through the origin that best represents with respect to the criterion F(L). A reformulation shows that L is spanned by a vector , which maximizes the function subject to the constraints v_i∈V_i and ||v_i||=1. In this setting, v is seen to be the longest vector that can be decomposed into unit vectors lying on prescribed hyperspheres. A closely related problem is to find the longest vector that can be decomposed into vectors lying on prescribed hyperellipsoids. Using Lagrange multipliers, the critical points of either problem can be cast as solutions of a multivariate eigenvalue problem. We employ homotopy continuation and numerical algebraic geometry to solve this problem and obtain the extremal decompositions. Copyright © 2015 John Wiley & Sons, Ltd.     

A second‐order energy stable backward differentiation formula method for the epitaxial thin film equation with slope selection

In this article, we study a new second‐order energy stable Backward Differentiation Formula (BDF) finite difference scheme for the epitaxial thin film equation with slope selection (SS). One major challenge for higher‐order‐in‐time temporal discretizations is how to ensure an unconditional energy stability without compromising numerical efficiency or accuracy. We propose a framework for designing a second‐order numerical scheme with unconditional energy stability using the BDF method with constant coefficient stabilizing terms. Based on the unconditional energy stability property that we establish, we derive an stability for the numerical solution and provide an optimal convergence analysis. To deal with the highly nonlinear four‐Laplacian term at each time step, we apply efficient preconditioned steepest descent and preconditioned nonlinear conjugate gradient algorithms to solve the corresponding nonlinear system. Various numerical simulations are presented to demonstrate the stability and efficiency of the proposed schemes and solvers. Comparisons with other second‐order schemes are presented.     

Stokes’ first problem for the rotating flow of a third grade fluid

This work is concerned with the unsteady rotating flow of the third grade fluid over a suddenly moving plate in its own plane. The non-linear problem governing the flow has been solved numerically. The influence of material parameter of third grade fluid and rotation upon the velocity has been discussed.     

A Fourier pseudospectral method for the “good” Boussinesq equation with second‐order temporal accuracy

In this article, we discuss the nonlinear stability and convergence of a fully discrete Fourier pseudospectral method coupled with a specially designed second‐order time‐stepping for the numerical solution of the “good” Boussinesq equation. Our analysis improves the existing results presented in earlier literature in two ways. First, a convergence for the solution and convergence for the time‐derivative of the solution are obtained in this article, instead of the convergence for the solution and the convergence for the time‐derivative, given in De Frutos, et al., Math Comput 57 (1991), 109–122. In addition, we prove that this method is unconditionally stable and convergent for the time step in terms of the spatial grid size, compared with a severe restriction time step restriction required by the proof in De Frutos, et al., Math Comput 57 (1991), 109–122.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 202–224, 2015     

A second‐order finite difference approximation for a mathematical model of erythropoiesis

We present a second‐order finite difference scheme for approximating solutions of a mathematical model of erythropoiesis, which consists of two nonlinear partial differential equations and one nonlinear ordinary differential equation. We show that the scheme achieves second‐order accuracy for smooth solutions. We compare this scheme to a previously developed first‐order method and show that the first order method requires significantly more computational time to provide solutions with similar accuracy. We also compare this numerical scheme with other well‐known second‐order methods and show that it has better capability in approximating discontinuous solutions. Finally, we present an application to recovery after blood loss. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Uniform convergence of Galerkin‐multigrid methods for nonconforming finite elements for second‐order problems with less than full elliptic regularity

In this article we prove uniform convergence estimates for the recently developed Galerkin‐multigrid methods for nonconforming finite elements for second‐order problems with less than full elliptic regularity. These multigrid methods are defined in terms of the “Galerkin approach,” where quadratic forms over coarse grids are constructed using the quadratic form on the finest grid and iterated coarse‐to‐fine intergrid transfer operators. Previously, uniform estimates were obtained for problems with full elliptic regularity, whereas these estimates are derived with less than full elliptic regularity here. Applications to the nonconforming P₁, rotated Q₁, and Wilson finite elements are analyzed. The result applies to the mixed method based on finite elements that are equivalent to these nonconforming elements. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 203–217, 2002; DOI 10.1002/num.10004     

Performance and numerical behavior of the second‐order scheme of precise time‐step integration for transient dynamic analysis

Spurious high‐frequency responses resulting from spatial discretization in time‐step algorithms for structural dynamic analysis have long been an issue of concern in the framework of traditional finite difference methods. Such algorithms should be not only numerically dissipative in a controllable manner, but also unconditionally stable so that the time‐step size can be governed solely by the accuracy requirement. In this article, the issue is considered in the framework of the second‐order scheme of the precise integration method (PIM). Taking the Newmark‐β method as a reference, the performance and numerical behavior of the second‐order PIM for elasto‐dynamic impact‐response problems are studied in detail. In this analysis, the differential quadrature method is used for spatial discretization. The effects of spatial discretization, numerical damping, and time step on solution accuracy are explored by analyzing longitudinal vibrations of a shock‐excited rod with rectangular, half‐triangular, and Heaviside step impact. Both the analysis and numerical tests show that under the framework of the PIM, the spatial discretization used here can provide a reasonable number of model types for any given error tolerance. In the analysis of dynamic response, an appropriate spatial discretization scheme for a given structure is usually required in order to obtain an accurate and meaningful numerical solution, especially for describing the fine details of traction responses with sharp changes. Under the framework of the PIM, the numerical damping that is often required in traditional integration schemes is found to be unnecessary, and there is no restriction on the size of time steps, because the PIM can usually produce results with machine‐like precision and is an unconditionally stable explicit method. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A new technique of using homotopy analysis method for solving high‐order nonlinear differential equations

In this paper, a new technique of homotopy analysis method (HAM) is proposed for solving high‐order nonlinear initial value problems. This method improves the convergence of the series solution, eliminates the unneeded terms and reduces time consuming in the standard homotopy analysis method (HAM) by transform the nth‐order nonlinear differential equation to a system of n first‐order equations. Second‐ and third‐ order problems are solved as illustration examples of the proposed method. Copyright © 2010 John Wiley & Sons, Ltd.     

A second‐order linearized difference scheme on nonuniform meshes for nonlinear parabolic systems with Dirichlet boundary value conditions

A linearized three‐level difference scheme on nonuniform meshes is derived by the method of the reduction of order for the Dirichlet boundary value problem of the nonlinear parabolic systems. It is proved that the difference scheme is uniquely solvable and second order convergent in L_∞‐norm. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 638–652, 2003