A higher order Weierstrass approximation theorem - a new proof

2004/01/21 by Andreas Wannebo, Wannebo, Andreas
Mathematics · #26D15 #35J #46E35 #Analysis of PDEs (math.AP) #FOS: Mathematics #Functional Analysis (math.FA) #math.AP #math.FA #msc:26D15 #msc:35J #msc:46E35

paper · pdf · doi:10.48550/arxiv.math/0401278

5 pp. Part of report TRITA-MAT-1998-47 Royal Inst. of Techn. Stockholm, Sweden

arxiv created 2004/01/21 · arxiv updated 2009/12/01

Abstract

An technically interesting proof of a known theorem.

Related

• Approximations to the Kruskal-Katona theorem
• Bernstein approximation and beyond: proofs by means of elementary probability theory
• Note on the Dirichlet Approximation Theorem
• A note on Kronecker's approximation theorem
• A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition