A Two-Level Method for the Discretization of Nonlinear Boundary Value Problems

Authors:
O. Axelsson;W. Layton
Affiliations:
-;-
Venue:
SIAM Journal on Numerical Analysis
Year:
1996

Citing 0
Cited 6

Global and uniform convergence of subspace correction methods for some convex optimization problems

Mathematics of Computation
Strongly improved stability and faster convergence of temporal sequence learning by using input correlations only

Neural Computation
Two-grid algorithms for some linear and nonlinear elliptic systems

Computing
Two-Grid Discontinuous Galerkin Method for Quasi-Linear Elliptic Problems

Journal of Scientific Computing
Investigations on two kinds of two-grid mixed finite element methods for the elliptic eigenvalue problem

Computers & Mathematics with Applications
Numerical and computational efficiency of solvers for two-phase problems

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a two-level method for the discretization and solution of nonlinear boundary value problems. The method basically involves (i) solving the nonlinear problem on a {\it very} coarse mesh, (ii) linearizing about the coarse mesh solution, and solving the linearized problem on the fine mesh, one time! We analyze the accuracy of this procedure for strongly monotone nonlinear operators (\S2) and general semilinear elliptic boundary value problems (without monotonicity assumptions). In particular, the scaling between the fine and coarse mesh widths required to ensure optimal accuracy of the fine mesh solution is derived as a byproduct of the error estimates herein.