Results 1  10
of
22
Stable numerical differentiation: when is it possible
 Jour. Korean SIAM
"... Abstract. Two principally different statements of the problem of stable numerical differentiation are considered. It is analyzed when it is possible in principle to get a stable approximation to the derivative f ′ given noisy data fδ. Computational aspects of the problem are discussed and illustrate ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
(Show Context)
Abstract. Two principally different statements of the problem of stable numerical differentiation are considered. It is analyzed when it is possible in principle to get a stable approximation to the derivative f ′ given noisy data fδ. Computational aspects of the problem are discussed and illustrated by examples. These examples show the practical value of the new understanding of the problem of stable differentiation. 1.
Inversion of the Laplace transform from the real axis using an adaptive iterative method
"... ..."
(Show Context)
Dynamical systems method for . . .
, 2004
"... Consider an operator equation F (u) = 0 in a real Hilbert space. The problem of solving this equation is illposed if the operator F ′ (u) is not boundedly invertible, and wellposed otherwise. A general method, dynamical systems method (DSM) for solving linear and nonlinear illposed problems in a ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Consider an operator equation F (u) = 0 in a real Hilbert space. The problem of solving this equation is illposed if the operator F ′ (u) is not boundedly invertible, and wellposed otherwise. A general method, dynamical systems method (DSM) for solving linear and nonlinear illposed problems in a Hilbert space is presented. This method consists of the construction of a nonlinear dynamical system, that is, a Cauchy problem, which has the following properties: 1) it has a global solution, 2) this solution tends to a limit as time tends to infinity, 3) the limit solves the original linear or nonlinear problem. New convergence and discretization theorems are obtained. Examples of the applications of this approach are given. The method works for a wide range of wellposed problems as well.
On stable numerical differentiation
 Australian J. Math. Anal. Appl
"... ABSTRACT. Based on a regularized Volterra equation, two different approaches for numerical differentiation are considered. The first approach consists of solving a regularized Volterra equation while the second approach is based on solving a disretized version of the regularized Volterra equation. N ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
ABSTRACT. Based on a regularized Volterra equation, two different approaches for numerical differentiation are considered. The first approach consists of solving a regularized Volterra equation while the second approach is based on solving a disretized version of the regularized Volterra equation. Numerical experiments show that these methods are efficient and compete favorably with the variational regularization method for stable calculating the derivatives of noisy functions. Key words and phrases: illposed problems, numerical differentiation.
Inequalities for the derivatives and stable differentiation of piecewisesmooth discontinuous functions
, 2005
"... ..."
On deconvolution methods
, 2003
"... Several methods for solving efficiently the onedimensional deconvolution problem are proposed. The problem is to solve the Volterra equation ku:=R t 0 k(t \Gamma s)u(s)ds = g(t); 0 ^ t ^ T. The data, g(t), are noisy. Of special practical interest is the case when the data are noisy and known at a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Several methods for solving efficiently the onedimensional deconvolution problem are proposed. The problem is to solve the Volterra equation ku:=R t 0 k(t \Gamma s)u(s)ds = g(t); 0 ^ t ^ T. The data, g(t), are noisy. Of special practical interest is the case when the data are noisy and known at a discrete set of times. A general approach to the deconvolution problem is proposed: represent k = A(I + S), where a method for a stable inversion of A is known, S is a compact operator, and I + S is injective. This method is illustrated by examples: smooth kernels k(t), and weakly singular kernels, corresponding to Abeltype of integral equations, are considered. A recursive estimation scheme for solving deconvolution problem with noisy discrete data is justified mathematically, its convergence is proved, and error estimates are obtained for the proposed deconvolution method.
An essay on some problems of approximation theory
, 2005
"... Several questions of approximation theory are discussed: 1) can one approximate stably in L1 norm f 0 given approximation fffi, k fffif kL1 < ffi, of an unknown smooth function f (x), such that k f 0(x) kL1< = m1? ..."
Abstract
 Add to MetaCart
Several questions of approximation theory are discussed: 1) can one approximate stably in L1 norm f 0 given approximation fffi, k fffif kL1 < ffi, of an unknown smooth function f (x), such that k f 0(x) kL1< = m1?