Abstract. We consider the finite volume and the lowest-order mixed finite element discretizations of a second-order elliptic pure diffusion model problem. The first goal of this paper is to derive guaranteed and fully computable a posteriori error estimates which take into account an inexact solution of the associated linear algebraic system. We show that the algebraic error can be simply bounded using the algebraic residual vector. Much better results are, however, obtained using the complementary energy of an equilibrated Raviart-Thomas-Nédélec discrete vector field whose divergence is given by a proper weighting of the residual vector. The second goal of this paper is to construct efficient stopping criteria for iterative solvers such as the conjugate gradients, GMRES, or Bi-CGStab. We claim that the discretization error, implied by the given numerical method, and the algebraic one should be in balance, or, more precisely, that it is enough to solve the linear algebraic system to the accuracy which guarantees that the algebraic part of the error does not contribute significantly to the whole error. Our estimates allow a reliable and cheap comparison of the discretization and algebraic errors. One can thus use them to stop the iterative algebraic solver at the desired accuracy level, without performing an excessive number of unnecessary additional iterations. Under the assumption of the relative balance between the two errors, we also prove the efficiency of our a posteriori estimates, i.e., we show that they also represent a lower bound, up to a generic constant, for the overall energy error. A local version of this result is also stated. Several numerical experiments illustrate the theoretical results.Key words. Second-order elliptic partial differential equation, finite volume method, mixed finite element method, a posteriori error estimates, iterative methods for linear algebraic systems, stopping criteria.
Abstract.In this paper we analyze the numerical behavior of several minimum residual methods which are mathematically equivalent to the GMRES method. Two main approaches are compared: one that computes the approximate solution in terms of a Krylov space basis from an upper triangular linear system for the coordinates, and one where the approximate solutions are updated with a simple recursion formula. We show that a different choice of the basis can significantly influence the numerical behavior of the resulting implementation. While Simpler GMRES and ORTHODIR are less stable due to the ill-conditioning of the basis used, the residual basis is well-conditioned as long as we have a reasonable residual norm decrease. These results lead to a new implementation, which is conditionally backward stable, and they explain the experimentally observed fact that the GCR method delivers very accurate approximate solutions when it converges fast enough without stagnation.
Abstract. In this paper we propose a stable variant of Simpler GM-RES by Walker and Zhou [15]. It is based on the adaptive choice of the Krylov subspace basis at given iteration step using the intermediate residual norm decrease criterion. The new direction vector is chosen as in the original implementation of Simpler GMRES or it is equal the normalized residual vector as in the GCR method. We show that such adaptive strategy leads to a well-conditioned basis of the Krylov subspace and we support our theoretical results with illustrative numerical examples.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.