{'fraction_non_alphanumeric': 0.05643522238502623, 'fraction_numerical': 0.016755683698066834, 'mean_word_length': 4.105574324324325, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 18, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 28, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Uniqueness, stability and global convergence for a discrete inverse elliptic Robin transmission problem

We derive a simple criterion that ensures uniqueness, Lipschitz stability and global convergence of Newton's method for the finite dimensional zero-finding problem of a continuously differentiable, pointwise convex and monotonic function. Our criterion merely requires to evaluate the directional derivative of the forward function at finitely many evaluation points and for finitely many directions. We then demonstrate that this result can be used to prove uniqueness, stability and global convergence for an inverse coefficient problem with finitely many measurements. We consider the problem of determining an unknown inverse Robin transmission coefficient in an elliptic PDE. Using a relation to monotonicity and localized potentials techniques, we show that a piecewise-constant coefficient on an a-priori known partition with a-priori known bounds is uniquely determined by finitely many boundary measurements and that it can be uniquely and stably reconstructed by a globally convergent Newton iteration. We derive a constructive method to identify these boundary measurements, calculate the stability constant and give a numerical example.

from (partial) knowledge of its solutions. A prominent example is the emerging technique of electrical impedance tomography (EIT), cf. [1,12,14,23,24,31,62,63,83,86,88,90,95,101,103], and the references therein for a broad overview. Inverse coefficient problems are usually highly non-linear and ill-posed, and uniqueness and stability questions, as well as the design and the theoretical study of reconstruction algorithms are extremely challenging topics in theoretical and applied research.
In practical applications, only finitely many measurements can be made, the unknown coefficient has to be parametrized with finitely many variables (e.g., by assuming piecewise-constantness on a given partition), and physical considerations typically limit the unknown coefficient to fall between certain a-priori known bounds. Thus, after shifting and rescaling, a practical inverse coefficient problem can be put in the form of finding the zero x ∈ [0, 1] n of a non-linear function F : R n → R m , It is of utmost importance to determine what measurements make this finitedimensional inverse (or zero-finding) problem uniquely solvable, to evaluate the stability of the solution with respect to model and measurement errors, and to design convergent numerical reconstruction algorithms.
In this paper, we will study this problem under the assumption that F is a pointwise monotonic and convex function, which often arises in elliptic inverse coefficient problems (cf. our remarks on the end of this introduction). We will derive a simple criterion that implies the existence of a zero, and the injectivity of F in a certain neighborhood of [0, 1] n . It also allows us to quantify the Lipschitz stability constant of the left inverse F −1 and, for n = m, ensures global convergence of Newton's method. The criterion is easy-to-check as it merely requires to evaluate the directional derivative F (z)d for a finite number of evaluation points z and finitely many directions d.
We then show how our result can be applied to the inverse problem of determining a Robin transmission coefficient in an elliptic PDE from the associated Neumann-to-Dirichlet operator that is motivated by EIT-based corrosion detection [53]. We assume that the Robin coefficient is piecewise-constant on a-priori known partition of the interface into n parts, and that we a-priori know upper and lower bounds for the Robin coefficient's values. We then show how to construct n boundary measurements that uniquely determine the n unknown Robin values, and for which a standard Newton method globally converges. We also quantify the stability of the solution with respect to errors, and numerically demonstrate our result on a simple setting.
Let us give some references to put our result in the context of existing literature. The arguably most famous elliptic inverse coefficient problem is the Calderón problem [27,28], that arises in EIT, cf. [10,30,34,44,72,[79][80][81]89,98] for an incomplete list of seminal breakthroughs for the uniqueness question in an infinite-dimensional setting.
Several recent works have addressed uniqueness and Lipschitz stability questions for the problem of determining finitely many parameters (e.g., by assuming piecewise-constantness) from finitely or infinitively many measurements in inverse coefficient problems, cf., [2-7, 11, 15, 18-22, 32, 48, 51, 53, 68, 69, 71, 76, 77, 87, 93, 96, 104, 105]. To the knowledge of the author, the results presented herein, is the first on explicitly calculating those measurements that uniquely determine the unknown parameters, and, together with [53], it is the first result to explicitly calculate the Lipschitz constant for a given setting. Moreover, we obtain the unique existence of a solution also for noisy measurements, so that Lipschitz stability also yields an error estimate in the case of noise.
Reconstruction algorithms for inverse coefficient problems typically rely on Newton-type approaches or on globally minimizing a non-convex regularized data-fitting functional. Both approaches require an initial guess close to the unknown solution, so that most algorithms are only known to converge locally. For the sake of rigor, it should be noted at this point, that the difficulty in this context is not to construct globally convergent methods but computationally feasible globally convergent methods. To elaborate on this point, let us consider a minimization problem with a continuous functional f : I → R over a finitedimensional interval I ⊆ R n . A trivial optimization algorithm is to choose a countable dense subset (q m ) m∈N ⊂ I, and setting x 0 := q 0 , Then, obviously, any accumulation point of (x m ) m∈N is a global minimizer of f . But this type of approach requires a completely unfeasible amount of function evaluations and is thus usually disregarded in practice. Note, however, that together with estimates on the convergence range of an iterative algorithm as in the recent preprint of Alberti and Santacesaria [3], and the progress of parallel computing power, these type of approaches may become feasible at least for lower dimension numbers.
To obtain (computationally feasible) globally convergent algorithms, quasireversibility and convexification ideas have been developed in the the seminal work of Klibanov et al., cf., e.g. [16,17,74,75]. Alternatively, one can use very specific properties of the considered problem, cf., e.g., the global convergence result of Knudsen, Lassas, Mueller and Siltanen [78] for the d-bar method for EIT, or resort to only reconstructing the shape of an anomaly, cf. [54,55,58,59,64,66,67] for some globally convergent approaches. The theory developed in this work shows that, somewhat surprisingly, global convergence holds for the standard zero-finding Newton method, when the right measurements are being used, and this also implies fast quadratic convergence. On the other hand, so far, our theory does not allow to utilize more measurements than unknowns or to explicitly add regularization, which would be advantageous in practical applications. Moreover, the calculated measurements tend to become more or more oscillatory for higher dimensional problems. Hence, so far, we can only expect our approach to be practically feasible for relatively few unknowns where discretization sufficiently regularizes the ill-posed problem.
On the methodological side, this work builds upon [48,53] and stems from the theory of combining monotonicity estimates with localized potentials, cf. [9, 13, 25, 35, 43, 45, 46, 50-52, 56-59, 61, 94] for related works, and [29,[37][38][39][40]49,54,55,60,85,97,99,100,102,106] for practical monotonicity-based reconstruction methods. In this work, the monotonicity and convexity of the forward function is based on the so-called monotonicity relation which goes back to Ikehata, Kang, Seo, and Sheen [65,70]. The existence of measurements that fulfill the extra criterion on the directional derivative evaluations follows from localized potentials arguments [41]. Hence, it might be possible to extend the theory developed herein to other elliptic inverse coefficient problems where monotonicity and localized potentials results are also available. Note however, that this extension is not obvious since the localized potentials results for the herein considered Robin transmission problem are stronger than those known for other coefficient problems such as EIT.
Finally, it should be noted, that the monotonicity and localized potentials techniques evolved from the factorization method [26,42,47,73,82], and that global convergence for Newton's method for finite-dimensional zero-finding problems is a classical result for pointwise convex functions that are inverse monotonic (also called Collatz monotone [33]), cf., e.g., the book of Ortega and Rheinboldt [91,Thm. 13.3.2]. Such problems arise, e.g., in solving nonlinear elliptic PDEs. Roughly speaking, one might be tempted to say, that elliptic forward coefficient problems lead to inverse monotonic convex function, and inverse elliptic coefficient problems lead to forward monotonic convex functions. Our extra criterion on the directional derivative evaluations allows us to write our forward monotonic function as an affine transformation of an inverse monotonic function in a certain region and (together with some technical arguments to ensure the iterates staying in this region), this is the major key in proving our global convergence result.
The paper is organized as follows. In section 2, we prove uniqueness, stability and global convergence of the Newton method for continuously differentiable, pointwise convex and monotonic functions under a simple extra condition on the directional derivatives. In section 3, we apply this result to an inverse Robin coefficient problem, and show how to determine those measurements that uniquely and stably determine the unknown coefficient with a desired resolution via a globally convergent Newton iteration. We also give a numerical example in section 3. Throughout this paper, we take the somewhat lengthy, but hopefully reader-friendly approach of first presenting less technical intermediate results to motivate our approach.

Uniqueness, stability and global Newton convergence
We consider a continuously differentiable, pointwise convex and monotonic function where n, m ∈ N, m ≥ n ≥ 2, and U is a convex open set. In this section, we will derive a simple criterion that implies injectivity of F on a multidimensional interval. The criterion also allows us to estimate the Lipschitz stability constant of the left inverse F −1 and, for n = m, ensures global convergence of Newton's method.
Remark 1 Throughout this work, "≤" is always understood pointwise for finite-dimensional vectors and matrices, and x ≤ y denotes the converse, i.e., that x − y has at least one positive entry.
Monotonicity and convexity are understood with respect to this pointwise partial order, i.e., F : and F is convex if We also say that a function F is anti-monotone if −F is monotonic. For continuously differentiable functions, it is easily shown that monotonicity is equivalent to and thus equivalent to F (x) ≥ 0. Convexity is known to be equivalent to cf., e.g., [91,Thm. 13.3.2]. All the proofs in this section use the monotonicity and convexity assumption in the form (1) and (2).
Throughout this work, we denote by e j ∈ R n the j-th unit vector in R n , 1 := (1, 1, . . . , 1) T ∈ R n , and e j := 1 − e j . I n ∈ R n×n denotes the n-dimensional identity matrix, and 11 T ∈ R n×n is the matrix containing 1 in all of its entries.

A simple criterion for uniqueness and Lipschitz stability
Before we state our result in its final form in subsection 2.3, we derive two weaker (and less technical) results that motivate our arguments and may be of independent interest. We first show a simple criterion that yields injectivity of F and allows us to estimate the Lipschitz stability constant of its left inverse F −1 .
then the following holds: (4) we have that for all x, y ∈ [0, 1] To prove Theorem 1, we will first formulate an auxiliary lemma, which will also be used in our more technical results. Note that assumption (5) in the following lemma simply means that a row permutation of the non-negative matrix F (x) ∈ R m×n is strictly diagonally dominant in its first n rows.
then F (x) ∈ R m×n is injective, and its left inverse fulfills F (x) −1 Proof (a) For all 0 = d ∈ R n , at least one of the entries of d d ∞ must be either 1 or −1, so that there exists j ∈ {1, . . . , n} with either We thus obtain from the monotonicity assumption (1) that either In both cases, it follows from (5) that This proves injectivity of F (x) and the bound on its left inverse.
Proof (of Theorem 1) Let j ∈ {1, . . . , n}. Writing we have that Thus we deduce from (1) and (2) that for all x ∈ [0, 1] n With the definition of L in (4), this shows that so that (a), (b) and (c) follow from lemma 1.

A simple criterion for global convergence of the Newton iteration
We will now show how to ensure that a convex monotonic function F has a unique zero, and that the Newton method globally converges against this zero.
To prove Theorem 2 we will first show the following lemma.
By contraposition, this shows that which also shows that y ∞ = max j=1,...,n y j .
(d) It is easily checked that which shows that M is invertible and M −1 = I n − 1 n+1 11 T Moreover, using (c) it follows that F (x)y ≥ 0 implies that for all k ∈ N, n j=1 y j + y k ≥ max j=1,...,n y j + n min j=1,...,n y j ≥ 0. so that F (x)y ≥ 0 implies M y = (11 T + I n )y ≥ 0. This also shows that Lemma 3 Let F : U ⊆ R n → R n be continuously differentiable and pointwise convex on a convex open set U containing zero, and let M ∈ R n×n . We assume that for some point Then for all t ∈ [0, 1] Proof The assumptions (11) and the convexity (2) yield that for all t ∈ [0, 1] then we also obtain from the convexity assumption (2) that Proof (of Theorem 2) Theorem 2(a) has been proven in lemma 2(b).
is well defined.
We will prove that x (k+1) ∈ (−1, n) n . We argue by contradiction, and assume that this is not the case. Then, by continuity, there exists t ∈ (0, 1] with x (k+t) ∈ [−1, n] n \ (−1, n) n and, by lemma 3, Convexity (2) then yields that and using lemma 2(c) this would imply that min j=1,...,n For all l ∈ {1, . . . , n}, we obtain from (12) and (13) n Using lemma 3 again, this shows that for all the next Newton iterate x (k+1) is well-defined and also fulfills Hence, for x (0) := 1, the Newton algorithm produces a well-defined sequence is monotonically non-increasing and bounded. Hence, (M x (k) ) k∈N and thus also (x (k) ) k∈N converge. We definê Since F is continuously differentiable and F (x) is invertible, it follows from the Newton iteration formula (10) that F (x) = 0. Also, the monotone convergence of (M x (k) ) k∈N shows that Moreover, since this is the standard Newton iteration, the convergence speed is superlinear and the speed is quadratic if F is Lipschitz continuous in a neighbourhood ofx. It only remains to show thatx ∈ (− 1 n−1 , n n−1 ) n ⊂ (−1, 2) n . For this, we use the convexity to obtain which then implies by lemma 2(c) that min j=1,...,nx From this we obtain that min j=1,...,nx which yields min j=1,...,nxj > − 1 n−1 . Using (14) again, we then obtain which shows max j=1,...,nxj < n n−1 . 2

A result with tighter domain assumptions
Our results in subsections 2.1 and 2.2 require the considered function F to be defined (and convex and monotonic) on a much larger set than [0, 1] n . For some applications (such as the inverse coefficient problem in section 3), the following more technical variant of Theorem 2 is useful, as it allows us treat the case where the domain of definition is an arbitrarily small neighbourhood of [0, 1] n .
Theorem 3 Let > 0 and c ≥ 2 + 2 . Let F : U ⊆ R n → R n , n ≥ 2, be continuously differentiable, pointwise convex and monotonic on a convex open where K := ceil( 2cn 1 + + 1+ then the following holds on O : The Newton iteration sequence where M := 11 T + (1 + (c − 1)n)I n ∈ R n×n . The rate of convergence of x i →x is superlinear. If F is locally Lipschitz then the rate of convergence is quadratic.
To prove Theorem 3 we first prove a variant of lemma 2 with tighter domain assumptions.
(c) For all x ∈ O, and 0 = y ∈ R n F (x)y ≥ 0 implies max j=1,...,n y j = y ∞ and min j=1,...,n Proof We use the same arguments as in lemma 2. To prove (a) let j ∈ {1, . . . , n} and x ∈ O = [− 1+ cn , 1 + ] n . Then, by the definition of K, there exists k ∈ {1, . . . , K}, so that It follows from the definition of z (j,k) and d (j) in (16) and (17) that We thus obtain which proves (a). Since this also implies a fortiori that To show (c) by contraposition, let x ∈ O, 0 = y ∈ R n , and assume that for some index j ∈ {1, . . . , n}, we have that By contraposition, this shows that and the latter also implies that y ∞ = max j=1,...,n y j . For the proof of (d), it is easily checked that which shows the invertibility of M and the asserted formula for M −1 . Moreover, for all y ∈ R n , and l ∈ {1, . . . , n}, Hence, using (c), for all x ∈ O, F (x)y ≥ 0 implies M y ≥ 0. As this also shows that We proceed as in the proof of Theorem 2. Assertion (a) has already been proven in lemma 4(b).
We argue by contradiction, and assume that this is not the case. Then, by continuity, there exists t ∈ (0, 1] with x (i+t) ∈ O \ O, so that, by lemma 3, Convexity (2) then yields that and using lemma 4(c) this would imply min j=1,...,n For all l ∈ {1, . . . , n}, we obtain from (20) and (21) 1 and thus cn .
An elementary computation shows that where we used cn > 1 for the first inequality, and we used the assumption c ≥ 2 + 2 = 2+ + 1 for the last inequality. Hence, for all l ∈ {1, . . . , n}, This contradicts x (i+t) ∈ O \ O, and thus shows that Using lemma 3 again, this shows that for all is well-defined and also fulfills Hence, for x (0) := 1, the Newton algorithm produces a well-defined sequence is monotonically non-increasing and bounded. Hence, (M x (i) ) i∈N and thus also (x (i) ) k∈N converge. We definê Since F is continuously differentiable and F (x) is invertible, it follows from the Newton iteration formula that F (x) = 0. Also, the monotone convergence of (M x (i) ) i∈N shows that Moreover, since this is the standard Newton iteration, the convergence speed is superlinear and the speed is quadratic if F is Lipschitz continuous in a neighbourhood ofx. 2

Application to an inverse Robin transmission problem
We will now show how to use our result to obtain uniqueness, stability and global convergence results for an inverse coefficient problem with finitely many measurements. More precisely, we show how to choose finitely many measurements so that they uniquely determine the unknown coefficient function with a given resolution, Lipschitz stability holds, and Newton's method globally converges.

The setting
We consider the inverse Robin transmission problem for the Laplace equation from [53], that is motivated by corrosion detection. Note that similar problems have also been studied for the Helmholtz equation under the name conductive boundary condition or transition boundary condition [8,84]. We first introduce the idealized infinite-dimensional forward and inverse problem following [53] and then study the case of finitely many measurements.

The infinite-dimensional forward and inverse problem
Let We assume that Ω describes an electrically conductive imaging domain, with a-priori known conductivity that we set to 1 for the ease of presentation.
(Note that all of the following results remain valid if the conductivity in D and in Ω \ D are a-priori known spatially dependent functions as long as they are sufficiently regular to allow unique continuation arguments). We assume that corrosion effects on the interface Γ can be modelled with an unknown Robin transmission parameter γ ∈ L ∞ + (Γ ), where L ∞ + denotes the subset of L ∞ -functions with positive essential infima.
Applying an electrical current flux g ∈ L 2 (∂Ω) on the boundary ∂Ω then yields an electric potential u ∈ H 1 (Ω) solving the following Robin transmission problem with Neumann boundary values where ν is the unit normal vector to the interface Γ or ∂Ω pointing outward of D, resp., Ω, and denote the jump of the Dirichlet, resp., Neumann trace values on Γ , with the superscript "+" denoting that the trace is taken from Ω \ D and "−" denoting the trace taken from D. In the following, we often denote the solution of (22)-(25) by u (g) γ to point out its dependence on the Robin transmission coefficient γ and the Neumann boundary data g.
It is easily seen that this problem is equivalent to the variational formulation of finding u (g) gw ds for all w ∈ H 1 (Ω), (26) and that (26) is uniquely solvable by the Lax-Milgram-Theorem. Hence, we can define the Neumann-to-Dirichlet map It is easy to show that Λ(γ) is a compact self-adjoint linear operator. One may regard Λ(γ) as an idealized model (the so-called continuum model) of all electric current/voltage measurements that can be carried out on the outer boundary ∂Ω. Hence the infinite-dimensional inverse coefficient problem of determining a Robin transmission coefficient from boundary measurements can be formulated as the problem to reconstruct γ ∈ L ∞ + (Γ ) from Λ(γ) ∈ L(L 2 (∂Ω)). We summarize some more properties of the infinite-dimensional forward mapping Λ in the following lemma.
Note that lemma 5 shows that Λ is a convex, anti-monotone function with respect to the pointwise partial order on L ∞ + (Ω), and the Loewner partial order in the space of compact self-adjoint operators on L 2 (∂Ω). These properties are the key to formulate the finite-dimensional inverse problem as a zero finding problem for a pointwise convex and monotonic forward function.

The inverse problem with finitely many measurements
In practical applications, it is natural to assume that the unknown Robin transmission coefficient is a piecewise constant function, i.e., γ(x) = n j=1 γ j χ j (x) where γ j > 0 and χ j := χ Γj are the characteristic functions on pairwise disjoint subsets Γ j ⊆ Γ of a given partition Γ = n j=1 Γ j . For the ease of notation, here and in the following, we identify a piecewise constant function γ(x) = n j=1 γ j χ j (x) ∈ L ∞ (Γ ) with the vector γ = (γ 1 , . . . , γ n ) ∈ R n . We also simply write a for the constant function γ(x) = a, and for the vector (a, . . . , a) ∈ R n (and use b analogously). Throughout this work we always assume that n ≥ 2.
It is also natural to assume that one knows bounds a, b ∈ R on the unknown Robin transmission coefficient, so that 0 < a ≤ γ j ≤ b for all j = 1, . . . , n. For the semi-discretized inverse problem of reconstructing the finite-dimensional We now go one step further and assume that we can only measure finitely many components of Λ(γ), i.e., that we can measure for a finite number of Neumann boundary data g j , h j ∈ L 2 (∂Ω). Hence, the fully discretized inverse Robin transmission problem leads to the finite dimensional non-linear inverse problem to determine γ ∈ [a, b] n ⊂ R n from F (γ) ∈ R m .
The following practically important questions are then to be answered: Given bounds [a, b] and a partition of Γ (i.e., a desired resolution), how many and which Neumann boundary functions g j , h j should be used, so that F (γ) uniquely determines γ? How good is the stability of the resulting inverse problem with regard to noisy measurements? How can one construct a globally convergent numerical algorithm to practically determine γ from F (γ)? And how good will the solution be in the case that the true Robin transmission function γ is not piecewise constant?
The following subsections show how these questions can be answered using the theory developed in section 2. For this, let us first observe, that the symmetric choice g j = h j leads to an inverse problem with a pointwise convex and monotonic forward function.
Proof This follows immediately from lemma 5.

Uniqueness, stability and global Newton convergence
We summarize the assumptions on the setting: Let Ω ⊂ R d (d ≥ 2), be a bounded domain with Lipschitz boundary ∂Ω and let D be an open subset of Ω, with D ⊂ Ω, Lipschitz boundary Γ := ∂D and connected complement Ω \ D. We assume that the true unknown Robin transmission coefficientγ ∈ L ∞ + (Γ ) is bounded by b ≥γ(x) ≥ a for x ∈ Γ a.e., with a-priori known bounds b > a > 0, and thatγ = n j=1γ j χ j , χ j := χ Γj , is piecewise constant on an a-priori known partition Γ = n j=1 Γ j into n ∈ N, n ≥ 2, pairwise disjoint measurable subsets Γ j ⊂ Γ with positive measure.
We will show how to construct n Neumann boundary functions g j ∈ L 2 (∂Ω), so that γ ∈ [a, b] n is uniquely determined by the n measurements We also quantify the Lipschitz stability constant of this inverse problem, and show that the inverse problem can be numerically solved with a globally convergent Newton method. Our main tool is to reformulate the finite-dimensional inverse problem as a zero finding problem for the pointwise monotonic and convex function Φ introduced in lemma 6. Then we use a relation to the concept of localized potentials [41] to prove that we can choose the measurements g j in such a way that Φ also fulfills the additional assumptions on the directional derivative of the forward function as required by our Newton convergence theory in section 2.
At this point, let us stress that our theory in section 2 allows us to find m = n measurements that uniquely recover the n unknown components of the Robin coefficient, but it also requires to use exactly those m = n measurements to ensure global convergence of Newton's method. In practice, it would be highly desirable to utilize additional measurements for the sake of redundancy and error reduction. But our convergence theory in section 2 does not cover the case m > n yet, and an extension to, e.g., Gauss-Newton or Levenberg-Marquardt methods seems far from trivial. Moreover, for some applications, it would be desirable to also treat the interior boundary Γ as unknown. But it is not clear whether the interplay of parametrization, differentiability and localized potentials results that is required to fulfill the assumptions of section 2 can also be extended to this case. Hence, in all of the following we will only consider the case where the interior boundary is known and utilize exactly m = n measurements.

Choosing the measurements (for specific bounds)
To demonstrate the key idea, we will first consider the specific (and rather restrictive) case where the bounds a, b fufill since this case can be treated by simply combining Theorem 2 with a known localized potentials result from [53]. The case of general bounds b > a > 0 is more technical and requires an extended result on simultaneously localized potentials. It will be treated in subsection 3.2.2.
Theorem 4 Given bounds b > a > 0 that fulfill n(n + 3) < b b−a , we define the piecewise constant functions κ (j) ∈ L ∞ + (Γ ), j = 1, . . . , n, by setting (a) If, for all j = 1, . . . , n, g j ∈ L 2 (∂Ω) fulfills then the finite-dimensional non-linear inverse problem of determining has a unique solution in [a, b] n , and γ depends Lipschitz continuously on F (γ). Moreover, the iterates of Newton's method applied to the problem of determining γ from F (γ), with initial value γ (0) = a ∈ R n , quadratically converge to the unique solution γ (see lemma 7 for more details on the properties of F ). (b) In any large enough finite-dimensional subspace of L 2 (∂Ω), one can find g 1 , . . . , g n fulfilling (29) by the following construction: Let (f m ) m∈N ⊆ L 2 (∂Ω) be a sequence of vectors with dense linear span in L 2 (∂Ω). Let j ∈ {1, . . . , n}, m ∈ N, and let M (j) m ∈ R m×m be the symmetric matrix with entries (l, k = 1, . . . , m) Then, for sufficiently large dimension m ∈ N, the matrix M (j) m ∈ R m×m has a positive eigenvalue λ (j) > 0. For a corresponding normalized eigen- (29) is fulfilled by To prove Theorem 4, we formulate the consequences of our Newton convergence theory in section 2 in the following lemma.
where I := (a − b−a n−1 , b + b−a n−1 ) n , and I : Moreover, for all y ∈ R n with there exists a unique γ ∈ I with F (γ) = y. The Newton iteration produces a sequence (γ (i) ) i∈N ⊂ I that converges quadratically to γ.
By density and continuity, for sufficiently large m ∈ N, there exists a Bastian Harrach This shows that the symmetric matrix M

Choosing the measurements (for general bounds)
We now show how to treat the case of general bounds b > a > 0.
Proof We define r and Φ as in lemma 6. Then r([0, 1] n ) = [a, b] n and Lemma 6 yields assertion (a) and that Φ : U ⊆ R n → R n is a continuously differentiable pointwise convex and monotonic function on U = (−∞, b b−a ) n , with locally Lipschitz continuous Φ , and Moreover, with z (j,k) , d (j) ∈ R n defined by (16) and (17), we have that κ (j,k) = r(z (j,k) ) and d (j) = 1 2 e j − βe j .
It thus follows from lemma 6 and (32) that so that Φ fulfills the assumptions of Theorem 3 which then yields the assertions (b)-(d). 2 To prove Theorem 5(b), we need to ensure that there exist Neumann data g j ∈ L 2 (∂Ω) so that the corresponding solutions u gj κ (j,k) are much larger on Γ j than on Γ \ Γ j , and this property has to hold for several Robin transmission coefficients κ (j,k) , k = 1, . . . , K, simultaneously.
Note that for fixed j ∈ {1, . . . , n} the Robin transmission coefficients κ (j,k) only differ on Γ j . Hence, the following lemma will allow us to estimate u gj κ (j,k) on Γ j by u gj κ (j,1) .
where Γ 0 is a measurable subset of Γ with positive measure. Then, for all g ∈ L 2 (∂Ω), the corresponding solutions u 1 , u 2 ∈ H 1 (Ω) of (22)-(25) with γ = γ (1) , and γ = γ (2) , respectively, fulfill Proof We proceed analogously to [50,Lemma 3.6]. It follows from the variational formulation (26) that Hence, we obtain and the assertion follows. 2 The next lemma will allow us to construct u gj κ (j,k) for which u gj κ (j,1) is large on Γ j (and thus by lemma 10 all u gj κ (j,k) are large on Γ j ), and at the same time all u gj κ (j,k) are small on Γ \ Γ j .
By a simple normalization argument, the assertion is now equivalent to showing that Using a functional analytic relation between operator ranges and the norms or their adjoints (cf., [41,Lemma 2.5], [36,Cor. 3.5]), the property (35) (and thus the assertion) is proven if we can show that We prove (36) by contradiction, and assume that Then, for every f 0 ∈ L 2 (Γ 0 ), there exist f 1 , . . . , f K ∈ L 2 (Γ \ Γ 0 ), so that Let v 0 , . . . , v K ∈ H 1 (Ω) be the associated solutions from the definition of A 0 , . . . , A K (with f = f k ), and set v := v 1 + . . . + v K − v 0 . Then v| ∂Ω = 0, and ∂ ν v| ∂Ω = 0, so that by unique continuation v = 0 in Ω \ D. But this also yields that v| Γ = 0, and from this we obtain that v = 0 in D, so that v = 0 in all of Ω. Hence, using (33) and (34), we obtain for all w ∈ H 1 (Ω), and this shows that However, since this holds for all f 0 ∈ L 2 (Γ 0 ), this would imply that are the compact trace operator and the continuous multiplication operator by γ (1) − γ (k) . Hence, the closed infinite-dimensional space L 2 (Γ 0 ) would be the range of a compact operator, which is not possible cf., e.g., [92,Thm. 4.18]. This contradiction shows that (36) must hold, and thus the assertion is proven.
Using that for all k ∈ {1, . . . , K} and thus it follows from lemma 9 Hence, (32) is fulfilled. 2 Remark 2 Regarding the formulation of Theorem 5(b), note that we actually prove that the matrix M (j) m ∈ R m×m has a positive eigenvalue if the dimension m is sufficiently large, and that an eigenvector corresponding to a positive eigenvalue leads to a boundary current g j that fulfills (32). But the estimates that we use in the proof of 5(b) are far from being sharp, so that it seems worth checking (32) already for eigenvectors to a largest eigenvalue that is not yet positive.

Numerical results
We test our results on the simple example setting shown in figure 1. and b := 2 and that it is known to be piecewise-constant with respect to the partition of Γ , i.e., Recall that, for the ease of notation, we identify a piecewise-constant function γ ∈ L 2 (Γ ) with the vector (γ 1 , . . . , γ 4 ) ∈ R 4 , and simply write a for the constant function γ(x) = a, and for the vector (a, a, a, a) ∈ R 4 (and use b analogously).

Choosing the measurements
We first apply Theorem 5 to construct n = 4 Neumann boundary functions g 1 , . . . , g 4 ∈ L 2 (∂Ω) so that the four measurements m ∈ R m×m starting with m = 1, and increase the dimension m ∈ N, until an eigenvector v (j) ∈ R m corresponding to a largest eigenvalue of this matrix has the property that  (30), were obtained using the commercial finite element software Comsol.
For our setting we had to increase the dimension up to at most m = 15, so that all g j are trigonometric polynomials of order less or equal 7. Figure 2 shows the boundary functions g j plotted with respect to the boundary angle on the unit circle ∂Ω.
From checking (32), we also obtain the Lipschitz stability constant for F (γ) := ∂Ω g j Λ(γ)g j ds 4 j=1 as described in lemma 8(c). For our setting we obtain the stability estimate where I is the slightly enlarged interval from lemma 8. Note that here and in the following we consider the measurement error relative to F (2) − F (1) ∞ as this is the width of the measuring range F (1) ≥ F (γ) ≥ F (2).
The property (32) can be interpreted in the sense that the boundary current g j generates an electric potential for which the corresponding solution |u gj κ | 2 is much larger on Γ j than on the remaining boundary Γ \ Γ j , and that this simultaneously holds for several (but finitely many) Robin transmission coefficients κ = κ (j,k) . To illustrate this localization property, figure 3 shows |u gj κ | 2 (in logarithmic scale) for k = 1 and k = K.
Let us make a comment on improving the computation time. Note that the properties of F only depend on whether the used Neumann functions g j have the desired property (32), and that our rigorous approach of constructing g j is computationally more expensive than checking whether some given g j fulfills (32). In fact, for fixed j ∈ {1, . . . , n}, the construction of the matrix M Hence, one might try computationally cheaper heuristic approaches to construct g j that satisfy (32). In our experiments, we successfully used the ad-hoc approximation (which only requires 2m PDE solutions), and always found that increasing the dimension m ∈ N lead to Neumann boundary function g j fulfilling (32) for all k ∈ {1, . . . , K}. Moreover, in our experiments, we found the functions g j constructed with this faster heuristic approach virtually identical to those constructed with the exact matrix M (j) m from Theorem 5.

Global convergence of Newton's method
We numerically study the theoretically predicted global convergence of the standard Newton method when applied to the measurements g 1 , . . . , g 4 constructed in the last subsection. We slightly change the definition of F and , and numerically evaluate F using that, for all g ∈ L 2 (∂Ω), and γ ∈ L ∞ + (Γ ), which immediately follows from the variational formulation of the Robin transmission problem (26). Note that this approach is numerically more stable than calculating Λ(γ) and Λ(a) separately as it avoids loss of significance effects. We choose the true coefficient value asγ := (1.3, 1.8, 1.5, 1.9), and first test the reconstruction for noiseless data y δ :=ŷ := F (γ). Starting with the lower bound γ (0) := (1, 1, 1, 1), we implement the standard Newton method where the (j, l)-th entry of the Jacobian matrix F (γ) ∈ R 4×4 is given by γ | 2 ds, cf. lemma 6. We repeat this for noisy data with relative noise level δ > 0, that we obtain by adding a vector with random entries toŷ, so that y δ −ŷ ∞ = δ F (b) ∞ . Note that F (a) = 0, so that this chooses the norm level relative to the measurement range. For the noiseless case δ = 0 we committed the so-called inverse crime of using the same forward solver (i.e., the same finite element mesh) for simulating the dataŷ = F (γ) and for evaluating F and F in the Newton iteration. For the noisy cases δ > 0, we used a different mesh for the forward and inverse solvers. Figure 4 shows the error of the first Newton iterations for the case δ = 0, δ = 10 −5 , δ = 10 −3 , and δ = 10 −1 , and demonstrates the theoretically predicted quadratic convergence properties. At this point, let us stress that (s) . / (/ = 1%) . / (/ = 10%) also for noisy data y δ , Lemma 8 yields that there exists a unique solution y δ ∈ I ⊇ [a, b] n of F (γ δ ) = y δ , and that the standard Newton method converges to this solution γ δ , as long as y δ lies within the bounds F (a) ≥ y δ ≥ F (b) (which is easily guaranteed by capping or flooring the values in y δ ). Moreover, the obtained solution will satisfy the error estimate γ δ −γ ∞ ≤ 7.34 δ due to the stability estimate (37) obtained in the last subsection. We finish this subsection with an example where the true Robin transmission coefficientγ ∈ L ∞ + (Γ ) is not piecewise constant but within the a-priori known bounds a ≤γ(x) ≤ b for x ∈ Γ (a.e.) Thenŷ = ∂Ω g j (Λ(γ) − Λ(a)) g j ds 4 j=1 ∈ R 4 will still satisfy F (a) ≥ŷ ≥ F (b), so that there exists a unique solution γ ∈ I ⊇ [a, b] n of F (γ) =ŷ, i.e., there exists a unique piecewise constant Robin transmission coefficient that leads to the same measured data as the true non-piecewise-constant coefficient function. The Newton iteration applied toŷ (or a noisy version y δ ) will globally converge to this piecewise constant solution γ (or an approximation γ δ ), see figure 5 for a numerical example.

Effect of interval width and number or unknowns
Our result in Theorem 5 holds for any a-priori known bounds b > a > 0 and any number of unknowns n ∈ N. Thus, in theory, we can treat arbitrary large intervals [a, b] and arbitrary fine resolutions of Γ . However, numerically, the constructed trigonometric polynomials g j will quickly become more and more oscillatory, and the calculated Lipschitz constants will quickly increase.  To demonstrate the effect of the interval width, we proceed as in subsection 3.3.1 to calculate four boundary currents g 1 , . . . , g 4 ∈ L 2 (∂Ω) that uniquely determine γ ∈ [a, b] 4 and yield global Newton convergence for a = 1, and b ∈ {2, 3, 4, 5}. Table 1 shows the dimension of the trigonometric polynomial subspace of L 2 (∂Ω) that contains g 1 , . . . , g 4 and the obtained Lipschitz constant for the inverse problem of determining γ from the corresponding measurements.
To demonstrate the effect of the number of unknowns, we then replace the square D by regular polygons with n = 3, n = 4, n = 5, and n = 6 sides keeping the polygon center and circumradius the same as in the square (n = 4) case. We assume that γ is piecewise constant with respect to the polygon sides. As in subsection 3.3.1 we then calculate n boundary currents g 1 , . . . , g n ∈ L 2 (∂Ω) that uniquely determine γ ∈ [1, 2] n and yield global Newton convergence. The required dimension of the trigonometric polynomial subspace of L 2 (∂Ω) and the obtained Lipschitz constant are shown in table 2.
In both situations, the boundary currents quickly become highly oscillatory, and the calculated stability constant worsens. Hence, at the current state, our approach will only be feasible for moderate contrasts and relatively few unknowns as stated in the introduction. It should be noted, however, that our criterion (32) in Theorem 5 is sufficient but possibly not necessary for uniqueness, Lipschitz stability and global Newton convergence. The constructed boundary currents and the calculated Lipschitz constants may be far from optimal. Since our result is (to the knowledge of the author) the very first on uniqueness, global convergence and explicit Lipschitz stability constants for a discretized inverse coefficient problem, there may well be room for improvement and significantly sharper estimates that could practically yield in less oscillations and better stability constants.

Conclusions
We have derived a method to determine which (finitely many) measurements uniquely determine the unknown coefficient in an inverse coefficient problem with a given resolution, and proved global convergence of Newton's method for the resulting discretized non-linear inverse problem. Our method also allows to explicitly calculate the Lipschitz stability constant, and yields an error estimate for noisy data. To the knowledge of the author, these are the first such results for discretized inverse coefficient problems.
Our method stems on an extension of classical global Newton convergence theory from convex inverse-monotonic to convex (forward-)monotonic functions that arise in elliptic inverse coefficient problems. The extension required an extra assumption on the directional derivatives of the considered function that we were able to fulfill by choosing the right measurements.
Our proofs mainly utilized monotonicity ideas and localized potential techniques that are also known for several other elliptic inverse coefficient problems. So the ideas in this work might be applicable to other applications as well. A particularly interesting extension would be the case of EIT where it has recently been shown [48] that an unknown conductivity distribution with a given resolution is uniquely determined by voltage-current-measurements on sufficiently many electrodes, but the number of required electrodes is not known. The main difficulty of such an extension is that localized potentials in EIT cannot concentrate on each domain part separately as in the simpler Robin transmission problem considered in this work. Roughly speaking, a localized potential in EIT with high energy in some region D will also have a high energy on its way from the boundary electrodes to D. This behavior will make the application of our herein presented ideas more challenging.