2007
DOI: 10.1007/s10589-007-9056-6
|View full text |Cite
|
Sign up to set email alerts
|

Error estimates for the numerical approximation of Neumann control problems

Abstract: We continue the discussion of error estimates for the numerical analysis of Neumann boundary control problems we started in Casas et al. (Comput. Optim. Appl. 31:193-219, 2005). In that paper piecewise constant functions were used to approximate the control and a convergence of order O(h) was obtained. Here, we use continuous piecewise linear functions to discretize the control and obtain the rates of convergence in L 2 ( ). Error estimates in the uniform norm are also obtained. We also discuss the approach s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
58
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
5
4

Relationship

4
5

Authors

Journals

citations
Cited by 59 publications
(58 citation statements)
references
References 10 publications
(19 reference statements)
0
58
0
Order By: Relevance
“…Indeed, to numerically solve a Neumann control problem, piecewise constant or piecewise linear functions are typically taken to approximate the controls. In both cases, the maximal order of the error estimates is h or h 3/2 , respectively; see [3]. A consequence of our estimate is that we also have error estimates of order h or h 3/2 , depending on the type of approximation used for the controls, for a fully discretized control problem using piecewise linear approximation of the states on a polygonal domain.…”
Section: Introductionmentioning
confidence: 78%
See 1 more Smart Citation
“…Indeed, to numerically solve a Neumann control problem, piecewise constant or piecewise linear functions are typically taken to approximate the controls. In both cases, the maximal order of the error estimates is h or h 3/2 , respectively; see [3]. A consequence of our estimate is that we also have error estimates of order h or h 3/2 , depending on the type of approximation used for the controls, for a fully discretized control problem using piecewise linear approximation of the states on a polygonal domain.…”
Section: Introductionmentioning
confidence: 78%
“…If Ω is a polygonal domain, then it is covered by the union of the triangles of the mesh, and Γ remains invariable. Then problems (NP) and (DP) are approximated by some discrete problems, and it is possible to estimate the differences ū −ū h L 2 (Γ) between the different solutions of (NP) and (DP) and the corresponding discrete approximations; see [3] or [4] for the Neumann case and [5] for the Dirichlet case. In the problems that we are considering here, the situation is more complicated because the numerical analysis with finite elements requires the approximation of Ω by a new (typically polygonal) domain Ω h , so that the comparison between the solutionsū andū h is more involved becauseū ∈ L 2 (Γ) andū h ∈ L 2 (Γ h ), where Γ h is the boundary of Ω h .…”
Section: Introductionmentioning
confidence: 99%
“…The space of discretized controls is We denote the solutions of problem (P h ) and (P h ε ) byū h andū h ε respectively. We address the reader to [7] for the details about the optimization process, [4] for theory about continuous piecewise linear approximation of Neumann control problems, and [5] for theory about approximation of Dirichlet control problems.…”
Section: An Examplementioning
confidence: 99%
“…All the previous papers were devoted to distributed optimal control problems. In [7], the authors proved error estimates of order O(h 3/2 ) for Neumann control problems in a two-dimensional domain by assuming a similar assumption to the one introduced by Rösch. The use of piecewise linear approximations for a Dirichlet control problem was investigated in [8].…”
mentioning
confidence: 99%