Approximation of norms

DOI10.1016/0021-9045(70)90050-XzbMath0197.38602MaRDI QIDQ2540141

Jaak Peetre

Publication date: 1970

Published in: Journal of Approximation Theory (Search for Journal in Brave)

zbMATH Keywords

functional analysis

Related Items (13)

A Richardson-type iterative approach for identification of delamination boundaries ⋮ Convergence of the truncation error in calculating singular convolutions ⋮ A comparison of uniform and discrete polynomial approximation ⋮ On the convergence of Polya's algorithm ⋮ Deviation of best discrete and uniform polynomial approximants ⋮ Rate of convergence of the discrete Pólya algorithm ⋮ Best approximation of unbounded by bounded operators, and allied problems ⋮ A note on discrete Čebysev approximation ⋮ Perturbations of best approximation problems ⋮ Best L//1-approximation on finite point sets: Rate of convergence ⋮ Variation of the norms in the problem of best approximation ⋮ Strong solvability in Orlicz spaces ⋮ Discretization for uniform polynomial approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolation in polynomial classes and Markoff's inequality
• Best approximation with respect to nearby norms
• Uniqueness of Hahn-Banach Extensions and Unique Best Approximation
• Limit properties of ordered families of linear metric spaces
• On the Moments of Functions Satisfying a Lipschitz Condition.
• The Existence and Unicity of Best Approximations.
• What is the Laplace Transform?

This page was built for publication: Approximation of norms