arXiv Analytics

Sign in

arXiv:2301.09459 [math.NA]AbstractReferencesReviewsResources

Goal-oriented error analysis of iterative Galerkin discretizations for nonlinear problems including linearization and algebraic errors

Vit Dolejsi, Scott Congreve

Published 2023-01-23Version 1

We consider the goal-oriented error estimates for a linearized iterative solver for nonlinear partial differential equations. For the adjoint problem and iterative solver we consider, instead of the differentiation of the primal problem, a suitable linearization which guarantees the adjoint consistency of the numerical scheme. We derive error estimates and develop an efficient adaptive algorithm which balances the errors arising from the discretization and use of iterative solvers. Several numerical examples demonstrate the efficiency of this algorithm.

Related articles: Most relevant | Search more
arXiv:1106.4266 [math.NA] (Published 2011-06-21)
On the linearization of Regge calculus
arXiv:1506.08851 [math.NA] (Published 2015-06-29)
Iterative Galerkin Discretizations for Strongly Monotone Problems
arXiv:1805.07887 [math.NA] (Published 2018-05-21)
Analysis of novel adaptive two-grid finite element algorithms for linear and nonlinear problems