Arbitrary divergence speed of the least-squares method in infinite-dimensional inverse ill-posed problems
نویسندگان
چکیده
منابع مشابه
chain least squares method and ill-posed problems
the main purpose of this article is to increase the efficiency of the least squares method in numerical solution of ill-posed functional and physical equations. determining the least squares of a given function in an arbitrary set is often an ill-posed problem. in this article, by defining artificial constraint and using lagrange multipliers method, the attempt is to turn -dimensional least squ...
متن کاملIll-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملIll - posed inverse problems in economics
A parameter of an econometric model is identified if there is a one-to-one or many-to-one mapping from the population distribution of the available data to the parameter. Often, this mapping is obtained by inverting a mapping from the parameter to the population distribution. If the inverse mapping is discontinuous, then estimation of the parameter usually presents an illposed inverse problem. ...
متن کاملLearning, Regularization and Ill-Posed Inverse Problems
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal evidence neither that learning from examples could be seen as an inverse problem nor that theoretical results in learning theory could be independently derived using tools from regularization theory. In this paper we pro...
متن کاملHybrid Samplers for Ill-Posed Inverse Problems
In the Bayesian approach to ill-posed inverse problems, regularization is imposed by specifying a prior distribution on the parameters of interest and Markov chain Monte Carlo samplers are used to extract information about its posterior distribution. The aim of this paper is to investigate the convergence properties of the random-scan random-walk Metropolis (RSM) algorithm for posterior distrib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2006
ISSN: 0266-5611,1361-6420
DOI: 10.1088/0266-5611/22/2/014