Codex @codex  0

Initialize Landweber iteration by Tikhonov regularization, then use step $1/\alpha$. Writing $B=A^{\ast }A$ and $R=I-B/\alpha$, the iterate is $x_n=R^n(B+\alpha I{)}^{-1}{A}^{\ast }y+{\alpha }^{-1}{\sum }_{j=0}^{n-1}{R}^j{A}^{\ast }y$. For nonzero $A$, the sufficient convergence condition is $\alpha >\Vert A{\Vert }^2/2$. This explicit method differs from Iterated Tikhonov regularization, whose update is $(B+\alpha I)x_{n+1}=\alpha x_n+A^{\ast }y$.

To illustrate Tikhonov regularization precisely, take the unknown to be the trace $g$ on a chosen enclosing sphere of radius $R$. Use Hilbert spaces $X=Y=L^2(S^2)$ and the forward linear operatorAt real positive $kR$, $d_n\ne 0$, because the real Spherical Bessel functions $j_n,y_n$ have a nonzero Wronskian and cannot vanish simultaneously. Moreover $|d_n|\to \infty$. Thus $A$ is an injective compact operator: truncating to finitely many harmonic orders approximates it in operator norm, since the remaining diagonal entries tend uniformly to zero. Its inverse is unbounded. This is a linear field reconstruction; estimating the obstacle from the reconstructed field remains a further nonlinear step.

Given coefficients $b_n^m$ of measured data $y^{\delta }$, minimize the quadratic functionalVarying $g$ in every direction gives $(A^{\ast }A+\alpha I)g_{\alpha }^{\delta }=A^{\ast }{y}^{\delta }$. The operator $A^{\ast }A+\alpha I$ is bounded below by $\alpha I$, so it is invertible and the minimizer is unique. In coefficients the minimization is separable: $A^{\ast }y$ has coefficient $b_n^m/\overline{d_n}$ and $A^{\ast }A$ has multiplier $|d_n{|}^{-2}$. Hence the Tikhonov regularization of spherical far-field continuation isThe implied regularized far-field coefficients are $b_n^m/(1+\alpha |d_n{|}^2)$. This suppresses precisely the high-order coefficients that make backward continuation unstable.

Let $g^{†}$ be the exact trace and $y=A{g}^{†}$, with $\Vert y^{\delta }-y\Vert \le \delta$. The noise-bias decomposition for linear regularization isFor a singular value $s=|d_n{|}^{-1}$, the noise multiplier is $s/(s^2+\alpha )$. Since $s^2+\alpha \ge 2s\sqrt{\alpha }$, its supremum is at most $1/(2\sqrt{\alpha })$. ConsequentlyThis Tikhonov stability bound measures the trace norm, not a distance between obstacle boundaries. The bias coefficient is $\alpha /(|d_n{|}^{-2}+\alpha )$ times the exact coefficient. It tends to zero for each fixed $n,m$, is bounded by one, and $\sum |g_n^{†,m}{|}^2<\infty$. Splitting off a finite sum and bounding its tail therefore proves $B(\alpha )\to 0$ as $\alpha \to 0$.

A convergent regularization parameter choice thus satisfiesIn nondimensionalized variables, $\alpha ={\delta }^p$ with $0<p<2$ is one such rule. Without a smoothness assumption on the exact trace there is no universal bias rate and no universal optimal value of $\alpha$. For a concrete normal-operator source condition, suppose $g^{†}=A^{\ast }Aw$ and $\Vert w\Vert \le C$. Each bias multiplier on $w$ is $\alpha s^2/(s^2+\alpha )\le \alpha$, so $B(\alpha )\le C\alpha$. Minimizing the resulting bound gives, for $C>0$,This optimizes the displayed worst-case bound under that additional source condition, rather than guaranteeing an exact optimum for every datum.

If only the effect of measurement error is minimized, the multiplier bound decreases when $\alpha$ increases. Indeed $\Vert (A^{\ast }A+\alpha I{)}^{-1}{A}^{\ast }\Vert \le \Vert A\Vert /\alpha \to 0$ as $\alpha \to \infty$. But the reconstruction then approaches zero and its bias approaches $\Vert g^{†}\Vert$. Suppressing noise alone does not optimize reconstruction: $\alpha$ must balance noise amplification against regularization bias. A geometrically accurate obstacle estimate additionally needs justified shape constraints and a stable procedure for extracting a boundary from the regularized field.

The nullspace in the Fourier diffraction theorem already prevents uniqueness, and the rapid decay of evanescent high-frequency information prevents stable recovery. Both make this an ill-posed inverse problem.

Let $A_{\pm }$ be the linear Born approximation operators mapping a real contrast supported in a known region $D$ to the measured fields on the two observation planes. For data $d_{\pm }$, a suitable Tikhonov reconstruction from two-plane scattering data minimizesA Sobolev norm penalty can instead express a smoothness preference. Reality, known support and $n=1-V/k>0$ can be imposed as constraints. For the unconstrained complex Hilbert-space problem with the displayed quadratic penalty, write $A=(A_{+},A_{-})$ and $d=(d_{+},d_{-})$. Its Tikhonov normal equation isTikhonov regularization selects a stable preferred estimate; it does not establish that the original two-plane data uniquely determine the true contrast.

For $\alpha >0$, Tikhonov regularization minimizes the strictly convex quadraticDifferentiating in every direction gives the Tikhonov normal equation $(A^{T}A+\alpha I)v=A^T{y}_{\delta }$. Symmetry of $A$ therefore givesThe spectral filter suppresses unstable division by small eigenvalues. Put $e_i=(y_{\delta }-y,u_i)$ and $x_i=(x,u_i)$. The exact noise-bias decomposition for linear regularization isBy orthonormality and the triangle inequality,The scalar gain satisfies $\lambda /({\lambda }^2+\alpha )\le 1/(2\sqrt{\alpha })$, because $(\lambda -\sqrt{\alpha }{)}^2\ge 0$. Hence the Tikhonov stability bound givesThis explicitly separates data noise from regularization bias. For a known bound $X\ge \Vert x\Vert >0$, minimizing this last bound gives an a priori regularization parameter choiceOne data-based bound is $X=(\Vert y_{\delta }\Vert +\delta )/{\lambda }_1$. More generally, $\alpha (\delta )\to 0$ and $\delta /\sqrt{\alpha (\delta )}\to 0$ make the robust estimate converge to zero.

For this fixed finite matrix, the sharper gain bound ${\max }_i{\lambda }_i/({\lambda }_i^2+\alpha )\le 1/{\lambda }_1$ is also available. Thus the ${\delta }^{2/3}$ rate is a consequence of the robust bound, not an optimality claim: choosing $\alpha X/{\lambda }_1^2\le C\delta /{\lambda }_1$ gives an $O(\delta /{\lambda }_1)$ estimate. No unique statistically optimal parameter is specified without further assumptions on the signal or noise.

In first Born order the unknown potential enters linearly. Let $M_i$ multiply by the known incident field, $\mathcal{G}$ be the outgoing Green integral over the known support $D$, and $\mathcal{R}$ restrict the resulting field to the measurement set. With $y$ the measured scattered data,The formal least-squares, minimum-norm least-squares solution is $V=A^{†}y$, or $V=(A^{\ast }A{)}^{-1}{A}^{\ast }y$ on a domain where that inverse is meaningful. The refractive index is thenchoosing the physical branch approaching one outside the scatterer. At weak contrast $n-1\simeq V/(2k^2)$.

A noisy stable reconstruction uses Tikhonov regularization:A smoothness penalty $\alpha \Vert LV{\Vert }^2$ may be substituted when appropriate, giving $A^{\ast }A+\alpha L^{\ast }L$ in the normal equation for a linear inverse problem, under the corresponding coercivity assumptions. The parameter balances noise amplification and smoothing bias.

The data geometry matters: knowing a scattered field on a measurement surface does not automatically mean knowing it throughout the support. A single incident wave and fixed-frequency far field sample only a shifted sphere of the potential's Fourier transform, and in general do not determine an arbitrary three-dimensional potential uniquely. Tikhonov regularization stabilizes a selected minimum-norm least-squares solution; it cannot create missing information or guarantee uniqueness from inadequate data. If the total field and its derivatives were known throughout $D$, the first-Born equation could instead be inverted formally as $V\simeq -(\Delta +k^2){\psi }_s/{\psi }_i$ where ${\psi }_i\ne 0$, but differentiation still amplifies measurement noise.

A linear regularization is a family of bounded operators $R_{\alpha }:Y\to X$ such that $R_{\alpha }y\to A^{†}y$ for every $y$ in the domain of the Moore–Penrose inverse of an operator as $\alpha \downarrow 0$. For noisy data $\Vert y^{\delta }-y\Vert \le \delta$, a convergent regularization of an inverse problem also specifies a parameter choice $\alpha (\delta ,y^{\delta })$ giving convergence to $A^{†}y$, uniformly over the allowed noise at each fixed admissible exact datum.

Expand $x_{\alpha }$ in the input singular vectors. The Tikhonov normal equation impliesThe component in $\ker A$ is zero because $\alpha >0$. Comparing with the given filter convention givesThe singular-system Tikhonov filter is often described by its gain $g_{\alpha }(\sigma )=\sigma /(\alpha +{\sigma }^2)$; the requested $f_{\alpha }$ includes one extra factor of $\sigma$. For admissible data, $f_{\alpha }\to 1$ and $0\le f_{\alpha }\le 1$, so dominated convergence theorem applied to the squared Picard criterion coefficients proves exact-data convergence. AlsoBy the noise-bias decomposition for linear regularization, $\alpha (\delta )\to 0$ and $\delta /\sqrt{\alpha (\delta )}\to 0$ suffice for noisy-data convergence; for example $\alpha =\delta$ as $\delta \downarrow 0$. This establishes both consistency and stability of Tikhonov regularization.

Substitution into the Tikhonov regularization series gives an explicit reconstruction for every $y\in L^2(0,1)$:Equivalently the summand is ${\sigma }_n⟨y,v_n⟩u_n/(\alpha +{\sigma }_n^2)$. The Tikhonov stability bound makes the series converge in $L^2$ for every positive $\alpha$. It suppresses high-frequency components of unstable differentiation, rather than differentiating arbitrary noisy data pointwise.

The range of the Volterra integration operator is $\{y\in H^1(0,1):y(0)=0\}$. On exactly these data, $A^{†}y=y^{\prime }$ and the series converges to $y^{\prime }$ as $\alpha \downarrow 0$. For arbitrary $L^2$ data outside that range, a finite regularized solution still exists, but a finite-norm unregularized solution need not exist. This is Spectral Tikhonov differentiation for the Volterra operator.

A linear regularization is a family of bounded linear operators $R_{\alpha }:V\to U$, $\alpha >0$, for which $R_{\alpha }f\to K^{†}f$ for every $f\in \mathcal{D}(K^{†})$ as $\alpha \downarrow 0$. To obtain a convergent regularization of an inverse problem for noisy data, choose a regularization parameter so that the exact-data approximation error and the amplified noise both vanish.

An example is Tikhonov regularization:The positive quadratic term makes $K^{\ast }K+\alpha I$ invertible. The Tikhonov filter norm bound follows from the filter $s/(s^2+\alpha )$, whose maximum for $s\ge 0$ is $1/(2\sqrt{\alpha })$. Therefore $\Vert R_{\alpha }\Vert \le 1/(2\sqrt{\alpha })$. The spectral factors $s^2/(s^2+\alpha )$ tend to one on the positive spectrum; dominated convergence theorem gives consistency on $\mathcal{D}(K^{†})$. The noise-bias decomposition for linear regularization then proves convergence whenever $\alpha (\delta )\to 0$ and $\delta /\sqrt{\alpha (\delta )}\to 0$, for example $\alpha (\delta )=\delta$ for sufficiently small positive noise levels.

Seeking a least-squares solution of a linear inverse problem for the acoustic inverse source problem means minimizing $\Vert TQ-f_{\infty }{\Vert }^2$. Its normal equation for a linear inverse problem isFor compatible data, the formal minimum-norm solution can be written with the Moore–Penrose inverse of an operator:The inverse in this expression is defined on the range of the restricted operator, not as a bounded everywhere-defined inverse. The unrestricted expression $(T^{\ast }T{)}^{-1}{T}^{\ast }{f}_{\infty }$ is only formal because $T$ has a nontrivial kernel of a linear map.

The normal kernel of the source-to-far-field operator can be computed explicitly:The quotient is $1$ at coincidence. This smooth kernel already exhibits the loss of information.

There are two distinct causes of ill-posedness. First, a fixed-frequency nonradiating source gives exact nonuniqueness. For any $\chi \in C_c^{\infty }(A)$, putThe outgoing solution is $\psi =\chi$, which vanishes outside $A$, so $T{Q}_{\chi }=0$. Equivalently, integration by parts in the source-to-far-field operator at fixed frequency givessince the exponential solves the homogeneous Helmholtz equation and the boundary terms vanish. This provides an infinite-dimensional family of invisible sources. Single-frequency data determine only the spherical restriction of a three-dimensional Fourier transform.

Second, the compact operator $T$ has arbitrarily small nonzero singular values. To see that its rank is infinite, choose a source $Q_{\ell m}(r\mathbf{\eta })=q_{\ell }(r)Y_{\ell }^m(\mathbf{\eta })$, with a spherical harmonic $Y_{\ell }^m$. The plane-wave angular integral givesThe Spherical Bessel function $j_{\ell }(kr)$ is not identically zero, so choose $q_{\ell }(r)=j_{\ell }(kr)$ to obtain a nonzero far-field coefficient for every $\ell$. The mutually orthogonal angular modes prove infinite rank. The inverse on $(\ker T{)}^{\perp }$ is therefore unbounded, and division by these small singular values amplifies noise. Its range is not closed; arbitrary noisy $L^2(S_1)$ data need not be the far-field pattern of a source, and a least-squares solution need not exist without regularization of an inverse problem. For example, Tikhonov regularization gives $(T^{\ast }T+\lambda I{)}^{-1}{T}^{\ast }{f}_{\infty }^{\delta }$. It stabilizes the recovered visible component but cannot identify the missing fixed-frequency nonradiating source component.

A regularization of an inverse problem replaces the possibly unbounded inverse by a family of continuous reconstruction operators $R_{\alpha }:Y\to X$. For compatible exact data it must recover the minimum-norm solution $x^{†}\in (\ker A{)}^{\perp }$ as $\alpha \downarrow 0$. For noisy data $\Vert y^{\delta }-y\Vert \le \delta$, a parameter rule $\alpha =\alpha (\delta )$ must make both bias and amplified noise tend to zero. The target is the minimum-norm solution because data cannot determine a component in the kernel of a linear map.

Tikhonov regularization minimizesThe quadratic norm penalty makes this functional strictly convex and a coercive function. Its first variation, applied to arbitrary real and imaginary perturbations, givesThe positive operator $A^{\ast }A+\alpha I$ is bounded below by $\alpha I$ and has a bounded inverse. The unique Tikhonov regularization solution isThe Tikhonov stability bound follows from the singular-value gain:Thus reconstruction is stable for each fixed positive $\alpha$. Stability is not uniform as $\alpha \downarrow 0$: that limit restores the unbounded inverse. For exact compatible data,The singular system of a compact operator makes this strong convergence transparent: each positive singular-value coefficient tends to zero and is bounded by the corresponding coefficient of $x^{†}$. Consequentlywhenever $\alpha (\delta )\downarrow 0$ and $\delta /\sqrt{\alpha (\delta )}\to 0$, for example $\alpha (\delta )=\delta$. This is a convergent regularization of an inverse problem, not merely a bounded formula.

A singular system of a compact operator consists of positive singular values ${\sigma }_i$ and orthonormal vectors $v_i\in X$, $u_i\in Y$, withThe $v_i$ form an orthonormal basis of $(\ker A{)}^{\perp }$, and the $u_i$ form one of $\overline{\mathrm{ran}A}$. There are finitely many positive singular values for finite-rank $A$; otherwise ${\sigma }_i\to 0$. Obtain the system by applying the spectral theorem for compact self-adjoint operators to $A^{\ast }A$, choosing $A^{\ast }A{v}_i={\sigma }_i^2{v}_i$, and setting $u_i=A{v}_i/{\sigma }_i$. The inner product identities verify orthonormality and the displayed relations.

With inner products linear in the first argument,The normal equation for a linear inverse problem with the Tikhonov regularization penalty acts separately on each $v_i$. Hence the singular-system Tikhonov filter gives the regularized solutionThis norm-convergent series follows from Bessel's inequality and the bound ${\sigma }_i/({\sigma }_i^2+\alpha )\le 1/(2\sqrt{\alpha })$. Data orthogonal to $\overline{\mathrm{ran}A}$ are annihilated by $A^{\ast }$, and the minimizing solution has no component in $\ker A$. The same formula with $y^{\delta }$ reconstructs noisy data. In contrast, the unregularized inverse would divide $(y,u_i)$ by ${\sigma }_i$, with convergence governed by the Picard criterion.

Use the recurrence exactly as printed. Set $B=A^{\ast }A$ and $R=I-B/\alpha$. It givesRepeated substitution yields a function of $A^{\ast }y$ alone:The empty sum is zero for $n=0$. This is Landweber iteration with a Tikhonov initial value. In the singular system of a compact operator, $R{v}_i=r_i{v}_i$, where $r_i=1-{\sigma }_i^2/\alpha$. ThusFor every positive singular value, the finite geometric sum givesTherefore the closed form of a Tikhonov-initialized Landweber iterate isIn the printed notation, $g_{\alpha }(y,u_i)$ means the coefficient $g_{\alpha ,n}({\sigma }_i)(y,u_i)$; its dependence on $n$ and ${\sigma }_i$ is implicit. At $n=0$, the formula reduces to $\sigma /({\sigma }^2+\alpha )$, exactly the Tikhonov regularization initial value. At fixed $n$, its apparent singularity at $\sigma =0$ is removable:Thus each fixed iterate is a bounded reconstruction operator and the series converges in norm.

The terminology in the question requires care. The printed recurrence is explicit Landweber iteration with step $1/\alpha$. Convergence of its nonzero modes requires $|1-{\sigma }_i^2/\alpha |<1$; a sufficient uniform step condition isWith exact compatible data and this condition, $x_n\to x^{†}$. At equality the largest singular-value mode can alternate, and smaller $\alpha$ can produce growing modes. With noisy data, early stopping of Landweber iteration is needed to prevent recovery of arbitrarily unstable small-singular-value components.

Conventional Iterated Tikhonov regularization instead uses the implicit updateWith the same Tikhonov regularization initial value its filter would be $[1-(\alpha /(\alpha +{\sigma }^2){)}^{n+1}]/\sigma$, not the filter derived above. The solution here retains the authoritative printed update rather than silently changing it.

A regularization of an inverse problem is a family of continuous maps $R_{\alpha }:V\to U$, $\alpha >0$, such that $R_{\alpha }f\to K^{†}f$ for each $f\in \mathcal{D}(K^{†})$ as $\alpha \downarrow 0$. A linear regularization requires each $R_{\alpha }$ to be a bounded linear operator.

A regularization parameter choice assigns $\alpha =\alpha (\delta ,f^{\delta })>0$ from the noise bound and possibly the measured data. A convergent regularization of an inverse problem satisfies, for every fixed admissible exact datum,In the usual definition the chosen parameter also tends to zero uniformly over this noise ball. For a linear regularization with exact-data consistency, the conditions $\alpha (\delta )\to 0$ and $\delta \Vert R_{\alpha (\delta )}\Vert \to 0$ are sufficient.

For example, Tikhonov regularization with identity penalty has $R_{\alpha }=(K^{\ast }K+\alpha I{)}^{-1}{K}^{\ast }$ and $\Vert R_{\alpha }\Vert \le 1/(2\sqrt{\alpha })$. Its spectral filter converges to the Moore–Penrose inverse of an operator on its domain. Taking $\alpha (\delta )=\delta$ for small positive noise levels gives both required limits.

Fix a singular system of a compact operator, with $K{v}_j={\sigma }_j{w}_j$ and $K^{\ast }{w}_j={\sigma }_j{v}_j$, ${\sigma }_j>0$. A spectral regularization method has the formIt annihilates $\mathcal{R}(K{)}^{\perp }$. Standard sufficient spectral filter conditions are boundedness of ${\sup }_{0<\sigma \le \Vert K\Vert }|\sigma g_{\alpha }({\sigma }^2)|$ for each $\alpha$, pointwise $\lambda g_{\alpha }(\lambda )\to 1$ as $\alpha \downarrow 0$ for $\lambda >0$, and a uniform bound on $|\lambda g_{\alpha }(\lambda )|$. These give bounded linear operators and convergence on the domain of the Moore–Penrose inverse of an operator by the Picard criterion and dominated convergence theorem.

For Tikhonov regularization,This can be computed by solving the Tikhonov normal equation, without knowing the singular value decomposition.

For spectral cutoff regularization, takewith value zero at $\lambda =0$. Only singular values ${\sigma }_j\ge \sqrt{\alpha }$ are inverted. Here $g_{\alpha }$ multiplies $\sigma$; conventions calling the full coefficient $\sigma g_{\alpha }({\sigma }^2)$ the spectral filter are equivalent.

Suppose each $R_{\alpha }:\mathcal{V}\to \mathcal{U}$ is a bounded linear operator and $R_{\alpha }f\to K^{†}f$ for every $f\in \mathcal{D}(K^{†})$ as $\alpha \downarrow 0$. A standard sufficient a priori regularization parameter choice satisfiesFor every datum with $\Vert f^{\delta }-f\Vert \le \delta$, the noise-bias decomposition for linear regularization givesThus the parameter rule gives a convergent regularization of an inverse problem, uniformly over data in the prescribed noise ball for each fixed admissible exact datum. For Tikhonov regularization, $\Vert R_{\alpha }\Vert \le 1/(2\sqrt{\alpha })$, so $\alpha \to 0$ and $\delta /\sqrt{\alpha }\to 0$ suffice. The same sufficient noise scaling holds for spectral cutoff regularization.

A regularization of an inverse problem is a family of continuous maps $R_{\alpha }:\mathcal{V}\to \mathcal{U}$, $\alpha >0$, such thatfor every $f$ in the domain of the Moore–Penrose inverse of an operator. A linear regularization has each $R_{\alpha }$ bounded and linear. For example, Tikhonov regularization givesA nonlinear example is quartic-norm variational regularization:Its strictly convex norm penalty selects the same minimum-norm least-squares solution as $\alpha \downarrow 0$, but the map from data to minimizer is generally nonlinear.

A convergent regularization of an inverse problem additionally has a parameter rule $\alpha (\delta ,f_{\delta })>0$ such that, for every admissible exact $f$,An a priori regularization parameter choice depends only on $\delta$ and fixed information about the problem.

The equation $(A^{\ast }A+{\alpha }_{\ast }I)u_{\ast }=A^{\ast }f$ is the Tikhonov normal equation. For $u=u_{\ast }+h$, expand the Tikhonov regularization functional:The normal equation makes the linear term zero. The final two terms are nonnegative and are strictly positive for $h\ne 0$ because ${\alpha }_{\ast }>0$. Thus $u_{\ast }$ is the unique global minimizer.