The generalized Wiener-Hopf equation and the approximation methods are used to propose a perturbed iterative method to compute the solutions of a general class of nonlinear variational inequalities.
A general construction of test functions in the Petrov-Galerkin method is described. Using this construction; algorithms for an approximate solution of the Dirichlet problem for the differential equation are presented and analyzed theoretically. The positive number is supposed to be much less than the discretization step and the values of . An algorithm for the corresponding two-dimensional problem is also suggested and results of numerical tests are introduced.
We introduce a piecewise P2-nonconforming quadrilateral finite element. First, we decompose a convex quadrilateral into the union of four triangles divided by its diagonals. Then the finite element space is defined by the set of all piecewise P2-polynomials that are quadratic in each triangle and continuously differentiable on the quadrilateral. The degrees of freedom (DOFs) are defined by the eight values at the two Gauss points on each of the four edges plus the value at the intersection of the...
Motivated by the pricing of American options for baskets we consider a parabolic variational inequality in a bounded polyhedral domain with a continuous piecewise smooth obstacle. We formulate a fully discrete method by using piecewise linear finite elements in space and the backward Euler method in time. We define an a posteriori error estimator and show that it gives an upper bound for the error in L2(0,T;H1(Ω)). The error estimator is localized in the sense that the size of the elliptic residual...
We prove a posteriori error estimates of optimal order for linear Schrödinger-type equations in the L∞(L2)- and the L∞(H1)-norm. We discretize only in time by the Crank-Nicolson method. The direct use of the reconstruction technique, as it has been proposed by Akrivis et al. in [Math. Comput. 75 (2006) 511–531], leads to a posteriori upper bounds that are of optimal order in the L∞(L2)-norm, but of suboptimal order in the L∞(H1)-norm. The optimality in the case of L∞(H1)-norm is recovered by using...
We prove a posteriori error estimates of optimal order for linear Schrödinger-type equations in the L∞(L2)- and the L∞(H1)-norm. We discretize only in time by the Crank-Nicolson method. The direct use of the reconstruction technique, as it has been proposed by Akrivis et al. in [Math. Comput.75 (2006) 511–531], leads to a posteriori upper bounds that are of optimal order in the L∞(L2)-norm, but of suboptimal order in the L∞(H1)-norm. The optimality in the case of L∞(H1)-norm is recovered by using...
We analyze Euler-Galerkin approximations (conforming finite elements in space and implicit Euler in time) to coupled PDE systems in which one dependent variable, say , is governed by an elliptic equation and the other, say , by a parabolic-like equation. The underlying application is the poroelasticity system within the quasi-static assumption. Different polynomial orders are used for the - and -components to obtain optimally convergent a priori bounds for all the terms in the error energy norm....
We analyze Euler-Galerkin approximations (conforming finite elements in space and implicit Euler in time) to coupled PDE systems in which one dependent variable, say u, is governed by an elliptic equation and the other, say p, by a parabolic-like equation. The underlying application is the poroelasticity system within the quasi-static assumption. Different polynomial orders are used for the u- and p-components to obtain optimally convergent a priori bounds for all the terms in the error energy...
The time-dependent Stokes equations in two- or three-dimensional bounded domains are discretized by the backward Euler scheme in time and finite elements in space. The error of this discretization is bounded globally from above and locally from below by the sum of two types of computable error indicators, the first one being linked to the time discretization and the second one to the space discretization.
The time-dependent Stokes equations in two- or three-dimensional bounded domains are discretized by the backward Euler scheme in time and finite elements in space. The error of this discretization is bounded globally from above and locally from below by the sum of two types of computable error indicators, the first one being linked to the time discretization and the second one to the space discretization.
In this paper, we extend the reduced-basis methods and associated a posteriori error estimators developed earlier for elliptic partial differential equations to parabolic problems with affine parameter dependence. The essential new ingredient is the presence of time in the formulation and solution of the problem – we shall “simply” treat time as an additional, albeit special, parameter. First, we introduce the reduced-basis recipe – Galerkin projection onto a space spanned by solutions of the...
In this paper, we extend the reduced-basis methods and associated a posteriori error estimators developed earlier for elliptic partial differential equations to parabolic problems with affine parameter dependence. The essential new ingredient is the presence of time in the formulation and solution of the problem – we shall “simply” treat time as an additional, albeit special, parameter. First, we introduce the reduced-basis recipe – Galerkin projection onto a space WN spanned by solutions...
Phase-field models, the simplest of which is Allen–Cahn’s problem, are characterized by a small parameter that dictates the interface thickness. These models naturally call for mesh adaptation techniques, which rely on a posteriori error control. However, their error analysis usually deals with the underlying non-monotone nonlinearity via a Gronwall argument which leads to an exponential dependence on . Using an energy argument combined with a topological continuation argument and a spectral...
Phase-field models, the simplest of which is Allen–Cahn's problem, are characterized by a small parameter ε that dictates the interface thickness. These models naturally call for mesh adaptation techniques, which rely on a posteriori error control. However, their error analysis usually deals with the underlying non-monotone nonlinearity via a Gronwall argument which leads to an exponential dependence on ε-2. Using an energy argument combined with a topological continuation argument and...