Convergence Rates For Tikhonov Regularization of Coefficient Identification Problems in Robin-Boundary Equation
Abstract
This paper investigates the convergence rate for Tikhonov regularization of the problem of identifying the coefficient a ∈ L∞() in the Robin-boundary equation -div(a∇ u)-bu=f,~ x ∈ ⊂ RM,~ M ≥ 1 and u=0,~ x ~on~ ∂, where f(x)∈ L∞(). Assume we only know the imprecise values of u in the subset 1 ⊂ given by zδ ∈ H1(1), satisfies \|u-zδ\|H1(1)≤ δ. We assume u satisfy the following boundary conditions on ∂1: align* ∇ u · n+γ u =0~on~∂1, align* where n is the normal vector of ∂1 and γ>0 is a constant. We regularize this problem by correspondingly minimizing the strictly convex functional: align* a ∈ A &12 ∫_1 a | ∇(U(a)-zδ)|2 +12∫∂1 aγ [U(a)-zδ]2-12 ∫_1 b [U(a)-zδ]2\\ &+ \| a-a* \|2L2(), align* where U(a) is a map for a to the solution of the Robin-boundary problem, > 0 is the regularization parameter and a* is a priori estimate of a. We prove that the functional attain a unique global minimizer on the admissible set. Further, we give very simple source condition without the smallness requirement on the source function which provide the convergence rate O(δ) for the regularized solution.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.