An algorithm for the computation of strict approximations in subspaces of spline functions (Q796006): Difference between revisions
From MaRDI portal
Latest revision as of 13:22, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for the computation of strict approximations in subspaces of spline functions |
scientific article |
Statements
An algorithm for the computation of strict approximations in subspaces of spline functions (English)
0 references
1984
0 references
In this paper best Chebyshev approximations of continuous functions f from subspaces of spline functions \(S_{m-1,k}\) of degree m-1 with k fixed knots are studied. An algorithm is developed which computes strict approximations. The strict approximation is a unique best Chebyshev approximation for a problem defined on a finite set. This approximation can be considered as the ''best'' of the best approximations. Then a Remez type algorithm for an approximation problem defined on the interval I is defined. Sequences of strict approximations from \(S_{m-1,k}\) to a given function f on certain finite subsets of I are considered. These sequences converge to a best approximation of f from \(S_{m-1,k}\) on I if \(k\leq m\) and at least to a nearly best approximation on I if \(k>m\).
0 references
algorithm
0 references
strict approximations
0 references
unique best Chebyshev approximation
0 references