Future Polynomial Regularization of Ill-Posed Volterra Equations (Q4943650)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1416876
Language Label Description Also known as
default for all languages
No label defined
    English
    Future Polynomial Regularization of Ill-Posed Volterra Equations
    scientific article; zbMATH DE number 1416876

      Statements

      Future Polynomial Regularization of Ill-Posed Volterra Equations (English)
      0 references
      0 references
      0 references
      19 March 2000
      0 references
      first-kind Volterra equations
      0 references
      inverse problems
      0 references
      regularization
      0 references
      collocation method
      0 references
      Toeplitz matrix
      0 references
      ill-posed problem
      0 references
      convergence
      0 references
      future polynomial regularization method
      0 references
      numerical results
      0 references
      linear integral equations
      0 references
      The authors propose a discrete method for regularizing ill-posed Volterra problems associated to linear integral equations of the first kind. Unlike the classical regularization technique of Tikhonov, this method preserves the Volterra (causal) nature of the problem allowing the regularized solution to be produced sequentially in near real time as data arrived. Convergence of the regularized solution to the true solution is proved at the best possible rate with respect to error in the data. More precisely, the authors use the ``future polynomial regularization method'' that can be applied provided that the operator may be discretized by a lower-triangular matrix of Toeplitz type. The method is based on a local regularization strategy and works for linear equations. Numerical results are given and comparisons with classical methods are discussed.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references