Stopping criteria for iterations in finite element methods
type: Item
instance of: scholarly article
title: Stopping criteria for iterations in finite element methods
zbMATH Open document ID: 1069.65124
published in: Numerische Mathematik
publication date: 2005-03-17T00:00:00Z
full work available at URL: http://purl.org/net/epubs/work/29791
review text: This paper is devoted to stopping criteria for iterative solution methods for linear finite element methods for nonsymmetric positive-definite problems. It is a generalization of \textit{M. Arioli}'s previous results [Numer. Math. 97, No. 1, 1--24 (2004; Zbl 1048.65029)]. The authors prove that the residual measured in the norm induced by the symmetric part of the inverse of the system matrix is relevant to convergence in a finite element context and then use Krylov solvers as alternative ways of calculating or estimating this quantity. Some numerical experiments are presented to show the validity of the criteria.
reviewed by: Dinh Nho Hào
Mathematics Subject Classification ID: 65N30
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 35J25
Mathematics Subject Classification ID: 65N12
zbMATH DE Number: 2146843
zbMATH Keywords: stopping criteria
zbMATH Keywords: linear finite element methods
zbMATH Keywords: convergence
zbMATH Keywords: Krylov solvers
zbMATH Keywords: numerical experiments
author: M. Arioli
author: Daniel Loghin
author: A. J. Wathen
describes a project that uses: mctoolbox
MaRDI profile type: Publication
OpenAlex ID: W2147705138
cites work: A stopping criterion for the conjugate gradient algorithm in a finite element method framework
cites work: Stopping criteria for iterative methods: applications to PDE's
cites work: Error-bounds for finite element method
cites work: A discourse on the stability conditions for mixed finite element formulations
cites work: Q4162607
cites work: Q4113326
cites work: Q4326655
cites work: The cascadic multigrid method for elliptic problems
cites work: Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
cites work: Estimates in quadratic formulas
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Matrix Analysis
cites work: Q4040931
cites work: Analysis of Preconditioners for Saddle-Point Problems
cites work: Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm
cites work: On the Compatibility of a Given Solution With the Data of a Linear System
cites work: Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems
cites work: On error estimation in the conjugate gradient method and why it works in finite precision computations
cites work: Q4127946
cites work: A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
DOI: 10.1007/S00211-004-0568-Z
description: scientific article; zbMATH DE number 2146843