An efficient method for fractional nonlinear differential equations by quasi‐Newton's method and simplified reproducing kernel method

An efficient method for nonlinear fractional differential equations is proposed in this paper. This method consists of 2 steps. First, we linearize the nonlinear operator equation by quasi‐Newton's method, which is based on Fréchet derivative. Then we solve the linear fractional differential equations by the simplified reproducing kernel method. The convergence of the quasi‐Newton's method is discussed for the general nonlinear case as well. Finally, some numerical examples are presented to illustrate accuracy, efficiency, and simplicity of the method.     

On the convergence of a numerical method for a hypersingular integral equation on a closed surface

We consider a linear integral equation with a hypersingular integral treated in the sense of the Hadamard finite value. This equation arises in the solution of the Neumann boundary value problem for the Laplace equation with a representation of a solution in the form of a double-layer potential. We consider the case in which the interior or exterior boundary value problem is solved in a domain; whose boundary is a smooth closed surface, and an integral equation is written out on that surface. For the integral operator in that equation, we suggest quadrature formulas like the method of vortical frames with a regularization, which provides its approximation on the entire surface for the use of a nonstructured partition. We construct a numerical scheme for the integral equation on the basis of suggested quadrature formulas, prove an estimate for the norm of the inverse matrix of the related system of linear equations and the uniform convergence of numerical solutions to the exact solution of the hypersingular integral equation on the grid.     

On the coupled BEM and FEM for a nonlinear exterior Dirichlet problem in R2

Summary In this paper we apply the coupling of boundary integral and finite element methods to solve a nonlinear exterior Dirichlet problem in the plane. Specifically, the boundary value problem consists of a nonlinear second order elliptic equation in divergence form in a bounded inner region, and the Laplace equation in the corresponding unbounded exterior region, in addition to appropriate boundary and transmission conditions. The main feature of the coupling method utilized here consists in the reduction of the nonlinear exterior boundary value problem to an equivalent monotone operator equation. We provide sufficient conditions for the coefficients of the nonlinear elliptic equation from which existence, uniqueness and approximation results are established. Then, we consider the case where the corresponding operator is strongly monotone and Lipschitz-continuous, and derive asymptotic error estimates for a boundary-finite element solution. We prove the unique solvability of the discrete operator equations, and based on a Strang type abstract error estimate, we show the strong convergence of the approximated solutions. Moreover, under additional regularity assumptions on the solution of the continous operator equation, the asymptotic rate of convergenceO (h) is obtained.The first author's research was partly supported by the U.S. Army Research Office through the Mathematical Science Institute of Cornell University, by the Universidad de Concepción through the Facultad de Ciencias, Dirección de Investigación and Vicerretoria, and by FONDECYT-Chile through Project 91-386.     

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.     

Numerical study of fisher's equation by Adomian's method

The effect of the linear operator L, used in the Adomian's method for solving nonlinear partial differential equations, on the convergence is studied on the Fisher's equation, which describes a balance between linear diffusion and nonlinear reaction. The results show that the convergence of this method is not influenced by the choice of the operator L in the equation to be solved. Furthermore, under some conditions, these results are close to those obtained by using other numerical techniques.     

Least squares and bounded variation regularization with nondifferentiable functionals

Let A be an operator from a real Banach space into a real Hilbert space. In this paper we study least squares regularization methods for the ill-posed operator equation A(u) = f using nonlinear nondifferentiable penalty functionals. We introduce a notion of distributional approximation, and use constructs of distributional approximations to establish convergence and stability of approximations of bounded variation solutions of the operator equation. We also show that the results provide a framework for a rigorous analysis of numerical methods based on Euler-Lagrange equations to solve the minimization problem. This justifies many of the numerical implementation schemes of bounded variation minimization that have been recently proposed.     

The h-p version of the coupling of finite element and boundary element methods for transmission problems in polyhedral domains

Summary. This paper analyzes the rate of convergence of the h-p version of the coupling of the finite element and boundary element method for transmission problems with a linear differential operator with variable coefficients in a bounded polyhedral domain and with constant coefficients in the exterior domain . This procedure uses the variational formulation of the differential equation in and involves integral operators on the interface between and . The finite elements are used to obtain approximate solutions of the differential equation in and the boundary elements are used to obtain approximate solutions of the integral equations. For given piecewise analytic data we show that the Galerkin solution of this coupling procedure converges exponentially fast in the energy norm if the h-p version is used both for finite elements and boundary elements. Received February 10, 1996 / Revised version received April 4, 1997     

On the convergence of the vortex loop method with regularization for the Neumann boundary value problem on a plane screen

We consider a linear integral equation with a supersingular integral treated in the sense of the Hadamard finite value, which arises in the solution of the Neumann boundary value problem for the Laplace equation with the representation of the solution in the form of a doublelayer potential. We consider the case in which the exterior boundary value problem is solved outside a plane surface (a screen). For the integral operator in the above-mentioned equation, we suggest quadrature formulas of the vortex loop method with regularization, which provide its approximation on the entire surface when using an unstructured partition. In the problem in question, the derivative of the unknown density of the double-layer potential, as well as the errors of quadrature formulas, has singularities in a neighborhood of the screen edge. We construct a numerical scheme for the integral equation on the basis of the suggested quadrature formulas and prove an estimate for the norm of the inverse matrix of the resulting system of linear equations and the uniform convergence of the numerical solutions to the exact solution of the supersingular integral equation on the grid.     

Preconditioners Based on Fundamental Solutions

We consider a new preconditioning technique for the iterative solution of linear systems of equations that arise when discretizing partial differential equations. The method is applied to finite difference discretizations, but the ideas apply to other discretizations too. If E is a fundamental solution of a differential operator P, we have E*(Pu) = u. Inspired by this, we choose the preconditioner to be a discretization of an approximate inverse K, given by a convolution-like operator with E as a kernel. We present analysis showing that if P is a first order differential operator, KP is bounded, and numerical results show grid independent convergence for first order partial differential equations, using fixed point iterations. For the second order convection-diffusion equation convergence is no longer grid independent when using fixed point iterations, a result that is consistent with our theory. However, if the grid is chosen to give a fixed number of grid points within boundary layers, the number of iterations is independent of the physical viscosity parameter. AMS subject classification (2000) 65F10, 65N22     

Two-Grid Algorithm of $H^{1}$-Galerkin Mixed Finite Element Methods for Semilinear Parabolic Integro-Differential Equations

In this paper, we present a two-grid discretization scheme for semilinear parabolic integro-differential equations by $H^{1}$-Galerkin mixed finite element methods. We use the lowest order Raviart-Thomas mixed finite elements and continuous linear finite element for spatial discretization, and backward Euler scheme for temporal discretization. Firstly, a priori error estimates and some superclose properties are derived. Secondly, a two-grid scheme is presented and its convergence is discussed. In the proposed two-grid scheme, the solution of the nonlinear system on a fine grid is reduced to the solution of the nonlinear system on a much coarser grid and the solution of two symmetric and positive definite linear algebraic equations on the fine grid and the resulting solution still maintains optimal accuracy. Finally, a numerical experiment is implemented to verify theoretical results of the proposed scheme. The theoretical and numerical results show that the two-grid method achieves the same convergence property as the one-grid method with the choice $h=H^2$.     

Continuous piecewise linear finite elements for the Kirchhoff–Love plate equation

A family of continuous piecewise linear finite elements for thin plate problems is presented. We use standard linear interpolation of the deflection field to reconstruct a discontinuous piecewise quadratic deflection field. This allows us to use discontinuous Galerkin methods for the Kirchhoff–Love plate equation. Three example reconstructions of quadratic functions from linear interpolation triangles are presented: a reconstruction using Morley basis functions, a fully quadratic reconstruction, and a more general least squares approach to a fully quadratic reconstruction. The Morley reconstruction is shown to be equivalent to the basic plate triangle (BPT). Given a condition on the reconstruction operator, a priori error estimates are proved in energy norm and L ² norm. Numerical results indicate that the Morley reconstruction/BPT does not converge on unstructured meshes while the fully quadratic reconstruction show optimal convergence.     

Approximation of solutions to operator equations in spaces of smooth functions and in spaces of distributions

The Galerkin method, in particular, the Galerkin method with finite elements (called finite element method) is widely used for numerical solution of differential equations. The Galerkin method allows us to obtain approximations of weak solutions only. However, there arises in applications a rich variety of problems where approximations of smooth solutions and solutions in the sense of distributions have to be found. This article is devoted to the employment of the Petrov–Galerkin method for solving such problems. The article contains general results on the Petrov–Galerkin approximations of solutions to linear and nonlinear operator equations. The problem on construction of the subspaces, which ensure the convergence of the approximations, is investigated. We apply the general results to two‐dimensional (2D) and 3D problems of the elasticity, to a parabolic problem, and to a nonlinear problem of the plasticity. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 406–450, 2014     

Multilevel augmentation methods for solving the sine-Gordon equation

In this paper we develop the multilevel augmentation method for solving nonlinear operator equations of the second kind and apply it to solving the one-dimensional sine-Gordon equation. We first give a general setting of the multilevel augmentation method for solving the second kind nonlinear operator equations and prove that the multilevel augmentation method preserves the optimal convergence order of the projection method while reducing computational cost significantly. Then we describe the semi-discrete scheme and the fully-discrete scheme based on multiscale methods for solving the sine-Gordon equation, and apply the multilevel augmentation method to solving the discrete equation. A complete analysis for convergence order is proposed. Finally numerical experiments are presented to confirm the theoretical results and illustrate the efficiency of the method.     

Stability in the almost everywhere sense: A linear transfer operator approach

The problem of almost everywhere stability of a nonlinear autonomous ordinary differential equation is studied using a linear transfer operator framework. The infinitesimal generator of a linear transfer operator (Perron-Frobenius) is used to provide stability conditions of an autonomous ordinary differential equation. It is shown that almost everywhere uniform stability of a nonlinear differential equation, is equivalent to the existence of a non-negative solution for a steady state advection type linear partial differential equation. We refer to this non-negative solution, verifying almost everywhere global stability, as Lyapunov density. A numerical method using finite element techniques is used for the computation of Lyapunov density.     

A mixed finite element method with Lagrange multipliers for nonlinear exterior transmission problems

Summary. We apply a mixed finite element method to numerically solve a class of nonlinear exterior transmission problems in R ² with inhomogeneous interface conditions. Besides the usual unknowns required for the dual-mixed method, which include the gradient of the temperature in this nonlinear case, our approach makes use of the trace of the outer solution on the transmission boundary as a suitable Lagrange multiplier. In addition, we use a boundary integral operator to reduce the original transmission problem on the unbounded region into a nonlocal one on a bounded domain. In this way, we are lead to a two-fold saddle point operator equation as the resulting variational formulation. We prove that the continuous formulation and the associated Galerkin scheme defined with Raviart-Thomas spaces are well posed, and derive the a-priori estimates and the corresponding rate of convergence. Then, we introduce suitable local problems and deduce first an implicit reliable and quasi-efficient a-posteriori error estimate, and then a fully explicit reliable one. Finally, several numerical results illustrate the effectivity of the explicit estimate for the adaptive computation of the discrete solutions. Mathematics Subject Classification (2000): 65N30, 65N38, 65N22, 65F10This research was partially supported by CONICYT-Chile through the FONDAP Program in Applied Mathematics, and by the Dirección de Investigación of the Universidad de Concepción through the Advanced Research Groups Program.     

A smoothing homotopy method for variational inequality problems on polyhedral convex sets

In this paper, based on the Robinson’s normal equation and the smoothing projection operator, a smoothing homotopy method is presented for solving variational inequality problems on polyhedral convex sets. We construct a new smoothing projection operator onto the polyhedral convex set, which is feasible, twice continuously differentiable, uniformly approximate to the projection operator, and satisfies a special approximation property. It is computed by solving nonlinear equations in a neighborhood of the nonsmooth points of the projection operator, and solving linear equations with only finite coefficient matrices for other points, which makes it very efficient. Under the assumption that the variational inequality problem has no solution at infinity, which is a weaker condition than several well-known ones, the existence and global convergence of a smooth homotopy path from almost any starting point in $R^n$ are proven. The global convergence condition of the proposed homotopy method is same with that of the homotopy method based on the equivalent KKT system, but the starting point of the proposed homotopy method is not necessarily an interior point, and the efficiency is more higher. Preliminary test results show that the proposed method is practicable, effective and robust.     

Computational parametric Willmore flow

We propose a new algorithm for the computation of Willmore flow. This is the L ²-gradient flow for the Willmore functional, which is the classical bending energy of a surface. Willmore flow is described by a highly nonlinear system of PDEs of fourth order for the parametrization of the surface. The spatially discrete numerical scheme is stable and consistent. The discretization relies on an adequate calculation of the first variation of the Willmore functional together with a derivation of the second variation of the area functional which is well adapted to discretization techniques with finite elements. The algorithm uses finite elements on surfaces. We give numerical examples and tests for piecewise linear finite elements. A convergence proof for the full algorithm remains an open question.     

Monotone explicit iterations of the finite element approximations for the nonlinear boundary value problem

Summary In this paper, we consider monotone explicit iterations of the finite element schemes for the nonlinear equations associated with the boundary value problem u=bu ², based on piecewise linear polynomials and the lumping operator. These iterations construct the monotonically decreasing and increasing sequences, and convergence proofs are given. Finally, we present some numerical examples verifying the effectiveness of the theory.     

Ill-posedness and local ill-posedness concepts in hilbert spaces *

In this paper, we study ill-posedness concepts of nonlinear and linear operator equations in a Hilbert space setting. Such ill-posedness information may help to select appropriate optimization approaches for the stable approximate solution of inverse problems, which are formulated by the operator equations. We define local ill-posedness of a nonlinear operator equation F(x) = y ₀ in a solution point x ₀:and consider the interplay between the nonlinear problem and its linearization using the Fréchet derivative F′(x ₀). To find a corresponding ill-posedness concept for the linearized equation we define intrinsic ill-posedness for linear operator equations A x = y and compare this approach with the ill-posedness definitions due to Hadamard and Nashed     

The discontinuous Galerkin method for fractional degenerate convection-diffusion equations

We propose and study discontinuous Galerkin methods for strongly degenerate convection-diffusion equations perturbed by a fractional diffusion (Lévy) operator. We prove various stability estimates along with convergence results toward properly defined (entropy) solutions of linear and nonlinear equations. Finally, the qualitative behavior of solutions of such equations are illustrated through numerical experiments.