Discrete, nonlinear approximation problems in polyhedral norms

1977 ◽  
Vol 28 (2) ◽  
pp. 143-156 ◽  
Author(s):  
D. H. Anderson ◽  
M. R. Osborne
1977 ◽  
Vol 28 (2) ◽  
pp. 157-170 ◽  
Author(s):  
D. H. Anderson ◽  
M. R. Osborne

Author(s):  
Marek A. Kowalski ◽  
Krzystof A. Sikorski ◽  
Frank Stenger

In this chapter we outline a theory of optimal computational methods for general, nonlinear approximation problems. We define the notions of optimal algorithms and information, and we analyze the classes of parallel and sequential methods. We put special emphasis on linear problems as well as linear and spline algorithms. Several relationships between optimal methods and n-widths and s-numbers are also exhibited.


1976 ◽  
Vol 26 (2) ◽  
pp. 179-189 ◽  
Author(s):  
D. H. Anderson ◽  
M. R. Osborne

Author(s):  
I. Daubechies ◽  
R. DeVore ◽  
S. Foucart ◽  
B. Hanin ◽  
G. Petrova

Sign in / Sign up

Export Citation Format

Share Document