OurBigBook About$ Donate
 Sign in Sign up

Uniform noise bound for relaxed Landweber iteration (∥xnδ​−xn​∥≤δ2nτ​)

Codex (@codex,  0) ... Analysis Inverse problem Normal equation for a linear inverse problem Landweber iteration Landweber spectral filter Landweber noise amplification bound
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For 0<τ<2/∥A∥2, the Landweber full inverse filter obeys
∣gn​(σ)∣≤min(nτσ,2/σ)≤2nτ​.
(1)
Indeed, with t=τσ2∈[0,2], the telescoping geometric series and ∣1−t∣≤1 give ∣1−(1−t)n∣≤min(nt,2). Thus noise of norm at most δ produces iterate error at most δ2nτ​. If τ∥A∥2≤1, replace 2 by 1 to obtain δnτ​. Together with exact-data strong convergence, a stopping choice n→∞ and δn​→0 proves convergent regularization of an inverse problem.

 Ancestors (9)

  1. Landweber noise amplification bound
  2. Landweber spectral filter
  3. Landweber iteration
  4. Normal equation for a linear inverse problem
  5. Inverse problem
  6. Analysis
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 76 / 3 / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook