TITLE

M. A. Krasnosel'skii Theorem and Iterative Methods for Solving Ill-Posed Linear Problems with a Self-Adjoint Operator

AUTHOR(S)
Matysik, Oleg; Zabreiko, Petr
PUB. DATE
July 2015
SOURCE
Computational Methods in Applied Mathematics;Jul2015, Vol. 15 Issue 3, p373
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
No abstract available.
ACCESSION #
103639324

 

Related Articles

  • On a theorem of M. A. Krasnoselski. Lyashko, S.; Semenov, V. // Cybernetics & Systems Analysis;Nov2010, Vol. 46 Issue 6, p1021 

    solvability criterion is proved for a second-kind operator equation with a correct endomorphism of Hausdorff barrelled spaces. The resultant assertion is a generalization of the theorem of M. A. Krasnoselski on the convergence of the Picard iteration method for solving equations with...

  • CONVERGENCE RATES FOR LAVRENTIEV-TYPE REGULARIZATION IN HILBERT SCALES. Nair, M. T.; Tautenhahn, U. // Computational Methods in Applied Mathematics;2008, Vol. 8 Issue 3, p279 

    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...

  • ON THE ANALOG OF THE MONOTONE ERROR RULE FOR PARAMETER CHOICE IN THE (ITERATED) LAVRENTIEV REGULARIZATION. Hämarik, U.; Raus, T.; Palm, R. // Computational Methods in Applied Mathematics;2008, Vol. 8 Issue 3, p237 

    We consider linear ill-posed problems in Hilbert spaces with a noisy right hand side and a given noise level. To solve non-self-adjoint problems by the (iterated) Tikhonov method, one effective rule for choosing the regularization parameter is the monotone error rule (Tautenhahn&Hämarik,...

  • A Preconditioned Minimal Residual Solver for a Class of Linear Operator Equations. Awono, O.; Tagoudjeu, J. // Computational Methods in Applied Mathematics;2010, Vol. 10 Issue 2, p119 

    We consider the class of linear operator equations with operators admitting self-adjoint positive definite and m-accretive splitting (SAS). This splitting leads to an ADI-like iterative method which is equivalent to a fixed point problem where the operator is a 2 by 2 matrix of operators. An...

  • On convergence rates for the Iteratively regularized Gauss-Newton method. BLASCHKE, BARBARA; NEUBAUER, ANDREAS; SCHERZER, OTMAR // IMA Journal of Numerical Analysis;1997, Vol. 17 Issue 3, p421 

    In this paper we prove that the iteratively regularized Gauss-Newton method is a locally convergent method for solving nonlinear ill-posed problems, provided the nonlinear operator satisfies a certain smoothness condition. For perturbed data we propose a priori and a posteriori stopping niles...

  • Nonlinear implicit iterative method for solving nonlinear ill-posed problems. Jian-jun Liu; He, Guo-qiang; Chuan-gang Kang // Applied Mathematics & Mechanics;Sep2009, Vol. 30 Issue 9, p1183 

    In the paper, we extend the implicit iterative method for linear ill-posed operator equations to solve nonlinear ill-posed problems. We show that under some conditions the error sequence of solutions of the nonlinear implicit iterative method is monotonically decreasing and, with this...

  • An alternating method for Cauchy problems for Helmholtz-type operators in non-homogeneous medium. JOHANSSON, B. TOMAS; KOZLOV, VLADIMIR A. // IMA Journal of Applied Mathematics;Feb2009, Vol. 74 Issue 1, p62 

    Kozlov & Maz'ya (1989, Algebra Anal., 1, 144–170) proposed an alternating iterative method for solving Cauchy problems for general strongly elliptic and formally self-adjoint systems. However, in many applied problems, operators appear that do not satisfy these requirements, e.g....

  • A SOR Acceleration of Self-Adjoint and m-Accretive Splitting Iterative Solver for 2-D Neutron Transport Equation. Taik, A.; Awono, O.; Tagoudjeu, J. // Mathematical Modelling of Natural Phenomena;Dec2010, Vol. 5 Issue 7, p60 

    We present an iterative method based on an infinite dimensional adaptation of the successive overrelaxation (SOR) algorithm for solving the 2-D neutron transport equation. In a wide range of application, the neutron transport operator admits a Self-Adjoint and m-Accretive Splitting (SAS). This...

  • An inexact primal—dual path following algorithm for convex quadratic SDP. Kim-Chuan Toh // Mathematical Programming;Mar2008, Vol. 112 Issue 1, p221 

    We propose primal–dual path-following Mehrotra-type predictor–corrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: $$\min_{X} \{\frac{1}{2} X\bullet \mathcal{Q}(X) + C\bullet X : \mathcal{A} (X) = b, X\succeq 0\}$$ , where...

  • An Optimally Generalized Steepest-Descent Algorithm for Solving Ill-Posed Linear Systems. Chein-Shan Liu // Journal of Applied Mathematics;2013, p1 

    It is known that the steepest-descent method converges normally at the first few iterations, and then it slows down. We modify the original steplength and descent direction by an optimization argument with the new steplength as being a merit function to be maximized. An optimal iterative...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics