2006
DOI: 10.1016/j.crma.2006.09.010
|View full text |Cite
|
Sign up to set email alerts
|

Consistency of Landweber algorithm in an ill-posed problem with random data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…(1) and x e the unique element of E such that Ax e = u e . In practice, the available data are not known precisely, and we have only its approximation (Bissantz et al, 2004(Bissantz et al, , 2007Cardot, 2002;Dahmani and Bouhmila, 2006;Kaipio and Somersalo, 2005;Tarantola, 2005).…”
Section: Notations and Hypothesismentioning
confidence: 98%
“…(1) and x e the unique element of E such that Ax e = u e . In practice, the available data are not known precisely, and we have only its approximation (Bissantz et al, 2004(Bissantz et al, , 2007Cardot, 2002;Dahmani and Bouhmila, 2006;Kaipio and Somersalo, 2005;Tarantola, 2005).…”
Section: Notations and Hypothesismentioning
confidence: 98%