A simple method for smoothing functions and compressing Hermite data (Q1776155): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:38, 5 March 2024

scientific article
Language Label Description Also known as
English
A simple method for smoothing functions and compressing Hermite data
scientific article

    Statements

    A simple method for smoothing functions and compressing Hermite data (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2005
    0 references
    Consider a function \(f:[a,b] \to \mathbb R\) and a grid \(a = x_0 < x_1 < \cdots < x_n = b\). Assume that \(f \in C^k[x_i, x_{i+1}]\) for all \(i\) but \(f\) is only \(k_i\) times differentiable at the break point \(x_i\) (where \(k_i < k\)). The goal of the paper is to construct a function \(f_k \in C^k[a,b]\) that approximates \(f\), thus smoothing \(f\) at the points \(x_i\). This is achieved by a method based on a small modification of the concept of Bernstein polynomials. As an application, interpolatory splines in the Hermite sense can be computed in a recursive way, leading to a concept closely related to a multiresolution analysis. This allows to perform a data compression.
    0 references
    0 references
    smoothing of functions
    0 references
    Hermite interpolation
    0 references
    data compression
    0 references
    interpolatory splines
    0 references
    multiresolution analysis
    0 references

    Identifiers

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