Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures (Q2266195): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0021-9045(84)90033-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062011358 / rank | |||
Normal rank | |||
Revision as of 19:56, 19 March 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
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
iterative Hilbert space techniques
0 references
Remez algorithm
0 references
