Search

This paper develops and analyzes a moving mesh finite difference method for solving partial integro-differential equations. First, the time-dependent mapping of the coordinate transformation is approximated by a piecewise quadratic polynomial in space and a piecewise linear function in time. Then, an efficient method to discretize the memory term of the equation is designed using the moving mesh approach. In each time slice, a simple piecewise constant approximation of the integrand is used, and thus a quadrature is constructed for the memory term. The central finite difference scheme for space and the backward Euler scheme for time are used. The paper proves that the accumulation of the quadrature error is uniformly bounded and that the convergence of the method is second order in space and first order in time. Numerical experiments are carried out to confirm the theoretical predictions. [ABSTRACT FROM AUTHOR]

A unified a posteriori error analysis has been developed in [18,21 23] to analyze the finite element error a posteriori under a universal roof. This paper contributes to the finite element meshes with hanging nodes which are required for local mesh-refining. The two-dimensional 1-- irregular triangulations into triangles and parallelograms and their combinations are considered with conforming mid nonconforming finite element methods named after or by Courant, Q1, Crouzeix-Raviart, Ham Rannacher-Turek, and others for the Poisson, Stokes and Navier-Lamé equations. The paper provides a unified a priori and a posteriori error analysis for triangulations with hanging nodes of degree ≤ 1 which are fundamental for local mesh refinement in self-adaptive finite element discretisations. [ABSTRACT FROM AUTHOR]

In this paper, both the standard finite element discretization and a two-scale finite element discretization for Schr6dinger equations are studied. The numerical analysis is based on the regularity that is also obtained in this paper for the Schrödinger equations. Very satisfying applications to electronic structure computations are provided, too. [ABSTRACT FROM AUTHOR]

In this paper, a full discrete two-level scheme for the unsteady Navier-Stokes equations based on a time dependent projection approach is proposed. In the sense of the new projection and its related space splitting, non-linearity is treated only on the coarse level subspace at each time step by solving exactly the standard Galerkin equation while a linear equation has to be solved on the fine level subspace to get the final approximation at this time step. Thus, it is a two-level based correction scheme for the standard Galerkin approximation. Stability and error estimate for this scheme are investigated in the paper. [ABSTRACT FROM AUTHOR]

In this paper, we discuss an inverse eigenvalue problem for constructing a 2n x 2n Jacobi matrix T such that its 2n eigenvalues are given distinct real values and its leading principal submatrix of order n is a given Jacobi matrix. A new sufficient and necessary condition for the solvability of the above problem is given in this paper. Furthermore, we present a new algorithm and give some numerical results. [ABSTRACT FROM AUTHOR]

In this paper, we give the state of the art for the so called "mixed spectral elements" for Maxwell's equations. Several families of elements, such as edge elements and discontinuous Galerkin methods (DGM) are presented and discussed. In particular, we show the need of introducing some numerical dissipation terms to avoid spurious modes in these methods. Such terms are classical for DGM but their use for edge element methods is a novel approach described in this paper. Finally, numerical experiments show the fast and low-cost character of these elements. [ABSTRACT FROM AUTHOR]

The alternately directional implicit (ADI) scheme is usually used in 3D depth migration. It splits the 3D square-root operator along crossline and inline directions alternately. In this paper, based on the ideal of data line, the four-way splitting schemes and their splitting errors for the finite-difference (FD) method and the hybrid method are investigated. The wavefield extrapolation of four-way splitting scheme is accomplished on a data line and is stable unconditionally. Numerical analysis of splitting errors show that the two-way FD migration have visible numerical anisotropic errors, and that four-way FD migration has much less splitting errors than two-way FD migration has. For the hybrid method, the differences of numerical anisotropic errors between two-way scheme and four-way scheme are small in the case of lower lateral velocity variations. The schemes presented in this paper can be used in 3D post stack or prestack depth migration. Two numerical calculations of 3D depth migration axe completed. One is the four-way FD and hybrid 3D post-stack depth migration for an impulse response, which shows that the anisotropic errors can be eliminated effectively in the cases of constant and variable velocity variations. The other is the 3D shot-profile prestack depth migration for SEG/EAEG benchmark model with two-way hybrid splitting scheme, which presents good imaging results. The Message Passing Interface (MPI) programme based on shot number is adopted. [ABSTRACT FROM AUTHOR]

Based on two-grid discretizations, in this paper, some new local and parallel finite element algorithms are proposed and analyzed for the stationary incompressible Navier-Stokes problem. These algorithms are motivated by the observation that for a solution to the Navier-Stokes problem, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. One major technical tool for the analysis is some local a priori error estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids. [ABSTRACT FROM AUTHOR]

In this paper, the numerical solutions of heat equation on 3-D unbounded spatial domain axe considered. An artificial boundary Γ is introduced to finite the computational domain. On the artificial boundary Γ, the exact boundary condition and a series of approximating boundary conditions are derived, which are called artificial boundary conditions. By the exact or approximating boundary condition on the artificial boundary, the original problem is reduced to an initial-boundary value problem on the bounded computational domain, which is equivalent or approximating to the original problem. The finite difference method and finite element method are used to solve the reduced problems on the finite computational domain. The numerical results demonstrate that the method given in this paper is effective and feasible. [ABSTRACT FROM AUTHOR]

In this paper, the linear finite element approximation to the positive and symmetric, linear hyperbolic systems is analyzed and an O(h²) order error estimate is established under the conditions of strongly regular triangulation and the H³-regularity for the exact solutions. The convergence analysis is based on some superclose estimates derived in this paper. Our method and result here are also applicable to general hyperbolic problems. Finally, we discuss the linearized shallow water system of equations. [ABSTRACT FROM AUTHOR]

This paper deals with the asymptotic stability analysis of θ - methods for multi-pantograph delay differential equation... Here λμ1,μ2...,μ1,μ0 ε ⊂ In recent years stability properties of numerical methods for this kind of equation has been studied by numerous authors. Many papers are concerned with meshes with fixed stepsize. In general the developed techniques give rise to non-ordinary recurrence relation. In this work, instead, we study constrained variable stpesize schemes, suggested by theoretical and computational reasons, which lead to a non-stationary difference equation. A general theorem is presented which can be used to obtain the characterization of the stability regions of θ - methods. [ABSTRACT FROM AUTHOR]

In my earlier paper [4], an eigen-decompositions of the Laplacian operator is given on a unit regular hexagon with periodic boundary conditions. Since an exact decomposition with Dirichlet boundary conditions has not been explored in terms of any elementary form. In this paper, we investigate an approximate eigen-decomposition. The function space, corresponding all eigen-function, have been decomposed into four orthogonal subspaces. Estimations of the first eight smallest eigenvalues and related orthogonal functions are given. In particulary we obtain an approximate value of the smallest eigenvalue λ1 ∼ 29/40 π² = 7.1555, the absolute error is less than 0.0001. [ABSTRACT FROM AUTHOR]

The aim of this paper is to develop a fast numerical method for two-dimensional boundary integral equations of the first kind with logarithm kernels when the boundary of the domain is smooth and closed. In this case, the use of the conventional boundary element methods gives linear systems with dense matrix. In this paper, we demonstrate that the dense matrix can be replaced by a sparse one if appropriate graded meshes axe used in the quadrature rules. It will be demonstrated that this technique can increase the numerical efficiency significantly. [ABSTRACT FROM AUTHOR]

Klein-Gordon-Schrödinger (KGS) equations are very important in physics. Some papers studied their well-posedness and numerical solution [1-4], and another works investigated the existence of global attractor in Rn and Ω ⊂ Rn (n ≤ 3) [5-6,11-12]. In this paper, we discuss the dynamical behavior when we apply spectral method to find numerical approximation for periodic initial value problem of KGS equations. It includes the existence of approximate attractor AN, the upper semi-continuity on A which is a global attractor of initial problem and the upper bounds of Hausdorff and fractal dimensions for A and AN, etc. [ABSTRACT FROM AUTHOR]

This paper is concerned with the ill-posed problems of identifying a parameter in an elliptic equation which appears in may applications in science and industry. Its solution is obtained by applying trust region method to a nonlinear least squares error problem. Trust region method has long been a popular method for well-posed problems. This paper indicates that it is also suitable for all-posed problems. Numerical experiment is given to compare the trust region method with the Tikhonov regularization method. It seems that the trust region method is more promising. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the coupling of natural boundary element and finite element methods of exterior initial boundary value problems for hyperbolic equations. The governing equation is first discretized in time, leading to a time-step scheme, where an exterior elliptic problem has to be solved in each time step. Second, a circular artificial boundary Γ[subR] consisting of a circle of radius R is introduced, the original problem in an unbounded domain is transformed into the nonlocal boundary value :problem in a bounded subdomain. And the natural integral equation and the Poisson integral formula are obtained in the infinite domain Ω[sub2] outside circle of radius R. The coupled variational formulation is given. Only the function itself, not its normal derivative at artificial boundary Γ[subR], appears in the variational equation, so that the unknown numbers are reduced and the boundary element stiffness matrix has a few different elements. Such a coupled method is superior to the one based on direct boundary element method. This paper discusses finite element discretization for variational problem and its corresponding numerical technique, and the convergence for the numerical solutions. Finally, the numerical example is presented to illustrate feasibility and efficiency of this method. [ABSTRACT FROM AUTHOR]

In this paper we presented a convergence condition of parallel dynamic iteration methods for a nonlinear system of differential-algebraic equations with a periodic constraint. The convergence criterion is decided by the spectral expression of a linear operator derived from system partitions. Numerical experiments given here confirm the theoretical work of the paper. [ABSTRACT FROM AUTHOR]

In this paper we present a nonmonotone trust region algorithm for general nonlinear constrained optimization problems. The main idea of this paper is to combine Yuan's technique[1] with a nonmonotone method similar to Ke and Han [2]. This new algorithm may not only keep the robust properties of the algorithm given by Yuan, but also have some advantages led by the nonmonotone technique. Under very mild conditions, global convergence for the algorithm is given. Numerical experiments demonstrate the efficiency of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper we propose a kind of implicit iterative methods for solving ill-posed operator equations and discuss the properties of the methods in the case that the control parameter is fixed. The theoretical results show that the new methods have certain important features and can overcome some disadvantages of Tikhonov-type regularization and explicit iterative methods. Numerical examples are also given in the paper, which coincide well with theoretical results. [ABSTRACT FROM AUTHOR]

Geometric partial differential equations of level-set form are usually constructed by a variational method using either Dirac delta function or co-area formula in the energy functional to be minimized. However, the equations derived by these two approaches are not consistent. In this paper, we present a third approach for constructing the level-set form equations. By representing various differential geometry quantities and differential geometry operators in terms of the implicit surface, we are able to reformulate three classes of parametric geometric partial differential equations (second-order, fourth-order and sixth-order) into the level-set forms. The reformulation of the equations is generic and simple, and the resulting equations are consistent with their parametric form counterparts. We further prove that the equations derived using co-area formula are also consistent with the parametric forms. However, these equations are of much complicated forms than these given by the equations we derived. [ABSTRACT FROM AUTHOR]

In this paper, we present the theory and numerical implementation for a 2-D thermal inhomogeneity through the dynamical probe method. The main idea of the dynamical probe method is to construct an indicator function associated with some probe such that when the probe touch the boundary of the inclusion the indicator function will blow up. From this property, we can get the shape of the inclusion. We will give the numerical reconstruction algorithm to identify the inclusion from the simulated Neumann-to-Dirichlet map. [ABSTRACT FROM AUTHOR]

In the present paper the edge stabilization technique is applied to a convection-diffusion problem with exponential boundary layers on the unit square, using a Shishkin mesh with bilinear finite elements in the layer regions and linear elements on the coarse part of the mesh. An error bound is proved for ||πu - uh ||E, where πu is some interpolant of the solution u and uh the discrete solution. This supercloseness result implies an optimal error estimate with respect to the L2 norm and opens the door to the application of postprocessing for improving the discrete solution. [ABSTRACT FROM AUTHOR]

Based on the Boolean sum technique, we introduce and analyze in this paper a class of multi-level iterative corrections for finite dimensional approximations. This type of multi-level corrections is adaptive and can produce highly accurate approximations. For illustration, we present some old and new finite element correction schemes for an elliptic boundary value problem. [ABSTRACT FROM AUTHOR]

We consider an inverse quadratic programming (IQP) problem in which the parameters in the objective function of a given quadratic programming (QP) problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. This problem can be formulated as a minimization problem with a positive semidefinite cone constraint and its dual (denoted IQD(A, b)) is a semismoothly differentiable (SC1) convex programming problem with fewer variables than the original one. In this paper a smoothing Newton method is used for getting a Karush-Kuhn-Tucker point of IQD(A, b). The proposed method needs to solve only one linear system per iteration and achieves quadratic convergence. Numerical experiments are reported to show that the smoothing Newton method is effective for solving this class of inverse quadratic programming problems. [ABSTRACT FROM AUTHOR]

A uniformly first-order convergent numerical method for the discrete-ordinate transport equation in the rectangle geometry is proposed in this paper. Firstly we approximate the scattering coefficients and source terms by piecewise constants determined by their cell averages. Then for each cell, following the work of De Barros and Larsen [1, 19], the solution at the cell edge is approximated by its average along the edge. As a result, the solution of the system of equations for the cell edge averages in each cell can be obtained analytically. Finally, we piece together the numerical solution with the neighboring cells using the interface conditions. When there is no interface or boundary layer, this method is asymptotic-preserving, which implies that coarse meshes (meshes that do not resolve the mean free path) can be used to obtain good numerical approximations. Moreover, the uniform first-order convergence with respect to the mean free path is shown numerically and the rigorous proof is provided. [ABSTRACT FROM AUTHOR]

This paper extends the two-grid discretization scheme of the conforming finite elements proposed by Xu and Zhou (Math. Comput., 70 (2001), pp.17-25) to the nonconforming finite elements for eigenvalue problems. In particular, two two-grid discretization schemes based on Rayleigh quotient technique are proposed. By using these new schemes, the solution of an eigenvalue problem on a fine mesh is reduced to that on a much coarser mesh together with the solution of a linear algebraic system on the fine mesh. The resulting solution still maintains an asymptotically optimal accuracy. Comparing with the two-grid discretization scheme of the conforming finite elements, the main advantages of our new schemes are twofold when the mesh size is small enough. First, the lower bounds of the exact eigenvalues in our two-grid discretization schemes can be obtained. Second, the first eigenvalue given by the new schemes has much better accuracy than that obtained by solving the eigenvalue problems on the fine mesh directly. [ABSTRACT FROM AUTHOR]

This paper deals with the preconditioning of the curl-curl operator. We use H(curl)-conforming finite elements for the discretization of our corresponding magnetostatic model problem. Jumps in the material parameters influence the condition of the problem. We will demonstrate by theoretical estimates and numerical experiments that hierarchical matrices are well suited to construct efficient parallel preconditioners for the fast and robust iterative solution of such problems. [ABSTRACT FROM AUTHOR]

This paper addresses fully space-time adaptive magnetic field computations. We describe an adaptive Whitney finite element method for solving the magnetoquasistatic formulation of Maxwell's equations on unstructured 3D tetrahedral grids. Spatial mesh refinement and coarsening are based on hierarchical error estimators especially designed for combining tetrahadral H(curl)-conforming edge elements in space with linearly implicit Rosenbrock methods in time. An embedding technique is applied to get efficiency in time through variable time steps. Finally, we present numerical results for the magnetic recording write head benchmark problem proposed by the Storage Research Consortium in Japan. [ABSTRACT FROM AUTHOR]

In this paper we review a number of auxiliary space based preconditioners for the second order definite and semi-definite Maxwell problems discretized with the lowest order Nédélec finite elements. We discuss the parallel implementation of the most promising of these methods, the ones derived from the recent Hiptmair-Xu (HX) auxiliary space decomposition [Hiptmair and Xu, SIAM J. Numer. Anal., 45 (2007), pp. 2483-2509]. An extensive set of numerical experiments demonstrate the scalability of our implementation on large-scale H(curl) problems. [ABSTRACT FROM AUTHOR]

In this paper, we obtain optimal error estimates in both L²-norm and H(curl)-norm for the Nédélec edge finite element approximation of the time-harmonic Maxwell's equations on a general Lipschitz domain discretized on quasi-uniform meshes. One key to our proof is to transform the L² error estimates into the L² estimate of a discrete divergence-free function which belongs to the edge finite element spaces, and then use the approximation of the discrete divergence-free function by the continuous divergence-free function and a duality argument for the continuous divergence-free function. For Nédélec's second type elements, we present an optimal convergence estimate which improves the best results available in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we study the explicit expressions of the constants in the error estimates of the lowest order mixed and nonconforming finite element methods. We start with an explicit relation between the error constant of the lowest order Raviart-Thomas interpolation error and the geometric characters of the triangle. This gives an explicit error constant of the lowest order mixed finite element method. Furthermore, similar results can be extended to the nonconforming P1 scheme based on its close connection with the lowest order Raviart-Thomas method. Meanwhile, such explicit a priori error estimates can be used as computable error bounds, which are also consistent with the maximal angle condition for the optimal error estimates of mixed and nonconforming finite element methods. [ABSTRACT FROM AUTHOR]

Superconvergence and recovery a posteriori error estimates of the finite element approximation for general convex optimal control problems are investigated in this paper. We obtain the superconvergence properties of finite element solutions, and by using the superconvergence results we get recovery a posteriori error estimates which are asymptotically exact under some regularity conditions. Some numerical examples are provided to verify the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we study adaptive finite element discretization schemes for an optimal control problem governed by elliptic PDE with an integral constraint for the state. We derive the equivalent a posteriori error estimator for the finite element approximation, which particularly suits adaptive multi-meshes to capture different singularities of the control and tile state. Numerical examples are presented to demonstrate the efficiency of a posteriori error estimator and to confirm the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper we are concerned with the pricing of lookback options with American type constrains. Based on the differential linear complementary formula associated with the pricing problem, an implicit difference scheme is constructed and analyzed. We show that there exists a unique difference solution which is unconditionally stable. Using the notion of viscosity solutions, we also prove that the finite difference solution converges uniformly to the viscosity solution of the continuous problem. Furthermore, by means of the variational inequality analysis method, the O(Δt + Δ²)-order error estimate is derived in the discrete L2-norm provided that the continuous problem is sufficiently regular. In addition, a numerical example is provided to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper we give proof of three binomial coefficient inequalities. These inequalities are key ingredients in [Wen and Jim J. Comput. Math. 26, (2008), 1-22] to establish the L¹-error estimates for the upwind difference scheme to the linear advection equations with a piecewise constant wave speed and a general interface condition, which were further used to establish the L-error estimates for a Hamiltonian-preserving scheme developed in [Jin and Welt, Commun. Math. Sci. 3, (2005), 285-315] to the Liouville equation with piecewise constant potentials [Wen and Jin, SIAM J. Numer. Anal. 16, (2008), 2688-2714]. [ABSTRACT FROM AUTHOR]

It is interesting to compare the efficiency of two methods when their computational loads in each iteration are equal. In this paper, two classes of contraction methods for monotone variational inequalities are studied in a unified framework. The methods of both classes can be viewed as prediction-correction methods, which generate the same test vector in the prediction step and adopt the same step-size rule in the correction step. The only difference is that they use different search directions. The computational loads of each iteration of the different classes are equal. Our analysis explains theoretically why one class of the contraction methods usually outperforms the other class. It is demonstrated that many known methods belong to these two classes of methods. Finally, the presented numerical results demonstrate the validity of our analysis. [ABSTRACT FROM AUTHOR]

This paper presents an efficient moving mesh method to solve a nonlinear singular problem with an optimal control constrained condition. The physical problem is governed by a new model of turbulent flow in circular tubes proposed by Luo et al. using Prandtl's mixing-length theory. Our algorithm is formed by an outer iterative algorithm for handling the optimal control condition and an inner adaptive mesh redistribution algorithm for solving the singular governing equations. We discretize the nonlinear problem by using a upwinding approach, and the resulting nonlinear equations are solved by using the Newton- Raphson method. The mesh is generated and the grid points are moved by using the are-length equidistribution principle. The numerical results demonstrate that proposed algorithm is effective in capturing the boundary layers associated with the turbulent model. [ABSTRACT FROM AUTHOR]

In this paper, we consider lower order rectangular finite element methods for the singularly perturbed Stokes problem. The model problem reduces to a linear Stokes problem when the perturbation parameter is large and degenerates to a mixed formulation of Poisson's equation as the perturbation parameter tends to zero. We propose two 2D and two 3D nonconforming rectangular finite elements, and derive robust discretization error estimates. Numerical experiments are carried out to verify the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we consider the local discontinuous Galerkin method (LDG) for solving singularly perturbed convection-diffusion problems in one- and two-dimensional settings. The existence and uniqueness of the LDG solutions are verified. Numerical experiments demonstrate that it seems impossible to obtain uniform superconvergence for numerical fluxes under uniform meshes. Thanks to the implementation of two-type different anisotropic meshes, i.e., the Shishkin and an improved grade meshes, the uniform 2p + 1-order superconvergence is observed numerically for both one-dimensional and two-dimensional cases. [ABSTRACT FROM AUTHOR]

In this paper, a two-scale higher-order finite element discretization scheme is proposed and analyzed for a Schrödinger equation on tensor product domains. With the scheme, the solution of the eigenvalue problem on a fine grid can be reduced to an eigenvalue problem on a much coarser grid together with some eigenvalue problems on partially fine grids. It is shown theoretically and numerically that the proposed two-scale higher-order scheme not only significantly reduces the number of degrees of freedom but also produces very accurate approximations. [ABSTRACT FROM AUTHOR]

In this survey paper we report on recent developments of the hp-version of the boundary element method (BEM). As model problems we consider weakly singular and hypersingular integral equations of the first kind on a planar, open surface. We show that the Galerkin solutions (computed with the hp-version on geometric meshes) converge exponentially fast towards the exact solutions of the integral equations. An hp-adaptive algorithm is given and the implementation of the hp-version BEM is discussed together with the choice of efficient preconditioners for the ill-conditioned boundary element stiffness matrices. We also comment on the use of the hp-version BEM for solving Signorini contact problems in linear elasticity where the contact conditions are enforced only on the discrete set of Gauss-Lobatto points. Numerical results are presented which underline the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we study variational discretization for the constrained optimal control problem governed by convection dominated diffusion equations, where the state equation is approximated by the edge stabilization Galerkin method. A priori error estimates are derived for the state, the adjoint state and the control. Moreover, residual type a posteriori error estimates in the the²-norm are obtained. Finally, two numerical experiments are presented to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper we review recent developments in the analysis of finite element methods for incompressible flow problems with local projection stabilization (LPS). These methods preserve the favourable stability and approximation properties of classical residual-based stabilization (RBS) techniques but avoid the strong coupling of velocity and pressure in the stabilization terms. LPS-methods belong to the class of symmetric stabilization techniques and may be characterized as variational multiscale methods. In this work we summarize the most important a priori estimates of this class of stabilization schemes developed in the past 6 years. We consider the Stokes equations, the Oseen linearization and the Navier-Stokes equations. Furthermore, we apply it to optimal control problems with linear(ized) flow problems, since the symmetry of the stabilization leads to the nice feature that the operations "discretize" and "optimize" commute. [ABSTRACT FROM AUTHOR]

In this paper, we study numerical methods for an optimal control problem with point-wise state constraints. The traditional approaches often need to deal with the delta-singularity in the dual equation, which causes many difficulties in its theoretical analysis and numerical approximation. In our new approach we reformulate the state-constrained optimal control as a constrained minimization problems only involving the state, whose optimality condition is characterized by a fourth order elliptic variational inequality. Then direct numerical algorithms (nonconforming finite element approximation) are proposed for the inequality, and error estimates of the finite element approximation are derived. Numerical experiments illustrate the effectiveness of the new approach. [ABSTRACT FROM AUTHOR]

In this paper, we discuss the a posteriori error estimate of the finite element approximation for the boundary control problems governed by the parabolic partial differential equations. Three different a posteriori error estimators are provided for the parabolic boundary control problems with the observations of the distributed state, the boundary state and the final state. It is proven that these estimators are reliable bounds of the finite element approximation errors, which can be used as the indicators of the mesh refinement in adaptive finite element methods. [ABSTRACT FROM AUTHOR]

Digital inpainting is a fundamental problem in image processing and many variational models for this problem have appeared recently in the literature. Among them are the very successfully Total Variation (TV) model [11] designed for local inpainting and its improved version for large scale inpainting: the Curvature-Driven Diffusion (CDD) model [10]. For the above two models, their associated Euler Lagrange equations are highly nonlinear partial differential equations. For the TV model there exists a relatively fast and easy to implement fixed point method, so adapting the multigrid method of [24] to here is immediate. For the CDD model however, so far only the well known but usually very slow explicit time marching method has been reported and we explain why the implementation of a fixed point method for the CDD model is not straightforward. Consequently the multigrid method as in [Savage and Chen, Int. J. Comput. Math., 82 (2005), pp. 1001-1015] will not work here. This fact represents a strong limitation to the range of applications of this model since usually fast solutions are expected. In this paper, we introduce a modification designed to enable a fixed point method to work and to preserve the features of the original CDD model. As a result, a fast and efficient multigrid method is developed for the modified model. Numerical experiments are presented to show the very good performance of the fast algorithm. [ABSTRACT FROM AUTHOR]

The convergence analysis on the general iterative methods for the symmetric and positive semidefinite problems is presented in this paper. First, formulated are refined necessary and sufficient conditions for the energy norm convergence for iterative methods. Some illustrative examples for the conditions are also provided. The sharp convergence rate identity for the Gauss-Seidel method for the semidefinite system is obtained relying only on the pure matrix manipulations which guides us to obtain the convergence rate identity for the general successive subspace correction methods. The convergence rate identity for the successive subspace correction methods is obtained under the new conditions that the local correction schemes possess the local energy norm convergence. A convergence rate estimate is then derived in terms of the exact subspace solvers and the parameters that appear in the conditions. The uniform convergence of multigrid method for a model problem is proved by the convergence rate identity. The work can be regraded its unified and simplified analysis on the convergence of iteration methods for semidfinite problems [8,9]. [ABSTRACT FROM AUTHOR]