A mollification framework for improperly posed problems (Q1377030)

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 1111589
Language Label Description Also known as
default for all languages
No label defined
    English
    A mollification framework for improperly posed problems
    scientific article; zbMATH DE number 1111589

      Statements

      A mollification framework for improperly posed problems (English)
      0 references
      1 February 1998
      0 references
      Let \(A\) represent a linear, translation-invariant operator between given Hilbert spaces for which the range is not dense. A general theory for the mollification of the improperly posed equation \(Au=f\) is developed utilizing the classical theory of semi-groups. The choice of the mollifier is fairly general and includes B-splines as well as the classical Gaussians. A translation-operator representation for the error associated with the application of mollification is derived and an error estimate for the mollification method as applied to the numerical solution of translation-invariant operator equation is given. Then the connection is analyzed between the degree of the mollification and the size of the discretization necessary to guarantee the boundedness of the amplification error. The results are applied to the construction of finite difference formulas for the inversion of translation-invariant operator equations and their use in connection with the numerical differentiation and half-differentiation of observational data.
      0 references
      ill-posed problems
      0 references
      mollification
      0 references
      Hilbert spaces
      0 references
      translation-invariant operator equations
      0 references
      numerical differentiation
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references