Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures (Q2266195): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Remez Exchange Algorithm for Approximation With Linear Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex \(L^ p\) approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Moment Problem in L 1 Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of nearest points in the \(L^ p\), p even, and \(L^ \infty\) norms. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722348 / rank
 
Normal rank

Latest revision as of 17:07, 14 June 2024

scientific article
Language Label Description Also known as
English
Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures
scientific article

    Statements

    Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures (English)
    0 references
    0 references
    0 references
    1984
    0 references
    In this note it is indicated that the problem of best approximation with respect to the supremum \((L^{\infty})\) norm may be solvable by iterative Hilbert space techniques. The validity of this approach for \(L^ p\), p (even) \(<\infty\), has been established by \textit{L. A. Karlovitz} [ibid. 3, 123-127 (1970; Zbl 0222.41016)]. In the Haar case \((L^{\infty}\) norm) this approach yields a convergent algorithm which is a slight modification of the Remez algorithm.
    0 references
    0 references
    iterative Hilbert space techniques
    0 references
    Remez algorithm
    0 references
    0 references