Nearby linear Chebyshev approximation under constraints (Q797073): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0021-9045(84)90035-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044389967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform approximation with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearby linear Chebyshev approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Best Monotone Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation with Convex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081748 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:41, 14 June 2024

scientific article
Language Label Description Also known as
English
Nearby linear Chebyshev approximation under constraints
scientific article

    Statements

    Nearby linear Chebyshev approximation under constraints (English)
    0 references
    0 references
    1984
    0 references
    It is shown that if f is near g, the linear family L is near the linear family L', the domain X is near the domain Y, and the constraint set C is near the constraint set C', a best Chebyshev approximation to f from L on X under the constraints C is near a best Chebyshev approximation to g from L' on Y, under the constraints C'.
    0 references
    best Chebyshev approximation
    0 references
    constraints
    0 references

    Identifiers