Accurate and efficient numerical solutions for elliptic obstacle problems
DOI10.1186/s13660-017-1309-zzbMath1358.65041OpenAlexW2584130379WikidataQ30363169 ScholiaQ30363169MaRDI QIDQ509970
Tai Wan Kim, Philku Lee, Seongjai Kim
Publication date: 16 February 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1309-z
algorithmconvergencenumerical exampleelliptic obstacle problemgradient-weighting methodobstacle relaxationsubgrid finite differencesuccessive over-relaxation method
Numerical optimization and variational techniques (65K10) Existence theories for optimal control problems involving partial differential equations (49J20) Numerical methods of relaxation type (49M20)
Related Items (4)
Cites Work
- Duality-based algorithms for total-variation-regularized image restoration
- An algorithm for solving the double obstacle problems
- The obstacle problem revisited
- An efficient primal-dual method for the obstacle problem
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Image Zooming by Curvature Interpolation and Iterative Refinement
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Numerical Solution of the Two-Phase Obstacle Problem by Finite Difference Method
- Iterative Solution of Piecewise Linear Systems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Adaptive Multilevel Methods for Obstacle Problems
- A general framework for low level vision
- An $L^1$ Penalty Method for General Obstacle Problems
- Curvature Interpolation Method for Image Zooming
- Numerical Solution of Obstacle and Parabolic Obstacle Problems based on Piecewise Linear Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Accurate and efficient numerical solutions for elliptic obstacle problems
