The minimal radius of Galerkin information for severely ill-posed problems

被引:11
作者
Solodky, Sergei G. [1 ]
Myleiko, Ganna L. [1 ]
机构
[1] Natl Acad Sci Ukraine, Inst Math, UA-01601 Kiev, Ukraine
来源
JOURNAL OF INVERSE AND ILL-POSED PROBLEMS | 2014年 / 22卷 / 05期
关键词
Minimal radius; Galerkin information; severely ill-posed problems; error estimate; COMPLEXITY;
D O I
10.1515/jip-2013-0035
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the present paper minimization problems of the information costs for numerical solving severely ill-posed problems are studied. A projection scheme of discretization which is economical in a sense of used harmonics is presented. By means of this scheme the order estimate of the minimal radius of Galerkin information is computed.
引用
收藏
页码:739 / 757
页数:19
相关论文
共 11 条
[1]   Discretization strategy for linear ill-posed problems in variable Hilbert scales [J].
Mathé, P ;
Pereverzev, SV .
INVERSE PROBLEMS, 2003, 19 (06) :1263-1277
[2]   Moduli of continuity for operator valued functions [J].
Mathé, P ;
Pereverzev, SV .
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2002, 23 (5-6) :623-631
[3]   The minimal radius of Galerkin information for the Fredholm problem of the first kind [J].
Pereverzev, SV ;
Solodky, SG .
JOURNAL OF COMPLEXITY, 1996, 12 (04) :401-415
[4]   ON THE REGULARIZATION OF PROJECTION METHODS FOR SOLVING ILL-POSED PROBLEMS [J].
PLATO, R ;
VAINIKKO, G .
NUMERISCHE MATHEMATIK, 1990, 57 (01) :63-79
[5]  
Solodky S. G., 1999, ZH VYCH MAT MAT FIZ, V12, P195
[6]   The optimal approximations for solving linear ill-posed problems [J].
Solodky, SG .
JOURNAL OF COMPLEXITY, 2001, 17 (01) :98-116
[7]   Optimality for ill-posed problems under general source conditions [J].
Tautenhahn, U .
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 1998, 19 (3-4) :377-398
[8]  
Traub J. F., 1988, INFORM BASED COMPLEX
[9]  
Traub J.F., 1980, A General Theory of Optimal Algorithms
[10]   WHAT IS THE COMPLEXITY OF ILL-POSED PROBLEMS [J].
WERSCHULZ, AG .
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 1987, 9 (9-10) :945-967