CONVERGENCE OF THE CRANK-NICOLSON/NEWTON SCHEME FOR NONLINEAR PARABOLIC PROBLEM

In this paper, the Crank-Nicolson/Newton scheme for solving numerically secondorder nonlinear parabolic problem is proposed. The standard Galerkin finite element method based on P2 conforming elements is used to the spatial discretization of the problem and the Crank-Nicolson/Newton scheme is applied to the time discretization of the resulted finite element equations. Moreover, assuming the appropriate regularity of the exact solution and the finite element solution, we obtain optimal error estimates of the fully discrete CrankNicolson/Newton scheme of nonlinear parabolic problem. Finally, numerical experiments are presented to show the efficient performance of the proposed scheme.     

Two‐grid mixed finite‐element methods for nonlinear Schrödinger equations

Two‐grid mixed finite element schemes are developed for solving both steady state and unsteady state nonlinear Schrödinger equations. The schemes use discretizations based on a mixed finite‐element method. The two‐grid approach yields iterative procedures for solving the nonlinear discrete equations. The idea is to relegate all of the Newton‐like iterations to grids much coarser than the final one, with no loss in order of accuracy. Numerical tests are performed. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 63‐73, 2012     

Mesh independent superlinear convergence of an inner–outer iterative method for semilinear elliptic interface problems

We propose the damped inexact Newton method, coupled with preconditioned inner iterations, to solve the finite element discretization of a class of nonlinear elliptic interface problems. The linearized equations are solved by a preconditioned conjugate gradient method. Both the inner and outer iterations exhibit mesh independent superlinear convergence.     

分数阶Burgers方程的有限元计算(英文)

建立了一维和二维分数阶Burgers方程的有限元格式.时间分数阶导数使用L1方法离散,空间方向使用有限元方法离散.通过选择合适的基函数,将离散后的方程转化成一个非线性代数方程组,并应用牛顿迭代方法求解.数值实验显示出了方法的有效性.     

Numerical comparison of three stochastic methods for nonlinear PN junction problems

We apply the Monte Carlo, stochastic Galerkin, and stochastic collocation methods to solving the drift-diffusion equations coupled with the Poisson equation arising in semiconductor devices with random rough surfaces. Instead of dividing the rough surface into slices, we use stochastic mapping to transform the original deterministic equations in a random domain into stochastic equations in the corresponding deterministic domain. A finite element discretization with the help of AFEPack is applied to the physical space, and the equations obtained are solved by the approximate Newton iterative method. Comparison of the three stochastic methods through numerical experiment on different PN junctions are given. The numerical results show that, for such a complicated nonlinear problem, the stochastic Galerkin method has no obvious advantages on efficiency except accuracy over the other two methods, and the stochastic collocation method combines the accuracy of the stochastic Galerkin method and the easy implementation of the Monte Carlo method.     

A two‐level finite element method for the stationary Navier‐Stokes equations based on a stabilized local projection

In this article, we propose a two‐level finite element method to analyze the approximate solutions of the stationary Navier‐Stokes equations based on a stabilized local projection. The local projection allows to circumvent the Babuska‐Brezzi condition by using equal‐order finite element pairs. The local projection can be used to stabilize high equal‐order finite element pairs. The proposed method combines the local projection stabilization method and the two‐level method under the assumption of the uniqueness condition. The two‐level method consists of solving a nonlinear equation on the coarse mesh and solving a linear equation on fine mesh. The nonlinear equation is solved by the one‐step Newtonian iteration method. In the rest of this article, we show the error analysis of the lowest equal‐order finite element pair and provide convergence rate of approximate solutions. Furthermore, the numerical illustrations coincide with the theoretical analysis expectations. From the view of computational time, the results show that the two‐level method is effective to solve the stationary Navier‐Stokes equations. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

A COMPUTATIONAL APPROACH FOR OPTIMAL CONTROL SYSTEMS GOVERNED BY PARABOLIC VARIATIONAL INEQUALITIES

Iterative techniques for solving optimal control systems governed by parabolic variational inequalities are presented. The techniques we use are based on linear finite elements method to approximate the state equations and nonlinear conjugate gradient methods to solve the discrete optimal control problem. Convergence results and numerical experiments are presented.     

求解摩擦接触问题的一个非内点光滑化算法

给出了一个求解三维弹性有摩擦接触问题的新算法,即基于NCP函数的非内点光滑化算法．首先通过参变量变分原理和参数二次规划法,将三维弹性有摩擦接触问题的分析归结为线性互补问题的求解;然后利用NCP函数,将互补问题的求解转换为非光滑方程组的求解;再用凝聚函数对其进行光滑化,最后用NEWTON法解所得到的光滑非线性方程组．方法具有易于理解及实现方便等特点．通过线性互补问题的数值算例及接触问题实例证实了该算法的可靠性与有效性．     

Fully discrete T‐ψ finite element method to solve a nonlinear induction hardening problem

We study an induction hardening model described by Maxwell's equations coupled with a heat equation. The magnetic induction field is assumed a nonlinear constitutional relation and the electric conductivity is temperature‐dependent. The T ‐ψ method is to transform Maxwell's equations to the vector–scalar potential formulations and to solve the potentials by means of the finite element method. In this article, we present a fully discrete T ‐ψ finite element scheme for this nonlinear coupled problem and discuss its solvability. We prove that the discrete solution converges to a weak solution of the continuous problem. Finally, we conclude with two numerical experiments for the coupled system.     

非光滑非线性互补问题的牛顿法

研究了非光滑的非线性互补问题. 首先将非光滑的非线性互补问题转化为一个非光滑方程组,然后用牛顿法求解这个非光滑方程组. 在该牛顿法中,每次迭代只需一个原始函数B-微分中的一个元素. 最后证明了该牛顿法的超线性收敛性.     

轴对称非线性磁场分布的有限元分析

一、引言 轴对称电磁结构在轴对称电流作用下的磁场分布问题本是三维问题,利用轴对称关系可将三维麦克斯韦方程化为形如下面(1)式的二维非线性椭圆型方程.它与标准的平面磁场方程有所不同.而且v(B)不是B的单增函数.实际工程中的大型圆柱变压器、平     

Two‐level Newton iterative method for the 2D/3D steady Navier‐Stokes equations

A combination method of the Newton iteration and two‐level finite element algorithm is applied for solving numerically the steady Navier‐Stokes equations under the strong uniqueness condition. This algorithm is motivated by applying the m Newton iterations for solving the Navier‐Stokes problem on a coarse grid and computing the Stokes problem on a fine grid. Then, the uniform stability and convergence with respect to ν of the two‐level Newton iterative solution are analyzed for the large m and small H and h << H. Finally, some numerical tests are made to demonstrate the effectiveness of the method. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

The coupling system of Navier–Stokes equations and elastic Navier–Lame equations in a blood vessel

In this paper, the blood flow problem is considered in a blood vessel, and a coupling system of Navier–Stokes equations and linear elastic equations, Navier–Lame equations, in a cylinder with cylindrical elastic shell is given as the governing equations of the problem. We provide two finite element models to simulating the three-dimensional Navier–Stokes equations in the cylinder while the asymptotic expansion method is used to solving the linearly elastic shell equations. Specifically, in order to discrete the Navier–Stokes equations, the dimensional splitting strategy is constructed under the cylinder coordinate system. The spectral method is adopted along the rotation direction while the finite element method is used along the other directions. By using the above strategy, we get a series of two-dimensional-three-components (2D-3C) fluid problems. By introduce the S-coordinate system in E³ and employ the thickness of blood vessel wall as the expanding parameter, the asymptotic expansion method can be established to approximate the solution of the 3D elastic problem. The interface contact conditions can be treated exactly based on the knowledge of tensor analysis. Finally, numerical test shows that our method is reasonable.     

A TWO-LEVEL FINITE ELEMENT GALERKIN METHOD FOR THE NONSTATIONARY NAVIER-STOKES EQUATIONS II： TIME DISCRETIZATION

In this article we consider the fully discrete two-level finite element Galerkin method for the two-dimensional nonstationary incompressible Navier-Stokes equations. This method consists in dealing with the fully discrete nonlinear Navier-Stokes problem on a coarse mesh with width $H$ and the fully discrete linear generalized Stokes problem on a fine mesh with width $h << H$. Our results show that if we choose $H=O(h^{1/2}$) this method is as the same stability and convergence as the fully discrete standard finite element Galerkin method which needs dealing with the fully discrete nonlinear Navier-Stokes problem on a fine mesh with width $h$. However, our method is cheaper than the standard fully discrete finite element Galerkin method.     

A Two‐Parameter Stabilized Finite Element Method for Incompressible Flows

Based on two‐grid discretizations, a two‐parameter stabilized finite element method for the steady incompressible Navier–Stokes equations at high Reynolds numbers is presented and studied. In this method, a stabilized Navier–Stokes problem is first solved on a coarse grid, and then a correction is calculated on a fine grid by solving a stabilized linear problem. The stabilization term for the nonlinear Navier–Stokes equations on the coarse grid is based on an elliptic projection, which projects higher‐order finite element interpolants of the velocity into a lower‐order finite element interpolation space. For the linear problem on the fine grid, either the same stabilization approach (with a different stabilization parameter) as that for the coarse grid problem or a completely different stabilization approach could be employed. Error bounds for the discrete solutions are estimated. Algorithmic parameter scalings of the method are also derived. The theoretical results show that, with suitable scalings of the algorithmic parameters, this method can yield an optimal convergence rate. Numerical results are provided to verify the theoretical predictions and demonstrate the effectiveness of the proposed method. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 425–444, 2017     

Finite termination of a Newton-type algorithm for a class of affine variational inequality problems

Many optimization problems can be reformulated as a system of equations. One may use the generalized Newton method or the smoothing Newton method to solve the reformulated equations so that a solution of the original problem can be found. Such methods have been powerful tools to solve many optimization problems in the literature. In this paper, we propose a Newton-type algorithm for solving a class of monotone affine variational inequality problems (AVIPs for short). In the proposed algorithm, the techniques based on both the generalized Newton method and the smoothing Newton method are used. In particular, we show that the algorithm can find an exact solution of the AVIP in a finite number of iterations under an assumption that the solution set of the AVIP is nonempty. Preliminary numerical results are reported.     

A three-step Oseen-linearized finite element method for incompressible flows with damping

This paper introduces a three-step Oseen-linearized finite element method for the 2D/3D steady incompressible Navier–Stokes equations with nonlinear damping term. Within this method, we solve a nonlinear problem over a coarse grid followed by solving two Oseen-linearized problems over a fine grid, which possess the same stiffness matrices with only various right-hand sides. We theoretically analyze the stability of the present method, and derive optimal error estimates of the finite element solutions. We conduct a series of numerical experiments which support the theoretical analysis and test the effectiveness of the proposed method. We demonstrate numerically that there is a significant improvement in the accuracy of the approximate solutions over those for the standard two-level method.     

Analysis of two‐grid discretization scheme for semilinear hyperbolic equations by mixed finite element methods

In this paper, the full discrete scheme of mixed finite element approximation is introduced for semilinear hyperbolic equations. To solve the nonlinear problem efficiently, two two‐grid algorithms are developed and analyzed. In this approach, the nonlinear system is solved on a coarse mesh with width H, and the linear system is solved on a fine mesh with width h≪H. Error estimates and convergence results of two‐grid method are derived in detail. It is shown that if we choose in the first algorithm and in the second algorithm, the two‐grid algorithms can achieve the same accuracy of the mixed finite element solutions. Finally, the numerical examples also show that the two‐grid method is much more efficient than solving the nonlinear mixed finite element system directly.     

A new smoothing Newton method for solving constrained nonlinear equations

In this paper, a new smoothing Newton method is proposed for solving constrained nonlinear equations. We first transform the constrained nonlinear equations to a system of semismooth equations by using the so-called absolute value function of the slack variables, and then present a new smoothing Newton method for solving the semismooth equations by constructing a new smoothing approximation function. This new method is globally and quadratically convergent. It needs to solve only one system of unconstrained equations and to perform one line search at each iteration. Numerical results show that the new algorithm works quite well.     

A numerical solution of Burgers’ equation by finite element method constructed on the method of discretization in time

In this paper, the Galerkin finite element method constructed on the method of discretization in time was applied to solve the one-dimensional nonlinear Burgers’ equation. The system of nonlinear equations obtained for each time step was solved by using the Newton method. In order to show the efficiency of the presented method, the numerical solutions obtained for various values of viscosity were compared with the exact solutions. It was seen that they were in excellent agreement.