Optimal Filtering ' for some ill - posed problems 1
نویسنده
چکیده
We describe an approach to a class of ill-posed problems in which the determination of a ``lter' for obtaining approximate solutions is obtained by means of an optimization process. In Hilbert space settings a fairly explicit computation may be possible and this is presented. It is noted that, under certain conditions the resulting lter is, indeed, optimal in the sense of realizing a minimal uniform error bound.
منابع مشابه
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.
متن کاملA regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method
The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...
متن کاملAn Optimal Multi-Vector Iterative Algorithm in a Krylov Subspace for Solving the Ill-Posed Linear Inverse Problems
An optimal m-vector descent iterative algorithm in a Krylov subspace is developed, of which the m weighting parameters are optimized from a properly defined objective function to accelerate the convergence rate in solving an ill-posed linear problem. The optimal multi-vector iterative algorithm (OMVIA) is convergent fast and accurate, which is verified by numerical tests of several linear inver...
متن کاملNumerical methods for optimal experimental design of large-scale ill-posed problems
Experimental design for over-determined problems is a well studied topic where different criteria and optimization algorithms are explored. For ill-posed problems experimental design is rather new. In this paper we discuss optimal experimental design for ill-posed problems and suggest a numerical framework to efficiently achieve such a design. We demonstrate the effectiveness of our algorithm a...
متن کاملOptimal Regularization for Ill-Posed Problems in Metric Spaces
We present a strategy for choosing the regularization parameter (Lepskij-type balancing principle) for ill-posed problems in metric spaces with deterministic or stochastic noise. Additionally we improve the strategy in comparison to the previously used version for Hilbert spaces in some ways. AMS-Classification: 47A52, 65J22, 49J35, 93E25
متن کامل