Complexity of Linear Problems with a Fixed Output Basis

Journal of Complexity

Volumn 16, Issue 1, 2000, Pages 333-362

  Novak, Erich ^a   Woźniakowski, Henryk ^b  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346487303     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1999.0538     Document Type: Article

References (23)

1. Bakhvalov N. S. On the optimality of linear methods for operator approximation in convex classes of functions. USSR Comput. Maths. Math. Phys. 11:1971;244-249.
2. Blum L., Shub M., Smale S. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. 21:1989;1-46.
3. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer-Verlag, New York.
4. Dahlke S., Dahmen W., DeVore R. A. Nonlinear approximation and adaptive techniques for solving elliptic operator equations. Dahmen W., Kurdila A. J., Oswald P. Multiscale Wavelet Methods for PDEs. 1997;237-283 Academic Press, San Diego.
5. Dahmen W. Wavelet and multiscale methods for operator equations. Acta Numer. 6:1997;55-228.
6. DeVore R. A. Nonlinear approximation. Acta Numer. 7:1998;51-150.
7. D'yakonov E. G. Optimization in Solving Elliptic Problems. 1996;CRC Press, Boca Raton.
8. Feller W. An Introduction to Probability Theory and Its Applications. 1957;Wiley, New York.
9. Gal S., Micchelli C. A. Optimal sequential and non-sequential procedures for evaluating a functional. Appl. Anal. 10:1980;105-120.
10. Hackbusch W. Multi-grid Methods and Applications. 1985;Springer-Verlag, New York.
11. Hertling P. Topological complexity with continuous operations. J. Complexity. 12:1996;315-338.
12. Mathé P. s-Numbers in information-based complexity. J. Complexity. 6:1990;41-66.
13. Novak E. The real number model in numerical analysis. J. Complexity. 11:1995;57-73.
14. Novak E. On the power of adaption. J. Complexity. 12:1996;199-237.
15. Novak E., Woźniakowski H. Topological complexity of zero finding. J. Complexity. 12:1996;380-400.
16. Novak E., Woźniakowski H. On the cost of uniform and nonuniform algorithms. Theoret. Comput. Sci. 219:1999;301-318.
17. Smale S. On the topology of algorithms. J. Complexity. 3:1987;81-89.
18. Traub J. F., Woźniakowski H. A General Theory of Optimal Algorithms. 1980;Academic Press, New York.
19. Traub J. F., Wasilkowski G. W., Woźniakowski H. Information-Based Complexity. 1988;Academic Press, Boston.
20. Traub J. F., Werschulz A. G. Complexity and Information. 1998;Cambridge Univ. Press, Cambridge.
21. Vassiliev V. A. Topological complexity of root-finding algorithms. Renegar J., Shub M., Smale S. The Mathematics of Numerical Analysis. Lectures in Applied Mathematics. 32:1996;831-856 Amer. Math. Soc. Providence.
22. Werschulz A. G., Woźniakowski H. Are linear algorithms always good for linear problems? Aequationes Math. 31:1986;202-212.
23. Woźniakowski H. Why does information-based complexity use the real number model? Theoret. Comput. Sci. 219:1999;451-465.