Stable Lagrangian numerical differentiation with the highest order of approximation (Q854647)

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 5077569
Language Label Description Also known as
default for all languages
No label defined
    English
    Stable Lagrangian numerical differentiation with the highest order of approximation
    scientific article; zbMATH DE number 5077569

      Statements

      Stable Lagrangian numerical differentiation with the highest order of approximation (English)
      0 references
      0 references
      0 references
      6 December 2006
      0 references
      Some asymptotic representations for the truncation error for the Lagrangian numerical differentiation are presented, when the ratio of the distance between each interpolation node and the differential point to step-parameter \(n\) is known. Furthermore, if the sampled values of the function at these interpolation nodes have perturbations which are bounded by \(\varepsilon\), a method for determining step-parameter \(h\) by means of perturbation bound \(\varepsilon\) and order \(n\) of interpolation is provided to saturate the order of approximation. All the investigations in this paper can be generalized to the set of quasi-uniform nodes.
      0 references
      Lagrangian numerical differentiation
      0 references
      truncation error
      0 references
      stability saturation approximation
      0 references
      superconvergence
      0 references
      interpolation
      0 references

      Identifiers