A comparison of uniform and discrete polynomial approximation (Q1136010): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5543516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3506242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3260666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brauer-Manin Obstruction and III[2] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some theorems on Cebysev approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least pth Power Polynomials on a Finite Point Set / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02079348 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2323728092 / rank
 
Normal rank

Latest revision as of 10:06, 30 July 2024

scientific article
Language Label Description Also known as
English
A comparison of uniform and discrete polynomial approximation
scientific article

    Statements

    A comparison of uniform and discrete polynomial approximation (English)
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete polynomial approximation
    0 references
    uniform approximation
    0 references
    0 references