Discrete mollification and automatic numerical differentiation (Q1129514)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Discrete mollification and automatic numerical differentiation |
scientific article; zbMATH DE number 1192721
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Discrete mollification and automatic numerical differentiation |
scientific article; zbMATH DE number 1192721 |
Statements
Discrete mollification and automatic numerical differentiation (English)
0 references
20 August 1998
0 references
Numerical differentiation is an unreliable procedure in the case of a function with noise. The authors continue the study of their proposal to remedy this by a mollification procedure. This is based on the idea of replacing the given function by a convolution product with a smooth function of a given type with small support. This leads to an automatic method for numerical differentiation based on discrete mollification. With data measured at a discrete set of points, the method allows the approximate recovery of the derivative function in all points of the interval. The authors prove rigorous error bounds and present several interesting numerical examples.
0 references
cross validation
0 references
numerical differentiation
0 references
convolution
0 references
discrete mollification
0 references
error bounds
0 references
numerical examples
0 references
0.99032843
0 references
0.9183488
0 references
0.9012244
0 references
0.8946047
0 references