TITLE

# CONVERGENCE RATES FOR LAVRENTIEV-TYPE REGULARIZATION IN HILBERT SCALES

AUTHOR(S)
Nair, M. T.; Tautenhahn, U.
PUB. DATE
July 2008
SOURCE
Computational Methods in Applied Mathematics;2008, Vol. 8 Issue 3, p279
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
For solving linear ill-posed problems with noisy data regularization methods are required. We analyze a simplified regularization scheme in Hilbert scales for operator equations with nonnegative self-adjoint operators. By exploiting the operator monotonicity of certain functions, order-optimal error bounds are derived that characterize the accuracy of the regularized approximations. These error bounds have been obtained under general smoothness conditions.
ACCESSION #
34999307

## Related Articles

• Broken Sobolev space iteration for total variation regularized minimization problems. BARTELS, SÖREN // IMA Journal of Numerical Analysis;Apr2016, Vol. 36 Issue 2, p493

We devise an improved iterative scheme for the numerical solution of total variation regularized minimization problems. The numerical method realizes a primal-dual iteration with discrete metrics that allow for large step sizes.

• On L1 convergence of certain cosine sums with twice quasi semi-convex coefficients. Braha, N. L. // Applied Sciences;2010, Vol. 12, p30

In this paper a criterion for L1-convergence of a certain co- sine sums with twice quasi semi-convex coeffcients is obtained. Also a necessary and suffcient condition for L1-convergence of the cosine series is deduced as a corollary.

• On Î›-strong convergence of numerical sequences revisited. Kórus, P. // Acta Mathematica Hungarica;Feb2016, Vol. 148 Issue 1, p222

We remark the incorrectness of some recent results concerning Î›-strong convergence. We give a new appropriate definition for the Î›-strong convergence by generalizing the original Î›-strong convergence concept given by F. MÃ³ricz.

• A Lobatto interpolation grid over the triangle. BLYTH, M. G.; POZRIKIDIS, C. // IMA Journal of Applied Mathematics;Feb2006, Vol. 71 Issue 1, p153

A sequence of increasingly refined interpolation grids over the triangle is proposed, with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The number of interpolation nodes, N, corresponds to a complete mth-order polynomial expansion with respect to the...

• A new trust region method for nonlinear equations. Ju-liang Zhang, Hong K.; Yong Wang // Mathematical Methods of Operations Research;2003, Vol. 58 Issue 2, p283

In this paper, a new trust region method for the system of non-linear equations is presented in which the determining of the trust region radius incorporates the information of its natural residual. The global convergence is obtained under mild conditions. Unlike traditional trust region method,...

• ON THE CONVERGENCE OF WAVEFORM RELAXATION METHODS FOR LINEAR INITIAL VALUE PROBLEMS. Jian-yu Pan; Zhong-zhi Bai // Journal of Computational Mathematics;Sep2004, Vol. 22 Issue 5, p681

We study a class of blockwise waveform relaxation methods, and investigate its convergence properties in both asymptotic and monotone senses. In addition, the monotone convergence rates between different pointwise/blockwise waveform relaxation methods resulted from different matrix splittings,...

• Precise Asymptotics in the Law of the Iterated Logarithm of Moving-Average Processes. Yun Xia Li; Li Xin Zhang // Acta Mathematica Sinica;Feb2006, Vol. 22 Issue 1, p143

In this paper, we discuss the moving-average process $$X_{k} = {\sum\nolimits_{i = - \infty }^\infty {\alpha _{{i + k}} \varepsilon _{i} } }$$ , where {Î± i ;-âˆž < i < âˆž} is a doubly infinite sequence of identically distributed Ï†-mixing or negatively associated random variables...

• Convergence of de Boor's algorithm for the generation of equidistributing meshes. XU, X.; HUANG, W.; RUSSELL, R. D.; WILLIAMS, J. F. // IMA Journal of Numerical Analysis;Apr2011, Vol. 31 Issue 2, p580

A commonly used algorithm for generating adaptive meshes for a given adaptation function in one dimension is due to de Boor. In its original form the algorithm produces a sequence of meshes upon using piecewise constant interpolation for the adaptation function on the current mesh and generating...

• A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods. Xiao-Ming Yuan // Journal of Global Optimization;Apr2008, Vol. 40 Issue 4, p529

AbstractÃ‚Â Ã‚Â To solve nonlinear complementarity problems, the inexact logarithmic-quadratic proximal (LQP) method solves a system of nonlinear equations (LQP system) approximately at each iteration. Therefore, the efficiencies of inexact-type LQP methods depend greatly on the...

Share