1996
DOI: 10.1007/978-94-009-1740-8
|View full text |Cite
|
Sign up to set email alerts
|

Regularization of Inverse Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

59
4,757
1
29

Year Published

2000
2000
2016
2016

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 4,154 publications
(4,846 citation statements)
references
References 0 publications
59
4,757
1
29
Order By: Relevance
“…In practice, this means that small errors in the measured BOLD signal can induce large errors in the estimate of the parameters. To solve IPP (7), we propose a solution methodology that is based on the Tikhonov regularized Newton method (TNM) [32,33], since regularized iterative methods appear to be the primary candidates for solving nonlinear and ill-posed problems (see, e.g., [34], and the references therein). The Newton algorithm addresses the nonlinear aspect of IPP (7), whereas the Tikhonov regularization procedure is incorporated to address its ill-posed nature [35,36].…”
Section: Parameter Estimation: the Solution Methodologymentioning
confidence: 99%
“…In practice, this means that small errors in the measured BOLD signal can induce large errors in the estimate of the parameters. To solve IPP (7), we propose a solution methodology that is based on the Tikhonov regularized Newton method (TNM) [32,33], since regularized iterative methods appear to be the primary candidates for solving nonlinear and ill-posed problems (see, e.g., [34], and the references therein). The Newton algorithm addresses the nonlinear aspect of IPP (7), whereas the Tikhonov regularization procedure is incorporated to address its ill-posed nature [35,36].…”
Section: Parameter Estimation: the Solution Methodologymentioning
confidence: 99%
“…On the other hand, such finite difference or finite element computations only work efficiently in low dimension, since the problem of finding the control of the ordinary differential equation (1.1) in R d has been transformed to solving a partial differential equation in R d × [0, T ], while the Pontryagin approach based on the solution of the two ordinary differential equations (1.15) with (1.8), forX and the adjoint variableλ, is computationally feasible even in very high dimension, d 1, with application to distributed control of partial differential equations cf. [17,18], optimal shape [21] and inverse problems [13,29], see Section 2. This work uses 1 Citation from chapter one in [24] "This equation of Bellman's yields an approach to the solution of the optimal control problem which is closely connected with, but different from, the approach described in this book (see Chap.…”
Section: U(x T) := Inf X(t)=x α∈A G X(t ) +mentioning
confidence: 99%
“…by the discrepancy principle, cf. [13,29]. The Newton method described in Section 3 works well to solve the discrete equations for d = 10.…”
Section: Ds(t) = µS(t)dt + σ T S(t) S(t)dw (T) (21)mentioning
confidence: 99%
“…So it was not our goal in this paper to compare Conjugate Gradient with those methods, but to show that our approximation of GCV is applicable as a stopping rule to the Conjugate Gradient method for large scale ill-posed problems, similar to Positron Emission Tomography (very large scale, not severely ill-posed and relatively large noise in the data). Some authors (see, for example, [15,9]) have suggested the use of other approximations to GCV. Our experimental results show (Fig.…”
Section: Positron Emission Tomographymentioning
confidence: 99%