A thermodynamically consistent numerical method for a phase field model of solidification

A discretization is presented for the initial boundary value problem of solidification as described in the phase-field model developed by Penrose and Fife (1990) [1] and Wang et al. (1993) [2]. These are models that are completely derived from the laws of thermodynamics, and the algorithms that we propose are formulated to strictly preserve them. Hence, the discrete solutions obtained can be understood as discrete dynamical systems satisfying discrete versions of the first and second laws of thermodynamics. The proposed methods are based on a finite element discretization in space and a midpoint-type finite-difference discretization in time. By using so-called discrete gradient operators, the conservation/entropic character of the continuum model is inherited in the numerical solution, as well as its Lyapunov stability in pure solid/liquid equilibria.     

On exact and approximate boundary controllabilities for the heat equation: A numerical approach

The present article is concerned with the numerical implementation of the Hilbert uniqueness method for solving exact and approximate boundary controllability problems for the heat equation. Using convex duality, we reduce the solution of the boundary control problems to the solution of identification problems for the initial data of an adjoint heat equation. To solve these identification problems, we use a combination of finite difference methods for the time discretization, finite element methods for the space discretization, and of conjugate gradient and operator splitting methods for the iterative solution of the discrete control problems. We apply then the above methodology to the solution of exact and approximate boundary controllability test problems in two space dimensions. The numerical results validate the methods discussed in this article and clearly show the computational advantage of using second-order accurate time discretization methods to approximate the control problems.     

Convergence analysis of a multigrid method for convection–diffusion equations

Summary. This paper is concerned with the convergence analysis of robust multigrid methods for convection-diffusion problems. We consider a finite difference discretization of a 2D model convection-diffusion problem with constant coefficients and Dirichlet boundary conditions. For the approximate solution of this discrete problem a multigrid method based on semicoarsening, matrix-dependent prolongation and restriction and line smoothers is applied. For a multigrid W-cycle we prove an upper bound for the contraction number in the euclidean norm which is smaller than one and independent of the mesh size and the diffusion/convection ratio. For the contraction number of a multigrid V-cycle a bound is proved which is uniform for a class of convection-dominated problems. The analysis is based on linear algebra arguments only. Received April 26, 2000 / Published online June 20, 2001     

Numerical solution for a sub-diffusion equation with a smooth kernel

In this paper we study the numerical solution of an initial value problem of a sub-diffusion type. For the time discretization we apply the discontinuous Galerkin method and we use continuous piecewise finite elements for the space discretization. Optimal order convergence rates of our numerical solution have been shown. We compare our theoretical error bounds with the results of numerical computations. We also present some numerical results showing the super-convergence rates of the proposed method.     

Pointwise Control of the Burgers Equation and Related Nash Equilibrium Problems: Computational Approach

This article is concerned with the numerical solution of multiobjective control problems associated with nonlinear partial differential equations and more precisely the Burgers equation. For this kind of problems, we look for the Nash equilibrium, which is the solution to a noncooperative game. To compute the solution of the problem, we use a combination of finite-difference methods for the time discretization, finite-element methods for the space discretization, and a quasi-Newton BFGS algorithm for the iterative solution of the discrete control problem. Finally, we apply the above methodology to the solution of several tests problems. To be able to compare our results with existing results in the literature, we discuss first a single-objective control problem, already investigated by other authors. Finally, we discuss the multiobjective case.     

A posteriori error estimation for a fully discrete discontinuous Galerkin approximation to a kind of singularly perturbed problems

The time variable in the semi-discrete problem is still continuous. In order to obtain an expected numerical solution, discretization the time variable from the semi-discrete form (full discretization) is needed. For a kind of non-stationarily singular perturbation problem in 1D, a fully discrete discontinuous Galerkin (DG) method is considered. That is to say, space variable is discretized with a primal DG method with penalty, and time variable is done using the backward Euler method. By virtue of duality arguments, inverse estimation of finite element method and interpolation theory, we present a residual-type a posteriori error indicator, which is usually used for adaptivity.     

Discrete and continuous Yang-Mills measure for non-trivial bundles over compact surfaces

In this paper, we construct one Yang-Mills measure on an orientable compact surface for each isomorphism class of principal bundles with compact connected structure group over this surface. For this, we refine the discretization procedure used in a previous construction [9] and define a discrete theory on a new configuration space which is essentially a covering of the usual one. We prove that the measures corresponding to different isomorphism classes of bundles or to different total areas of the base space are mutually singular. We give also a combinatorial computation of the partition functions which relies on the formalism of fat graphs.     

A Variational Discretization Concept in Control Constrained Optimization: The Linear-Quadratic Case

A new discretization concept for optimal control problems with control constraints is introduced which utilizes for the discretization of the control variable the relation between adjoint state and control. Its key feature is not to discretize the space of admissible controls but to implicitly utilize the first order optimality conditions and the discretization of the state and adjoint equations for the discretization of the control. For discrete controls obtained in this way an optimal error estimate is proved. The application to control of elliptic equations is discussed. Finally it is shown that the new concept is numerically implementable with only slight increase in program management. A numerical test confirms the theoretical investigations.     

A numerical method for the Cahn–Hilliard equation with a variable mobility

We consider a conservative nonlinear multigrid method for the Cahn–Hilliard equation with a variable mobility of a model for phase separation in a binary mixture. The method uses the standard finite difference approximation in spatial discretization and the Crank–Nicholson semi-implicit scheme in temporal discretization. And the resulting discretized equations are solved by an efficient nonlinear multigrid method. The continuous problem has the conservation of mass and the decrease of the total energy. It is proved that these properties hold for the discrete problem. Also, we show the proposed scheme has a second-order convergence in space and time numerically. For numerical experiments, we investigate the effects of a variable mobility.     

Local discontinuous Galerkin approximation of non-Fickian diffusion model in viscoelastic polymers

In this paper, we investigate a fully discrete local discontinuous Galerkin approximation of a non-linear non-Fickian diffusion model in viscoelastic polymers. For the spatial discretization, we adopt local discontinuous Galerkin finite element method and for the time discretization we use backward Euler method. We derive the stability estimate and a priori error estimate for the discrete scheme. Numerical examples are given to verify the theoretical findings.     

Discontinuous Galerkin methods for solving a hyperbolic inequality

In this paper, we study spatially semi‐discrete and fully discrete schemes to numerically solve a hyperbolic variational inequality, with discontinuous Galerkin (DG) discretization in space and finite difference discretization in time. Under appropriate regularity assumptions on the solution, a unified error analysis is established for four DG schemes, which reaches the optimal convergence order for linear elements. A numerical example is presented, and the numerical results confirm the theoretical error estimates.     

Superconvergence of splitting positive definite mixed finite element for parabolic optimal control problems

In this paper, we investigate the superconvergence of fully discrete splitting positive definite mixed finite element (MFE) methods for parabolic optimal control problems. For the space discretization, the state and co-state are approximated by the lowest order Raviart–Thomas MFE spaces and the control variable is approximated by piecewise constant functions. The time discretization of the state and co-state are based on finite difference methods. We derive the superconvergence between the projections of exact solutions and numerical solutions or the exact solutions and postprocessing numerical solutions for the control, state and co-state. A numerical example is provided to validate the theoretical results.     

Uniform controllability properties for space/time-discretized parabolic equations

This article is concerned with the analysis of semi-discrete-in-space and fully-discrete approximations of the null controllability (and controllability to the trajectories) for parabolic equations. We propose an abstract setting for space discretizations that potentially encompasses various numerical methods and we study how the controllability problems depend on the discretization parameters. For time discretization we use θ-schemes with \({\theta \in [\frac{1}2,1]}\) . For the proofs of controllability we rely on the strategy introduced by Lebeau and Robbiano (Comm Partial Differ Equ 20:335–356, 1995) for the null-controllability of the heat equation, which is based on a spectral inequality. We obtain relaxed uniform observability estimates in both the semi-discrete and fully-discrete frameworks, and associated uniform controllability properties. For the practical computation of the control functions we follow J.-L. Lions’ Hilbert Uniqueness Method strategy, exploiting the relaxed uniform observability estimate. Algorithms for the computation of the controls are proposed and analysed in the semi-discrete and fully-discrete cases. Additionally, we prove an error bound between the fully discrete and the semi-discrete control functions. This bound is however not uniform with respect to the space discretization. The theoretical results are illustrated through numerical experimentations.     

Runge-Kutta methods without order reduction for linear initial boundary value problems

Summary. It is well-known the loss of accuracy when a Runge–Kutta method is used together with the method of lines for the full discretization of an initial boundary value problem. We show that this phenomenon, called order reduction, is caused by wrong boundary values in intermediate stages. With a right choice, the order reduction can be avoided and the optimal order of convergence in time is achieved. We prove this fact for time discretizations of abstract initial boundary value problems based on implicit Runge–Kutta methods. Moreover, we apply these results to the full discretization of parabolic problems by means of Galerkin finite element techniques. We present some numerical examples in order to confirm that the optimal order is actually achieved. Received July 10, 2000 / Revised version received March 13, 2001 / Published online October 17, 2001     

Quasi-norm a priori and a posteriori error estimates for the nonconforming approximation of p-Laplacian

Summary. In this paper, we derive quasi-norm a priori and a posteriori error estimates for the Crouzeix-Raviart type finite element approximation of the p-Laplacian. Sharper a priori upper error bounds are obtained. For instance, for sufficiently regular solutions we prove optimal a priori error bounds on the discretization error in an energy norm when . We also show that the new a posteriori error estimates provide improved upper and lower bounds on the discretization error. For sufficiently regular solutions, the a posteriori error estimates are further shown to be equivalent on the discretization error in a quasi-norm. Received January 25, 1999 / Revised version received June 5, 2000 Published online March 20, 2001     

The convergence of fully discrete Galerkin approximations for the Benjamin–Bona–Mahony (BBM) equation

In the present paper, we analyze a second-order in time fully discrete finite element method for the BBM equation. The discretization in space is based on the standard Galerkin method, for the time discretization the Crank–Nicolson scheme is used. We also prove the convergence of a linearized Galerkin modification scheme.     

Superconvergence analysis of fully discrete finite element methods for semilinear parabolic optimal control problems

We study the superconvergence property of fully discrete finite element approximation for quadratic optimal control problems governed by semilinear parabolic equations with control constraints. The time discretization is based on difference methods, whereas the space discretization is done using finite element methods. The state and the adjoint state are approximated by piecewise linear functions and the control is approximated by piecewise constant functions. First, we define a fully discrete finite element approximation scheme for the semilinear parabolic control problem. Second, we derive the superconvergence properties for the control, the state and the adjoint state. Finally, we do some numerical experiments for illustrating our theoretical results.     

Variational integrators of higher order for flexible multibody systems

In this paper we present a time stepping scheme which is based on a variational integrator. This higher-order time stepping scheme includes constraints and a viscoelastic material formulation. A variational integrator is structure-preserving which results from using a discrete variational principle. Therefore, a variational integrator always takes the form of discrete EULER-LAGRANGE equations or the equivalent position-momentum equations. In this framework, we consider the motion of a flexible rope with non-holonomic constraints by the LAGRANGE-multiplier technique. The time stepping scheme is derived from a space-time discretization of HAMILTON's principle. The space discretization is based on one-dimensional linear LAGRANGE polynomials, whereas the time discretization is based on higher-order polynomials and higher-order quadrature rules. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Reduced Finite Element Discretizations of the Stokes and Navier-Stokes Equations

ABSTRACT

If finite element spaces for the velocity and pressure do not satisfy the Babu?ka-Brezzi condition, a stable conforming discretization of the Stokes or Navier-Stokes equations can be obtained by enriching the velocity space by suitable functions. Writing any function from the enriched space as a sum of a function from the original space and a function from the supplementary space, the discretization will contain a number of additional terms compared with a conforming discretization for the original pair of spaces. We show that not all these terms are necessary for the solvability of the discrete problem and for optimal convergence properties of the discrete solutions, which is useful for saving computer memory and for establishing a connection to stabilized methods.     

一类带有铁磁材料参数的非线性涡流问题的A-φ有限元法

针对带有铁磁材料的非线性涡流问题,其非线性性通常体现在磁场强度和磁感应强度的关系上.本文提出了一种全离散的有限元A-φ格式,分别在时间和空间上采用向后欧拉公式以及节点有限元进行离散.首先,在合适的函数空间里给出时间上的半离散格式,通过考察其弱形式建立相应的适定性理论,并证明近似解收敛于弱解.其次,给出全离散格式并讨论其误差估计.最后,给出两个数值算例以验证理论结果.