Iterative Galerkin discretizations for strongly monotone problems
From MaRDI portal
Publication:730571
DOI10.1016/J.CAM.2016.08.014zbMATH Open1352.65487arXiv1506.08851OpenAlexW2963472656MaRDI QIDQ730571FDOQ730571
Thomas P. Wihler, Scott Congreve
Publication date: 28 December 2016
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Abstract: In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in order to linearise the iteration matrix (and thereby to recompute it) in each step, the alternative method used in this article exploits the monotonicity properties of the problem, and only needs the iteration matrix calculated once for all iterations of the fixed-point method. We outline the a priori and a posteriori error estimates for iteratively obtained solutions, and show both theoretically as well as numerically how the number of iterations of the fixed-point method can be restricted in dependence of the mesh size, or of the polynomial degree, to obtain optimal convergence.
Full work available at URL: https://arxiv.org/abs/1506.08851
Recommendations
- Adaptive fixed point iterations for semilinear elliptic partial differential equations
- On the convergence of adaptive iterative linearized Galerkin methods
- A comparative analysis of the monotone iteration method for elliptic problems
- Explicit iterations with monotonicity for finite element approximations applied to a system of nonlinear elliptic equations
- scientific article; zbMATH DE number 591302
finite element methodsadaptive mesh refinementquasilinear PDEsnonlinear elliptic PDEBanach fixed point methodsmonotone problems
Cites Work
- The $h-p$ version of the finite element method with quasiuniform meshes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applied functional analysis. Applications to mathematical physics. Vol. 1
- Elliptic Reconstruction and a Posteriori Error Estimates for Parabolic Problems
- Robust a posteriori error estimators for a singularly perturbed reaction-diffusion equation
- Convergence of an adaptive Kačanov FEM for quasi-linear problems
- Computable error estimators for the approximation of nonlinear problems by linearized models
- Guaranteed and robust a posteriori error estimates and balancing discretization and linearization errors for monotone nonlinear problems
- A posteriori estimation of the linearization error for strongly monotone nonlinear operators
- Quasi-norm error bounds for the finite element approximation of some degenerate quasilinear elliptic equations and variational inequalities
- Two-Sided Bounds for Eigenvalues of Differential Operators with Applications to Friedrichs, Poincaré, Trace, and Similar Constants
- An adaptive Newton-method based on a dynamical systems approach
- Fully Adaptive Newton--Galerkin Methods for Semilinear Elliptic Partial Differential Equations
- A posteriori error analysis for linearization of nonlinear elliptic problems and their discretizations
- Title not available (Why is that?)
- Spectral pollution and eigenvalue bounds
Cited In (18)
- Adaptive Local Minimax Galerkin Methods for Variational Problems
- On the convergence of adaptive iterative linearized Galerkin methods
- Gradient Flow Finite Element Discretisations with Energy-Based Adaptivity for Excited States of Schrödinger's Equation
- Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs
- Goal-oriented mesh adaptation method for nonlinear problems including algebraic errors
- A Numerical Energy Reduction Approach for Semilinear Diffusion-Reaction Boundary Value Problems Based on Steady-State Iterations
- Relaxed Kačanov Scheme for the \(\boldsymbol{p}\)-Laplacian with Large Exponent
- Adaptive iterative linearization Galerkin methods for nonlinear problems
- Gradient flow finite element discretizations with energy-based adaptivity for the Gross-Pitaevskii equation
- Energy contraction and optimal convergence of adaptive iterative linearized finite element methods
- A global Newton-type scheme based on a simplified Newton-type approach
- Goal-oriented error analysis of iterative Galerkin discretizations for nonlinear problems including linearization and algebraic errors
- Filtering for Anderson Acceleration
- Discrete comparison principles for quasilinear elliptic PDE
- Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver
- An $hp$-adaptive Newton-discontinuous-Galerkin finite element approach for semilinear elliptic boundary value problems
- Numerical methods for fully nonlinear and related PDEs. Abstracts from the workshop held June 27 -- July 3, 2021 (hybrid meeting)
- Rate optimality of adaptive finite element methods with respect to overall computational costs
This page was built for publication: Iterative Galerkin discretizations for strongly monotone problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730571)
