KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Sat, 08 Oct 2005 17:10:20 +0200Sat, 08 Oct 2005 17:10:20 +0200Regularized Fixed-Point Iterations for Nonlinear Inverse Problems
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1653
In this paper we introduce a derivative-free, iterative method for solving nonlinear ill-posed problems \(Fx=y\), where instead of \(y\) noisy data \(y_\delta\) with \(|| y-y_\delta ||\leq \delta\) are given and \(F:D(F)\subseteq X \rightarrow Y\) is a nonlinear operator between Hilbert spaces \(X\) and \(Y\). This method is defined by splitting the operator \(F\) into a linear part \(A\) and a nonlinear part \(G\), such that \(F=A+G\). Then iterations are organized as \(A u_{k+1}=y_\delta-Gu_k\). In the context of ill-posed problems we consider the situation when \(A\) does not have a bounded inverse, thus each iteration needs to be regularized. Under some conditions on the operators \(A\) and \(G\) we study the behavior of the iteration error. We obtain its stability with respect to the iteration number \(k\) as well as the optimal convergence rate with respect to the noise level \(\delta\), provided that the solution satisfies a generalized source condition. As an example, we consider an inverse problem of initial temperature reconstruction for a nonlinear heat equation, where the nonlinearity appears due to radiation effects. The obtained iteration error in the numerical results has the theoretically expected behavior. The theoretical assumptions are illustrated by a computational experiment.S.S. Pereverzyev; R. Pinnau; N. Siedowpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1653Wed, 10 Aug 2005 17:10:20 +0200On the Multiscale Solution of Satellite Problems by Use of Locally Supported Kernel Functions Corresponding to Equidistributed Data on Spherical Orbits
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1117
Being interested in (rotation-)invariant pseudodi erential equations of satellite problems corresponding to spherical orbits, we are reasonably led to generating kernels that depend only on the spherical distance, i. e. in the language of modern constructive approximation form spherical radial basis functions. In this paper approximate identities generated by such (rotation-invariant) kernels which are additionally locally supported are investigated in detail from theoretical as well as numerical point of view. So-called spherical di erence wavelets are introduced. The wavelet transforms are evaluated by the use of a numerical integration rule, that is based on Weyl's law of equidistribution. This approximate formula is constructed such that it can cope with millions of (satellite) data. The approximation error is estimated on the orbital sphere. Finally, we apply the developed theory to the problems of satellite-to-satellite tracking (SST) and satellite gravity gradiometry (SGG).Willi Freeden; Kerstin Hessepreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1117Mon, 21 Aug 2000 00:00:00 +0200A discrepancy principle for Tikhonov regularization with approximately specified data
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/754
Many discrepancy principles are known for choosing the parameter \(\alpha\) in the regularized operator equation \((T^*T+ \alpha I)x_\alpha^\delta = T^*y^\delta\), \(||y-y^d||\leq \delta\), in order to approximate the minimal norm least-squares solution of the operator equation \(Tx=y\). In this paper we consider a class of discrepancy principles for choosing the regularization parameter when \(T^*T\) and \(T^*y^\delta\) are approximated by \(A_n\) and \(z_n^\delta\) respectively with \(A_n\) not necessarily self - adjoint. Thisprocedure generalizes the work of Engl and Neubauer (1985),and particular cases of the results are applicable to the regularized projection method as well as to a degenerate kernel method considered by Groetsch (1990).M. Thamban Nair; Eberhard Schockpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/754Mon, 03 Apr 2000 00:00:00 +0200Toying with Jordan matrices
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/788
It is shown that an important resolvent estimate is unstable under small perturbations.Eberhard Schockpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/788Mon, 03 Apr 2000 00:00:00 +0200Iterative Methods with Perturbations for Ill-Posed Problems
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/789
We consider regularizing iterative procedures for ill-possed problems with random and nonrandom additive errors. The rate of square-mean convergence for iterative procedures with random errors is studied. The comparison theorem is established for the convergence of procedures with and without additive errors.Eberhard Schock; A.Yu. Veretennikovpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/789Mon, 03 Apr 2000 00:00:00 +0200Brakhage's implicit iteration method and Information Complexity of equations with operators having closed range
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/828
An a posteriori stopping rule connected with monitoringthe norm of second residual is introduced forBrakhage's implicit nonstationary iteration method, applied to ill-posed problems involving linear operatorswith closed range. It is also shown that for someclasses of equations with such operators the algorithmconsisting in combination of Brakhage's method withsome new discretization scheme is order optimal in the sense of Information Complexity.Sergei V. Pereverzev; Eberhard Schockpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/828Mon, 03 Apr 2000 00:00:00 +0200