Iterative solution methods for variational inequalities with nonlinear main operator and constraints to gradient of solution

Laitinen, Erkki K.; Лапин, А. В.; Lapin, Sergey

doi:10.1134/s1995080212040129

Cited by 11 publications

(6 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, Theorem 1.1 is a generalization of the corresponding result from [8] about the convergence of the iterative method for the saddle point problems. …”

Section: Iterative Solution Methods For the Constrained Saddle Point mentioning

confidence: 77%

“…More precisely, mesh residual function r = (r , r ) was de ned by the equalities r ,ij = p ,ij − h − (u i+ ,j − u ij ), r ,ij = p ,ij − h − (u i,j+ − u ij ) in a mesh node (ih, jh), and r L = h i,j (r ,ij + r ,ij ) / . We used the stopping criterion r L h (see [8] on the stopping criterion for Uzawa-type iterative methods).…”

Section: Numerical Experimentsmentioning

confidence: 99%

“…The most popular iterative methods for this class of problems are so-called Algorithms 2 to 6 [5, 6] based on the Augmented Lagrangian technique. This technique leads to the constrained saddle point problems with ' lled operators' acting on the primal variables, and the proposed algorithms can be treated as a combination of block relaxation methods and gradient method in dual variables.Another approach to constructing iterative methods for constrained saddle point problems are proposed and investigated in the previous articles of the authors [8,9]. Namely, the saddle point problems are constructed after appropriate equivalent transformations of the discrete inclusion (equivalent to discrete variational inequality).…”

mentioning

confidence: 99%

“…Another approach to constructing iterative methods for constrained saddle point problems are proposed and investigated in the previous articles of the authors [8,9]. Namely, the saddle point problems are constructed after appropriate equivalent transformations of the discrete inclusion (equivalent to discrete variational inequality).…”

mentioning

confidence: 99%

See 3 more Smart Citations

Easily implementable iterative methods for variational inequalities with nonlinear diffusion–convection operator and constraints to the gradient of solution

Laitinen

Лапин

Lapin

2015

Russian Journal of Numerical Analysis and Mathematical Modelling

View full text Add to dashboard Cite

New iterative solution methods are proposed for the nite element approximation of a class of variational inequalities with nonlinear di usion-convection operator and constraints to the gradient of solution. Implementation of every iteration of these methods reduces to the solution of a system of linear equations and a set of two-dimensional minimization problems. Convergence is proved by the application of a general result on the convergence of the iterative methods for a nonlinear constrained saddle point problem.The development of the e cient numerical methods for the variational inequalities with constraints to gradient of a solution is a problem of a great practical importance. The size and complexity of the discrete variational inequalities constructed by using nite element and nite di erence methods pose signi cant problems for the iterative solution methods. The most popular iterative methods for this class of problems are so-called Algorithms 2 to 6 [5, 6] based on the Augmented Lagrangian technique. This technique leads to the constrained saddle point problems with ' lled operators' acting on the primal variables, and the proposed algorithms can be treated as a combination of block relaxation methods and gradient method in dual variables.Another approach to constructing iterative methods for constrained saddle point problems are proposed and investigated in the previous articles of the authors [8,9]. Namely, the saddle point problems are constructed after appropriate equivalent transformations of the discrete inclusion (equivalent to discrete variational inequality). These transformations lead to the constrained saddle point problems with block triangle operators acting on the primal variables, and these problems can be e ectively solved by the Uzawa-type methods (preconditioned gradient methods in dual variables).All aforementioned algorithms can be e ectively implemented when applying to the discrete variational inequalities with potential operators. This is not the case when solving a variational inequality with nonlinear di usion-convection operator because on every step of any of these iterative methods we have to solve a system of nonlinear equations, and this is the most time consuming part of the algorithms.In this article we prove the convergence of the easily implementable 'linearized' Uzawa-type methods. Their implementation reduces to the solution of a system of linear equations and a set of two-dimensional minimization problems. We investigate two methods -with exact solution of the system of linear equations and with its iterative solution by an inner iterative algorithm (the two-stage method). The convergence of the proposed methods follows from a general result for the iterative solution methods for a nite dimensional constrained saddle point problem.Brought to you by | Florida International University Libraries Authenticated Download Date | 6/8/15 12:50 AM

show abstract

“…Thus, Theorem 1.1 is a generalization of the corresponding result from [8] about the convergence of the iterative method for the saddle point problems. …”

Section: Iterative Solution Methods For the Constrained Saddle Point mentioning

confidence: 77%

Section: Numerical Experimentsmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Easily implementable iterative methods for variational inequalities with nonlinear diffusion–convection operator and constraints to the gradient of solution

Laitinen

Лапин

Lapin

2015

Russian Journal of Numerical Analysis and Mathematical Modelling

View full text Add to dashboard Cite

show abstract

“…Another approach to constructing iterative methods for finite-dimensional constrained saddle point problems have been proposed in [5] and developed in [6,7]. This approach is based on the transformation of the original saddle problem to an equivalent one with block-triangle and positive definite matrix acting on the direct variables.…”

Section: Introductionmentioning

confidence: 99%

Efficiently implementable iterative methods for linear elliptic variational inequalities with constraints on the gradient of solution

Kashtanov

Лапин

2015

Russ Math.

View full text Add to dashboard Cite

We construct and investigate a new iterative solution method for a finite-dimensional constrained saddle point problem. The results are applied to prove the convergence of different iterative methods for mesh approximations of variational inequalities with constraints on the gradient of solution. In particular, we prove the convergence of two-stage iterative methods. The main advantage of the proposed methods is the simplicity of their implementation. The numerical testing demonstrates high convergence rate of the methods.

show abstract

Iterative Solution Methods for Large-Scale Constrained Saddle-Point Problems

Laitinen

Лапин

2013

Computational Methods in Applied Sciences

View full text Add to dashboard Cite

Iterative solution methods for variational inequalities with nonlinear main operator and constraints to gradient of solution

Cited by 11 publications

References 3 publications

Easily implementable iterative methods for variational inequalities with nonlinear diffusion–convection operator and constraints to the gradient of solution

Easily implementable iterative methods for variational inequalities with nonlinear diffusion–convection operator and constraints to the gradient of solution

Efficiently implementable iterative methods for linear elliptic variational inequalities with constraints on the gradient of solution

Iterative Solution Methods for Large-Scale Constrained Saddle-Point Problems

Contact Info

Product

Resources

About