Gräser, C. and Sack, U. and Kornhuber, R. (2009) Truncated nonsmooth Newton multigrid methods for convex minimization problems. In: Domain Decomposition Methods in Science and Engineering XVIII. Lecture Notes in Computational Science and Engineering, 70 . Springer Berlin Heidelberg, pp. 129136. ISBN 9783642026768

PDF
582kB 
Official URL: http://dx.doi.org/10.1007/9783642026775_12
Abstract
We present a new inexact nonsmooth Newton method for the solution of convex minimization problems with piecewise smooth, pointwise nonlinearities. The algorithm consists of a nonlinear smoothing step on the fine level and a linear coarse correction. Suitable postprocessing guarantees global convergence even in the case of a single multigrid step for each linear subproblem. Numerical examples show that the overall efficiency is comparable to multigrid for similar linear problems.
Item Type:  Book Section 

Subjects:  Mathematical and Computer Sciences > Mathematics > Numerical Analysis 
Divisions:  Department of Mathematics and Computer Science > Institute of Mathematics 
ID Code:  1803 
Deposited By:  Ekaterina Engel 
Deposited On:  19 Feb 2016 08:39 
Last Modified:  03 Mar 2017 14:41 
Repository Staff Only: item control page