Parallel algorithms for the solution of variational inequalities
The author considers variational inequalities of evolution of the form: Find \(u\) such that \[ u\in L^2(0,T; V)\cap L^\infty(0,T; H),\quad u(t)\in K\quad\text{a.e.}, \] \[ \Biggl({\partial u\over\partial t},\widehat u- u\Biggr)_H+ a(u,\widehat u- u)\geq (f,\widehat u-u),\quad \forall\widehat u\in K,\quad u(0)= 0, \] where \(K\) is a closed convex subset of \(V\), \(V\) and \(H\) are Hilbert spaces, such that \(V\subset H\), \(V\) dense in \(H\). For these variational inequalities, a general method for obtaining stable parallel algorithms is proposed. No numerical tests are given.
- A parallel Schwarz algorithm for variational inequalities
- Existence and approximation of solutions for system of generalized mixed variational inequalities
- scientific article; zbMATH DE number 4084886 (Why is no real title available?)
- scientific article; zbMATH DE number 1114119 (Why is no real title available?)
- scientific article; zbMATH DE number 2147796 (Why is no real title available?)
- Parallel solutions of variational inequality problems with nonlinear source terms
- Parallel Algorithms for Quasi-Variational Inequality Arising in Type-II Superconductivity Model
This page was built for publication: Parallel algorithms for the solution of variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301852)
