We derive globally convergent multigrid methods for discrete elliptic variational inequalities of the second kind as obtained from the approximation of related continuous problems by piecewise linear finite elements. The coarse grid corrections are computed from certain obstacle problems. The actual constraints are fixed by the preceding nonlinear fine grid smoothing. This new approach allows the implementation as a classical V-cycle and preserves the usual multigrid efficiency. We give 1−O(j−3) estimates for the asymptotic convergence rates. The numerical results indicate a significant improvement as compared with previous multigrid approaches
We develop multigrid methods for an elliptic distributed optimal control problem on convex domains t...
For special model problems, Fourier analysis gives exact convergence rates for the two-grid multigri...
Abstract A wide range of free boundary problems occurring in engineering and industry can be rewrit...
We derive fast solvers for discrete elliptic variational inequalities of the first kind (obstacle pr...
We consider the fast solution of non-smooth optimization problems as resulting for example from the ...
We consider the fast solution of non-smooth optimization problems as resulting for example from the ...
We consider the fast solution of a class of large, piecewise smooth minimization problems. For lack ...
A wide range of free boundary problems occurring in engineering and industry can be rewritten as a m...
Abstract. For the efficient numerical solution of elliptic variational inequalities on closed convex...
A wide range of problems occurring in engineering and industry is characterized by the presence of a...
We consider the fast solution of large piecewise smooth minimization problems as resulting from the ...
We consider the fast solution of large piecewise smooth minimization problems as resulting from the ...
We consider the convergence theory of adaptive multigrid methods for second-order elliptic problems ...
We present a new inexact nonsmooth Newton method for the solution of convex minimization problems wi...
We consider the convergence theory of adaptive multigrid methods for second-order elliptic problems ...
We develop multigrid methods for an elliptic distributed optimal control problem on convex domains t...
For special model problems, Fourier analysis gives exact convergence rates for the two-grid multigri...
Abstract A wide range of free boundary problems occurring in engineering and industry can be rewrit...
We derive fast solvers for discrete elliptic variational inequalities of the first kind (obstacle pr...
We consider the fast solution of non-smooth optimization problems as resulting for example from the ...
We consider the fast solution of non-smooth optimization problems as resulting for example from the ...
We consider the fast solution of a class of large, piecewise smooth minimization problems. For lack ...
A wide range of free boundary problems occurring in engineering and industry can be rewritten as a m...
Abstract. For the efficient numerical solution of elliptic variational inequalities on closed convex...
A wide range of problems occurring in engineering and industry is characterized by the presence of a...
We consider the fast solution of large piecewise smooth minimization problems as resulting from the ...
We consider the fast solution of large piecewise smooth minimization problems as resulting from the ...
We consider the convergence theory of adaptive multigrid methods for second-order elliptic problems ...
We present a new inexact nonsmooth Newton method for the solution of convex minimization problems wi...
We consider the convergence theory of adaptive multigrid methods for second-order elliptic problems ...
We develop multigrid methods for an elliptic distributed optimal control problem on convex domains t...
For special model problems, Fourier analysis gives exact convergence rates for the two-grid multigri...
Abstract A wide range of free boundary problems occurring in engineering and industry can be rewrit...