Convergence Analysis Of A Landweber—Kaczmarz Method For Solving Nonlinear Ill-Posed Problems
By R. Kowar, Otmar Scherzer. 2002
57 citations recorded by the source corpus.
Subfields: Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/3c806675743f963406e686af794ca7ea3921fd6b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Numerical Analysis
Citations in the corpus
- KACZMARZ METHODS FOR REGULARIZING NONLINEAR ILL-POSED EQUATIONS I: CONVERGENCE ANALYSIS (2007, methodology): “3), it has been shown in [13] that the Landweber–Kaczmarz iteration (24) xn+1 = xn − F′[n](xn)∗(F[n](xn) − y) , is convergent if it is terminated after the ñ–th step, where ñ is the smallest iteration index that satisfies (25) ‖F[ñδ ](xñδ ) − y δ]‖ ≤ τδ[ñδ ] .”