activity
20182024
most citedA simplified L-curve method as error estimator

45 citations · 60 across the 6 of their papers we have counts for

collaborators
Showing math.NAShow all

6 papers · 1 filter

math.NA2024

Using the Transport of Intensity and the Transport of Phase Equation for Phase Retrieval

Clemens Kirisits, Kemal Raik, Otmar Scherzer +2

We investigate the transport of intensity equation (TIE) and the transport of phase equation (TPE) for solving the phase retrieval problem. Both the TIE and the TPE are derived fro…

math.NA2022

A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration

Simon Hubmer, Ekaterina Sherina, Stefan Kindermann +1

The choice of a suitable regularization parameter is an important part of most regularization methods for inverse problems. In the absence of reliable estimates of the noise level,…

math.NA2019★ 45 cited

A simplified L-curve method as error estimator

Stefan Kindermann, Kemal Raik

The L-curve method is a well-known heuristic method for choosing the regularization parameter for ill-posed problems by selecting it according to the maximal curvature of the L-cur…

math.NA2019★ 10 cited

Convergence of Heuristic Parameter Choice Rules for Convex Tikhonov Regularisation

Stefan Kindermann, Kemal Raik

We investigate the convergence theory of several known as well as new heuristic parameter choice rules for convex Tikhonov regularisation. The success of such methods is dependent…

math.NA2018★ 5 cited

Heuristic Parameter Choice Rules for Tikhonov Regularisation with Weakly Bounded Noise

Stefan Kindermann, Kemal Raik

We study the choice of the regularisation parameter for linear ill-posed problems in the presence of noise that is possibly unbounded but only finite in a weaker norm, and when the…

math.NA2018

Semi-Heuristic Parameter Choice Rules for Tikhonov Regularisation with Operator Perturbations

Uno Hämarik, Urve Kangro, Stefan Kindermann +1

We study the choice of the regularisation parameter for linear ill-posed problems in the presence of data noise and operator perturbations, for which a bound on the operator error…