A moving pseudo‐boundary method of fundamental solutions for void detection

We propose a new moving pseudo‐boundary method of fundamental solutions (MFS) for the determination of the boundary of a void. This problem can be modeled as an inverse boundary value problem for harmonic functions. The algorithm for imaging the interior of the medium also makes use of radial polar parametrization of the unknown void shape in two dimensions. The center of this radial polar parametrization is considered to be unknown. We also include the contraction and dilation factors to be part of the unknowns in the resulting nonlinear least‐squares problem. This approach addresses the major problem of locating the pseudo‐boundary in the MFS in a natural way, because the inverse problem in question is nonlinear anyway. The feasibility of this new method is illustrated by several numerical examples. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Discrete and continuous coupled nonlinear integrable systems via the dressing method

A discrete analog of the dressing method is presented and used to derive integrable nonlinear evolution equations, including two infinite families of novel continuous and discrete coupled integrable systems of equations of nonlinear Schrödinger type. First, a demonstration is given of how discrete nonlinear integrable equations can be derived starting from their linear counterparts. Then, starting from two uncoupled, discrete one‐directional linear wave equations, an appropriate matrix Riemann‐Hilbert problem is constructed, and a discrete matrix nonlinear Schrödinger system of equations is derived, together with its Lax pair. The corresponding compatible vector reductions admitted by these systems are also discussed, as well as their continuum limits. Finally, by increasing the size of the problem, three‐component discrete and continuous integrable discrete systems are derived, as well as their generalizations to systems with an arbitrary number of components.     

Steepest descent preconditioning for nonlinear GMRES optimization

Steepest descent preconditioning is considered for the recently proposed nonlinear generalized minimal residual (N‐GMRES) optimization algorithm for unconstrained nonlinear optimization. Two steepest descent preconditioning variants are proposed. The first employs a line search, whereas the second employs a predefined small step. A simple global convergence proof is provided for the N‐GMRES optimization algorithm with the first steepest descent preconditioner (with line search), under mild standard conditions on the objective function and the line search processes. Steepest descent preconditioning for N‐GMRES optimization is also motivated by relating it to standard non‐preconditioned GMRES for linear systems in the case of a standard quadratic optimization problem with symmetric positive definite operator. Numerical tests on a variety of model problems show that the N‐GMRES optimization algorithm is able to very significantly accelerate convergence of stand‐alone steepest descent optimization. Moreover, performance of steepest‐descent preconditioned N‐GMRES is shown to be competitive with standard nonlinear conjugate gradient and limited‐memory Broyden–Fletcher–Goldfarb–Shanno methods for the model problems considered. These results serve to theoretically and numerically establish steepest‐descent preconditioned N‐GMRES as a general optimization method for unconstrained nonlinear optimization, with performance that appears promising compared with established techniques. In addition, it is argued that the real potential of the N‐GMRES optimization framework lies in the fact that it can make use of problem‐dependent nonlinear preconditioners that are more powerful than steepest descent (or, equivalently, N‐GMRES can be used as a simple wrapper around any other iterative optimization process to seek acceleration of that process), and this potential is illustrated with a further application example. Copyright © 2012 John Wiley & Sons, Ltd.     

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     

A practical method for computing the largest M‐eigenvalue of a fourth‐order partially symmetric tensor

In this paper, we consider a bi‐quadratic homogeneous polynomial optimization problem over two unit spheres arising in nonlinear elastic material analysis and in entanglement studies in quantum physics. The problem is equivalent to computing the largest M‐eigenvalue of a fourth‐order tensor. To solve the problem, we propose a practical method whose validity is guaranteed theoretically. To make the sequence generated by the method converge to a good solution of the problem, we also develop an initialization scheme. The given numerical experiments show the effectiveness of the proposed method. Copyright © 2009 John Wiley & Sons, Ltd.     

Numerical analysis to discontinuous Galerkin methods for the age structured population model of marine invertebrates

In this article we consider the age structured population growth model of marine invertebrates. The problem is a nonlinear coupled system of the age‐density distribution of sessile adults and the abundance of larvae. We propose the semidiscrete and fully‐discrete discontinuous Galerkin schemes to the nonlinear problem. The DG method is well suited to approximate the local behavior of the problem and to easily take the locally refined meshes with hanging nodes adaptively. The simple communication pattern between elements makes the DG method ideal for parallel computation. The global existence of the approximation solution is proved for the nonlinear approximation system by using the broken Sobolev spaces and the Schauder's fixed point theorem, and error estimates are obtained for both the semidiscrete scheme and the fully‐discrete scheme. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Second order fully discrete defect‐correction scheme for nonstationary conduction‐convection problem at high Reynolds number

This survey enfolds rigorous analysis of the defect‐correction finite element (FE) method for the time‐dependent conduction‐convection problem which based on the Crank‐Nicolson scheme. The method consists of two steps: solve a nonlinear problem with an added artificial viscosity term on a FE grid and correct the solutions on the same grid using a linearized defect‐correction technique. The stability and optimal error estimate of the fully discrete scheme are derived. As a consequence, the effectiveness of the method to deal with high Reynolds number is illustrated in several numerical experiments. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 681–703, 2017     

Finite element approximations to one‐phase nonlinear free boundary problem in groundwater contamination flow

In this article, we consider a single‐phase coupled nonlinear Stefan problem of the water‐head and concentration equations with nonlinear source and permeance terms and a Dirichlet boundary condition depending on the free‐boundary function. The problem is very important in subsurface contaminant transport and remediation, seawater intrusion and control, and many other applications. While a Landau type transformation is introduced to immobilize the free boundary, a transformation for the water‐head and concentration functions is defined to deal with the nonhomogeneous Dirichlet boundary condition, which depends on the free boundary function. An H¹‐finite element method for the problem is then proposed and analyzed. The existence of the approximation solution is established, and error estimates are obtained for both the semi‐discrete schemes and the fully discrete schemes. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A novel neural network based on NCP function for solving constrained nonconvex optimization problems

This article presents a novel neural network (NN) based on NCP function for solving nonconvex nonlinear optimization (NCNO) problem subject to nonlinear inequality constraints. We first apply the p‐power convexification of the Lagrangian function in the NCNO problem. The proposed NN is a gradient model which is constructed by an NCP function and an unconstrained minimization problem. The main feature of this NN is that its equilibrium point coincides with the optimal solution of the original problem. Under a proper assumption and utilizing a suitable Lyapunov function, it is shown that the proposed NN is Lyapunov stable and convergent to an exact optimal solution of the original problem. Finally, simulation results on two numerical examples and two practical examples are given to show the effectiveness and applicability of the proposed NN. © 2015 Wiley Periodicals, Inc. Complexity 21: 130–141, 2016     

Two‐level discretization of the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity

The r‐Laplacian has played an important role in the development of computationally efficient models for applications, such as numerical simulation of turbulent flows. In this article, we examine two‐level finite element approximation schemes applied to the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity, where r is the order of the power‐law artificial viscosity term. In the two‐level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single‐step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two‐level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide rigorous numerical analysis of the two‐level approximation scheme and derive scalings which vary based on the coefficient r, coarse mesh size H, fine mesh size h, and filter radius δ. We also investigate the two‐level algorithm in several computational settings, including the 3D numerical simulation of flow past a backward‐facing step at Reynolds number Re = 5100. In all numerical tests, the two‐level algorithm was proven to achieve the same order of accuracy as the standard one‐level algorithm, at a fraction of the computational cost. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Approximations of the nonlinear Volterra's population model by an efficient numerical method

In this paper, we apply the new homotopy perturbation method to solve the Volterra's model for population growth of a species in a closed system. This technique is extended to give solution for nonlinear integro‐differential equation in which the integral term represents the total metabolism accumulated fromtime zero. The approximate analytical procedure only depends on two components. The newhomotopy perturbationmethodwas applied to nonlinear integro‐differential equations directly and by converting the problem into nonlinear ordinary differential equation. We also compare this method with some other numerical results and show that the present approach is less computational and is applicable for solving nonlinear integro‐differential equations and ordinary differential equations as well. Copyright © 2011 John Wiley & Sons, Ltd.     

An optimization‐based domain decomposition method for the Boussinesq equations

We study an optimization based domain decomposition method for the Boussinesq equations governing natural convection problems. Domain decomposition is cast into a constrained minimization problem for which the objective functional measures the jump in the dependent variables across the interface between solid and fluid subdomains. We showthat solutions of the minimization problem exist and derive an optimality system from which these solutions may be determined. Finite element approximations of the solutions of the optimality system are examined. The domain decomposition method is also reformulated as a nonlinear least‐squares problem and the results of some numerical experiments are given. © 2002 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 18: 1–25, 2002     

Modelling and numerical approach to a class of metal‐forming problems—Quasi‐steady case

A class of quasi‐steady metal‐forming problems, with rigid‐plastic, incompressible, strain and strain‐rate dependent material model and with unilateral frictionless and nonlinear, nonlocal Coulomb's frictional contact conditions is considered. A coupled variational formulation, constituted of a variational inequality, with nonlinear and nondifferentiable terms, and a strain evolution equation, is derived and under a restriction on the material characteristics and using a variable stiffness parameters method with time retardation, existence, uniqueness and convergence results are obtained and presented. An algorithm, combining this method and the finite element method, is proposed and applied for solving an example strip drawing problem. Copyright © 2011 John Wiley & Sons, Ltd.     

Analysis of the operator splitting scheme for the Cahn‐Hilliard equation with a viscosity term

In this paper, we consider a second‐order fast explicit operator splitting method for the viscous Cahn‐Hilliard equation, which includes a viscosity term αΔu_t (α ∈ (0, 1)) described the influences of internal micro‐forces. The choice α = 0 corresponds to the classical Cahn‐Hilliard equation whilst the choice α = 1 recovers the nonlocal Allen‐Cahn equation. The fundamental idea of our method is to split the original problem into linear and nonlinear parts. The linear subproblem is numerically solved using a pseudo‐spectral method, and thus an ordinary differential equation is obtained. The nonlinear one is solved via TVD‐RK method. The stability and convergence are discussed in L²‐norm. Numerical experiments are performed to validate the accuracy and efficiency of the proposed method. Besides, a detailed comparison is made for the dynamics and the coarsening process of the metastable pattern for various values of α. Moreover, energy degradation and mass conservation are also verified.     

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.     

A rank‐exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems

We consider the nonlinear eigenvalue problem M(λ)x = 0, where M(λ) is a large parameter‐dependent matrix. In several applications, M(λ) has a structure where the higher‐order terms of its Taylor expansion have a particular low‐rank structure. We propose a new Arnoldi‐based algorithm that can exploit this structure. More precisely, the proposed algorithm is equivalent to Arnoldi's method applied to an operator whose reciprocal eigenvalues are solutions to the nonlinear eigenvalue problem. The iterates in the algorithm are functions represented in a particular structured vector‐valued polynomial basis similar to the construction in the infinite Arnoldi method [Jarlebring, Michiels, and Meerbergen, Numer. Math., 122 (2012), pp. 169–195]. In this paper, the low‐rank structure is exploited by applying an additional operator and by using a more compact representation of the functions. This reduces the computational cost associated with orthogonalization, as well as the required memory resources. The structure exploitation also provides a natural way in carrying out implicit restarting and locking without the need to impose structure in every restart. The efficiency and properties of the algorithm are illustrated with two large‐scale problems. Copyright © 2016 John Wiley & Sons, Ltd.     

Rational Krylov for Nonlinear Eigenproblems,an Iterative Projection Method

In recent papers Ruhe suggested a rational Krylov method for nonlinear eigenproblems knitting together a secant method for linearizing the nonlinear problem and the Krylov method for the linearized problem. In this note we point out that the method can be understood as an iterative projection method. Similarly to the Arnoldi method the search space is expanded by the direction from residual inverse iteration. Numerical methods demonstrate that the rational Krylov method can be accelerated considerably by replacing an inner iteration by an explicit solver of projected problems.     

TV‐like regularization for backward parabolic problems

This paper investigates an inverse problem for parabolic equations backward in time, which is solved by total‐variation‐like (TV‐like, in abbreviation) regularization method with cost function ∥u_x∥². The existence, uniqueness and stability estimate for the regularization problem are deduced in the linear case. For numerical illustration, the variational adjoint method, which presents a simple method to derive the gradient of the optimization functional, is introduced to reconstruct the unknown initial condition for both linear and nonlinear parabolic equations. The conjugate gradient method is used to iteratively search for the optimal approximation. Numerical results validate the feasibility and effectiveness of the proposed algorithm. Copyright © 2016 John Wiley & Sons, Ltd.     

A numerical approach for solving weakly singular partial integro‐differential equations via two‐dimensional‐orthonormal Bernstein polynomials with the convergence analysis

In this paper, we develop an efficient matrix method based on two‐dimensional orthonormal Bernstein polynomials (2D‐OBPs) to provide approximate solution of linear and nonlinear weakly singular partial integro‐differential equations (PIDEs). First, we approximate all functions involved in the considerable problem via 2D‐OBPs. Then, by using the operational matrices of integration, differentiation, and product, the solution of Volterra singular PIDEs is transformed to the solution of a linear or nonlinear system of algebraic equations which can be solved via some suitable numerical methods. With a small number of bases, we can find a reasonable approximate solution. Moreover, we establish some useful theorems for discussing convergence analysis and obtaining an error estimate associated with the proposed method. Finally, we solve some illustrative examples by employing the presented method to show the validity, efficiency, high accuracy, and applicability of the proposed technique.     

Applications of B‐bounded nonlinear semigroups to particle transport problems

In this paper we study an application of nonlinear B‐bounded semigroups introduced in a previous paper. The application is similar to the particle transport problem which led to B‐bounded linear semigroups. We deal with a nonlinear particle transport problem, which can be solved by using B‐bounded nonlinear semigroups. Copyright © 2010 John Wiley & Sons, Ltd.