✦ LIBER ✦

Discrete, linear approximation problems in polyhedral norms

✍ Scribed by D. H. Anderson; M. R. Osborne

Publisher: Springer-Verlag
Year: 1976
Tongue: English
Weight: 461 KB
Volume: 26
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01395971

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Discrete, nonlinear approximation proble

Discrete, nonlinear approximation problems in polyhedral norms

✍ D. H. Anderson; M. R. Osborne 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 608 KB

Discrete, nonlinear approximation proble

Discrete, nonlinear approximation problems in polyhedral norms

✍ D. H. Anderson; M. R. Osborne 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 612 KB

Linear best approximation using a class

Linear best approximation using a class of polyhedral norms

✍ G. A. Watson 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 601 KB

An interval programming algorithm for di

An interval programming algorithm for discrete linear L1 approximation problems

✍ P.D Robers; A Ben-Israel 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 614 KB

A discrete characterization theorem for

A discrete characterization theorem for the discrete L1 linear approximation problem

✍ M.J.D Powell; F.D.K Roberts 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Best Interpolatory Approximation in Norm

Best Interpolatory Approximation in Normed Linear Spaces

✍ Frank Deutsch; Sizwe Mabizela 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 542 KB

A theory of best approximation with interpolatory contraints from a finitedimensional subspace M of a normed linear space X is developed. In particular, to each x # X, best approximations are sought from a subset M(x) of M which depends on the element x being approximated. It is shown that this ``pa