Iterative Galerkin discretizations for strongly monotone problems
From MaRDI portal
Publication:730571
DOI10.1016/j.cam.2016.08.014zbMath1352.65487arXiv1506.08851OpenAlexW2963472656MaRDI QIDQ730571
Thomas P. Wihler, Scott Congreve
Publication date: 28 December 2016
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.08851
adaptive mesh refinementnonlinear elliptic PDEfinite element methodsquasilinear PDEsBanach fixed point methodsmonotone problems
Related Items (18)
A Numerical Energy Reduction Approach for Semilinear Diffusion-Reaction Boundary Value Problems Based on Steady-State Iterations ⋮ Gradient flow finite element discretizations with energy-based adaptivity for the Gross-Pitaevskii equation ⋮ An $hp$-adaptive Newton-discontinuous-Galerkin finite element approach for semilinear elliptic boundary value problems ⋮ Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver ⋮ 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 ⋮ Discrete comparison principles for quasilinear elliptic PDE ⋮ Relaxed Kačanov Scheme for the \(\boldsymbol{p}\)-Laplacian with Large Exponent ⋮ Goal-oriented error analysis of iterative Galerkin discretizations for nonlinear problems including linearization and algebraic errors ⋮ Filtering for Anderson Acceleration ⋮ On the convergence of adaptive iterative linearized Galerkin methods ⋮ Numerical methods for fully nonlinear and related PDEs. Abstracts from the workshop held June 27 -- July 3, 2021 (hybrid meeting) ⋮ Adaptive iterative linearization Galerkin methods for nonlinear problems ⋮ Goal-oriented mesh adaptation method for nonlinear problems including algebraic errors ⋮ Energy contraction and optimal convergence of adaptive iterative linearized finite element methods ⋮ A global Newton-type scheme based on a simplified Newton-type approach ⋮ Adaptive Local Minimax Galerkin Methods for Variational Problems ⋮ Rate optimality of adaptive finite element methods with respect to overall computational costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of an adaptive Kačanov FEM for quasi-linear problems
- Guaranteed and robust a posteriori error estimates and balancing discretization and linearization errors for monotone nonlinear problems
- Spectral pollution and eigenvalue bounds
- Robust a posteriori error estimators for a singularly perturbed reaction-diffusion equation
- Applied functional analysis. Applications to mathematical physics. Vol. 1
- An adaptive Newton-method based on a dynamical systems approach
- A posteriori estimation of the linearization error for strongly monotone nonlinear operators
- Computable error estimators for the approximation of nonlinear problems by linearized models
- The $h-p$ version of the finite element method with quasiuniform meshes
- A posteriori error analysis for linearization of nonlinear elliptic problems and their discretizations
- Elliptic Reconstruction and a Posteriori Error Estimates for Parabolic Problems
- Quasi-norm error bounds for the finite element approximation of some degenerate quasilinear elliptic equations and variational inequalities
- Fully Adaptive Newton--Galerkin Methods for Semilinear Elliptic Partial Differential Equations
- Two-Sided Bounds for Eigenvalues of Differential Operators with Applications to Friedrichs, Poincaré, Trace, and Similar Constants
This page was built for publication: Iterative Galerkin discretizations for strongly monotone problems
