A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data (Q3006132)

From MaRDI portal
Revision as of 09:25, 26 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data
scientific article

    Statements

    A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data (English)
    0 references
    0 references
    0 references
    10 June 2011
    0 references
    minimax approximation
    0 references
    piecewise linear representations
    0 references
    Remez algorithm
    0 references
    parameter estimation
    0 references
    numerical examples
    0 references

    Identifiers