An hp‐adaptive Newton‐Galerkin finite element procedure for semilinear boundary value problems

In this paper, we develop an hp‐adaptive procedure for the numerical solution of general, semilinear elliptic boundary value problems in 1d, with possible singular perturbations. Our approach combines both a prediction‐type adaptive Newton method and an hp‐version adaptive finite element discretization (based on a robust a posteriori residual analysis), thereby leading to a fully hp‐adaptive Newton–Galerkin scheme. Numerical experiments underline the robustness and reliability of the proposed approach for various examples. Copyright © 2016 John Wiley & Sons, Ltd.     

Numerical aspects of X‐SIMP‐based topology optimization

The discretization of topology design problems on the basis of the finite‐element‐method results in general in large‐scale combinatorial optimization problems, which are usually relaxed by the introduction of a continuous material density function as design variable. To avoid optimal designs containing unfavourable microstructures such as the well‐known “checkerboard” patterns, the relaxed problem can be regularized by the X‐SIMP‐approach, which penalizes intermediate density values as well as high density gradients within the design domain. In this context we discuss numerical aspects of the X‐SIMP‐based regularization such as the discretization of the regularized problem, the formulation of the corresponding stiffness matrix and the numerical solution of the discretized problem. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

An optimization‐based domain decomposition method for numerical simulation of the incompressible Navier‐Stokes flows

This article is concerned about an optimization‐based domain decomposition method for numerical simulation of the incompressible Navier‐Stokes flows. Using the method, an classical domain decomposition problem is transformed into a constrained minimization problem for which the objective functional is chosen to measure the jump in the dependent variables across the common interfaces between subdomains. The Lagrange multiplier rule is used to transform the constrained optimization problem into an unconstrained one and that rule is applied to derive an optimality system from which optimal solutions may be obtained. The optimality system is also derived using “sensitivity” derivatives instead of the Lagrange multiplier rule. We consider a gradient‐type approach to the solution of domain decomposition problem. The results of some numerical experiments are presented to demonstrate the feasibility and applicability of the algorithm developed in this article. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Shape reconstruction for the time‐dependent Navier‐Stokes flow

This article deals with the shape reconstruction of a bounded domain with a viscous incompressible fluid driven by the time‐dependent Navier‐Stokes equations. For the approximate solution of the ill‐posed and nonlinear problem we propose a regularized Newton method. A theoretical foundation for the Newton method is given by establishing the differentiability of the initial boundary value problem with respect to the interior boundary curve in the sense of the domain derivative. Numerical examples indicate the feasibility of our method. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Adaptive pseudo‐transient‐continuation‐Galerkin methods for semilinear elliptic partial differential equations

In this article, we investigate the application of pseudo‐transient‐continuation (PTC) schemes for the numerical solution of semilinear elliptic partial differential equations, with possible singular perturbations. We will outline a residual reduction analysis within the framework of general Hilbert spaces, and, subsequently, use the PTC‐methodology in the context of finite element discretizations of semilinear boundary value problems. Our approach combines both a prediction‐type PTC‐method (for infinite dimensional problems) and an adaptive finite element discretization (based on a robust a posteriori residual analysis), thereby leading to a fully adaptive PTC ‐Galerkin scheme. Numerical experiments underline the robustness and reliability of the proposed approach for different examples.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 2005–2022, 2017     

Method of lines with boundary elements for 1‐D transient diffusion‐reaction problems

Time‐dependent differential equations can be solved using the concept of method of lines (MOL) together with the boundary element (BE) representation for the spatial linear part of the equation. The BE method alleviates the need for spatial discretization and casts the problem in an integral format. Hence errors associated with the numerical approximation of the spatial derivatives are totally eliminated. An element level local cubic approximation is used for the variable at each time step to facilitate the time marching and the nonlinear terms are represented in a semi‐implicit manner by a local linearization at each time step. The accuracy of the method has been illustrated on a number of test problems of engineering significance. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Shape inverse problem for the two‐dimensional unsteady Stokes flow

In this article, the shape inverse problem for the two‐dimensional unsteady Stokes flow has been presented. We employ Piola transformation to bypass the divergence free condition for the flow and prove the differentiability of the solution to the initial boundary value problem. For the approximate solution of the ill‐posed and nonlinear problem, we propose a regularized Gauss‐Newton method. The numerical examples show that our theory is useful for practical purpose and the proposed algorithm is feasible. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Semi-smooth Newton methods for the Signorini problem

Semi-smooth Newton methods are analyzed for the Signorini problem. A proper regularization is introduced which guarantees that the semi-smooth Newton method is superlinearly convergent for each regularized problem. Utilizing a shift motivated by an augmented Lagrangian framework, to the regularization term, the solution to each regularized problem is feasible. Convergence of the regularized problems is shown and a report on numerical experiments is given.     

On the Moore–Penrose inverse in solving saddle‐point systems with singular diagonal blocks

This paper deals with the role of the generalized inverses in solving saddle‐point systems arising naturally in the solution of many scientific and engineering problems when finite‐element tearing and interconnecting based domain decomposition methods are used to the numerical solution. It was shown that the Moore–Penrose inverse may be obtained in this case at negligible cost by projecting an arbitrary generalized inverse using orthogonal projectors. Applying an eigenvalue analysis based on the Moore–Penrose inverse, we proved that for simple model problems, the number of conjugate gradient iterations required for the solution of associate dual systems does not depend on discretization norms. The theoretical results were confirmed by numerical experiments with linear elasticity problems. Copyright © 2011 John Wiley & Sons, Ltd.     

Solving parabolic problems using local defect correction in combination with the finite volume method

We present a method for solving partial differential equations characterized by highly localized properties in which the local defect correction (LDC) algorithm for time‐dependent problems is combined with a finite volume discretization. At each time step, LDC computes a numerical solution on a composite grid, a union of a global uniform coarse grid and a local uniform fine grid. The main feature of the method is that the discrete conservation property, typical of the finite volume approach is preserved on the composite grid. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

An almost L‐stable BDF‐type method for the numerical solution of stiff ODEs arising from the method of lines

A new BDF‐type scheme is proposed for the numerical integration of the system of ordinary differential equations that arises in the Method of Lines solution of time‐dependent partial differential equations. This system is usually stiff, so it is desirable for the numerical method to solve it to have good properties concerning stability. The method proposed in this article is almost L‐stable and of algebraic order three. Numerical experiments illustrate the performance of the new method on different stiff systems of ODEs after discretizing in the space variable some PDE problems. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A positive splitting method for mixed hyperbolic‐parabolic systems

In this article we present a method of lines approach to the numerical solution of a system of coupled hyperbolic—parabolic partial differential equations (PDEs). Special attention is paid to preserving the positivity of the solution of the PDEs when this solution is approximated numerically. This is achieved by using a flux‐limited spatial discretization for the hyperbolic equation. We use splitting techniques for the solution of the resulting large system of stiff ordinary differential equations. The performance of the approach applied to a biomathematical model is compared with the performance of standard methods. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 152–168, 2001     

An interior point Newton‐like method for non‐negative least‐squares problems with degenerate solution

An interior point approach for medium and large non‐negative linear least‐squares problems is proposed. Global and locally quadratic convergence is shown even if a degenerate solution is approached. Viable approaches for implementation are discussed and numerical results are provided. Copyright © 2006 John Wiley & Sons, Ltd.     

Newton‐Krylov iterative matrix representative spectrum

The concept of a representative spectrum is introduced in the context of Newton‐Krylov methods. This concept allows a better understanding of convergence rate accelerating techniques for Krylov‐subspace iterative methods in the context of CFD applications of the Newton‐Krylov approach to iteratively solve sets of non‐linear equations. The dependence of the representative spectrum on several parameters such as mesh, Mach number or discretization techniques is studied and analyzed. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Spectrally accurate energy‐preserving methods for the numerical solution of the “good” Boussinesq equation

In this paper we study the geometric numerical solution of the so called “good” Boussinesq equation. This goal is achieved by using a convenient space semi‐discretization, able to preserve the corresponding Hamiltonian structure, then using energy‐conserving Runge–Kutta methods in the Hamiltonian boundary value method class for the time integration. Numerical tests are reported, confirming the effectiveness of the proposed method.     

An Eulerian‐Lagrangian control volume scheme for two‐dimensional unsteady advection‐diffusion problems

We develop a mass conservative Eulerian‐Lagrangian control volume scheme (ELCVS) for the solution of the transient advection‐diffusion equations in two space dimensions. This method uses finite volume test functions over the space‐time domain defined by the characteristics within the framework of the class of Eulerian‐Lagrangian localized adjoint characteristic methods (ELLAM). It, therefore, maintains the advantages of characteristic methods in general, and of this class in particular, which include global mass conservation as well as a natural treatment of all types of boundary conditions. However, it differs from other methods in that class in the treatment of the mass storage integrals at the previous time step defined on deformed Lagrangian regions. This treatment is especially attractive for orthogonal rectangular Eulerian grids composed of block elements. In the algorithm, each deformed region is approximated by an eight‐node region with sides drawn parallel to the Eulerian grid, which significantly simplifies the integration compared with the approach used in finite volume ELLAM methods, based on backward tracking, while retaining local mass conservation at no additional expenses in terms of accuracy or CPU consumption. This is verified by numerical tests which show that ELCVS performs as well as standard finite volume ELLAM methods, which have previously been shown to outperform many other well‐received classes of numerical methods for the equations considered. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2012     

High‐resolution relaxation scheme for the two‐dimensional Riemann problems in gas dynamics

We present a new relaxation method for the numerical approximation of the two‐dimensional Riemann problems in gas dynamics. The novel feature of the technique proposed here is that it does not require either a Riemann solver or a characteristics decomposition. The high resolution of the method is achieved by using a third‐order reconstruction for the space discretization and a third‐order TVD Runge‐Kutta scheme for the time integration. Numerical experiments, using several configurations of Riemann problems in gas dynamics, are included to confirm the high resolution of the new relaxation scheme. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Spectral Approach to D‐bar Problems

We present the first numerical approach to D‐bar problems having spectral convergence for real analytic, rapidly decreasing potentials. The proposed method starts from a formulation of the problem in terms of an integral equation that is numerically solved with Fourier techniques. The singular integrand is regularized analytically. The resulting integral equation is approximated via a discrete system that is solved with Krylov methods. As an example, the D‐bar problem for the Davey‐Stewartson II equations is considered. The result is used to test direct numerical solutions of the PDE.© 2017 Wiley Periodicals, Inc.     

Minimum time‐step criteria for the Galerkin finite element methods applied to one‐dimensional parabolic partial differential equations

The finite element method has been well established for numerically solving parabolic partial differential equations (PDEs). Also it is well known that a too large time step should not be chosen in order to obtain a stable and accurate numerical solution. In this article, accuracy analysis shows that a too small time step should not be chosen either for some time‐stepping schemes. Otherwise, the accuracy of the numerical solution cannot be improved or can even be worsened in some cases. Furthermore, the so‐called minimum time step criteria are established for the Crank‐Nicolson scheme, the Galerkin‐time scheme, and the backward‐difference scheme used in the temporal discretization. For the forward‐difference scheme, no minimum time step exists as far as the accuracy is concerned. In the accuracy analysis, no specific initial and boundary conditions are invoked so that such established criteria can be applied to the parabolic PDEs subject to any initial and boundary conditions. These minimum time step criteria are verified in a series of numerical experiments for a one‐dimensional transient field problem with a known analytical solution. The minimum time step criteria developed in this study are useful for choosing appropriate time steps in numerical simulations of practical engineering problems. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A high‐order B‐spline collocation scheme for solving a nonhomogeneous time‐fractional diffusion equation

A high‐accuracy numerical approach for a nonhomogeneous time‐fractional diffusion equation with Neumann and Dirichlet boundary conditions is described in this paper. The time‐fractional derivative is described in the sense of Riemann‐Liouville and discretized by the backward Euler scheme. A fourth‐order optimal cubic B‐spline collocation (OCBSC) method is used to discretize the space variable. The stability analysis with respect to time discretization is carried out, and it is shown that the method is unconditionally stable. Convergence analysis of the method is performed. Two numerical examples are considered to demonstrate the performance of the method and validate the theoretical results. It is shown that the proposed method is of order O(Δx⁴ + Δt^{2 ? α}) convergence, where α ∈ (0,1) . Moreover, the impact of fractional‐order derivative on the solution profile is investigated. Numerical results obtained by the present method are compared with those obtained by the method based on standard cubic B‐spline collocation method. The CPU time for present numerical method and the method based on cubic B‐spline collocation method are provided.