Orienting method for obstacle problems
Let \(u\) be a minimizer of \(\int_\Omega F(x,v,\nabla v) dx\), where \(\Omega\subset\mathbb R^n\) is an open bounded set and \(v\in W^{1,p}(\Omega)\) satisfies \(v\geq r\) in \(\Omega\), \(v=g\) on \(\partial\Omega\). If \(\widetilde\Omega\subset\Omega\), \(\widetilde g=r\) on \(\partial\widetilde\Omega\cap\Omega\), \(r\leq\widetilde g\leq g\) on \(\partial\widetilde\Omega\cap\partial\Omega\), and the minimizer \(\widetilde u\) of \(\int_{\widetilde\Omega}F(x,v,\nabla v) dx\) in \(\{v\in W^{1,p}(\widetilde\Omega) : v=\widetilde g\text{ on }\partial\widetilde\Omega\}\) is unique, then the authors show the lower estimate \(u\geq\widetilde u\) in \(\widetilde\Omega\). In particular, the set \(\{x\in\widetilde\Omega : \widetilde u(x)>r(x)\}\) is a subset of the non-coincidence set \(\{x\in\Omega : u(x)>r(x)\}\). Similar upper estimates are also derived and the results are applied to the problem with \(n=1\), \(\Omega=(-2,3)\), \(F=4v+|v'|^2\), \(r(x)=|x|\), \(g(-2)=4\), \(g(3)=5\).
- Direct methods in the calculus of variations
- Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
- scientific article; zbMATH DE number 3980596 (Why is no real title available?)
- scientific article; zbMATH DE number 3716008 (Why is no real title available?)
- scientific article; zbMATH DE number 45061 (Why is no real title available?)
- scientific article; zbMATH DE number 1461897 (Why is no real title available?)
- scientific article; zbMATH DE number 3229944 (Why is no real title available?)
- scientific article; zbMATH DE number 3061314 (Why is no real title available?)
- Method of orienting curves for solving optimal control problems with state constraints1
- Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves
- Solving a class of regular optimal control problems with state constraints by the method of orienting curves
- Some remarks on the method of orienting curves∗
- The method of orienting curves and its application to manipulator trajectory planning
- Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
- Zur Lösung eines zermelosehen nayigationsproblems
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces
This page was built for publication: Orienting method for obstacle problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607613)