ENErich Novak
Erich Novak
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Erich Novak has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Henryk Woźniakowski
Department of Computer Science Columbia University 10027 New York NY USA
12 shared publications - Ian H. Sloan
School of Mathematics and Statistics, UNSW Sydney, Sydney, Australia
8 shared publications - Joseph F. Traub
Columbia University
6 shared publications - Stefan Heinrich
University of Kaiserslautern
3 shared publications - Aicke Hinrichs2 shared publications
Andreas Neuenkirch
1 shared publication
Latest Publications
- 1 July 2014
- Published by Elsevier in Journal of Approximation Theory
- Vol. 183, 31-44
On weak tractability of the Clenshaw–Curtis Smolyak algorithm
- 1 July 2014
- Published by Elsevier in Journal of Approximation Theory
- Vol. 183, 31-44
On weak tractability of the Clenshaw–Curtis Smolyak algorithm
- 1 June 2014
- Published by Elsevier in Journal of Complexity
- Vol. 30 (3)
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award
- 1 June 2014
- Published by Elsevier in Journal of Complexity
- Vol. 30 (3)
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award
- 1 April 2014
- Published by Elsevier in Journal of Complexity
- Vol. 30 (2) , 1
Guest Editors’ Preface
- 1 February 2014
- Published by Elsevier in Journal of Complexity
- Vol. 30 (1)
Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award
- 1 February 2014
- Published by Elsevier in Journal of Complexity
- Vol. 30 (1)
Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award
- 30 April 2013
- Published by Elsevier in Journal of Complexity
- Vol. 29 (2) , 141
Dmitriy Bilyk, Lutz Kämmerer, Stefan Kunis, Daniel Potts, Volodya Temlyakov and Rui Yu share the 2012 Best Paper Award
- 30 April 2013
- Published by Elsevier in Journal of Complexity
- Vol. 29 (2) , 141
Dmitriy Bilyk, Lutz Kämmerer, Stefan Kunis, Daniel Potts, Volodya Temlyakov and Rui Yu share the 2012 Best Paper Award
- 1 October 2012
- Published by Elsevier in Journal of Complexity
- Vol. 28 (5) , 519
Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award
- 1 October 2012
- Published by Elsevier in Journal of Complexity
- Vol. 28 (5) , 519
Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award
- 31 December 2011
- Published by Elsevier in Journal of Complexity
- Vol. 27 (6) , 501
Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award
- 31 December 2011
- Published by Elsevier in Journal of Complexity
- Vol. 27 (6) , 501
Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award
- Open Access
On the power of function values for the approximation problem in various settings
This is an expository paper on approximating functions from general Hilbert or Banach spaces in the worst case, average case and randomized settings with error measured in the $L_p$ sense. We define the power function as the ratio between the best rate of convergence of algorithms that use function values over the best rate of convergence of algorithms that use arbitrary linear functionals for a worst possible Hilbert or Banach space for which the problem of approximating functions is well defined. Obviously, the power function takes values at most one. If these values are one or close to one than the power of function values is the same or almost the same as the power of arbitrary linear functionals. We summarize and supply a few new estimates on the power function. We also indicate eight open problems related to the power function since this function has not yet been studied for many cases. We believe that the open problems will be of interest to a general audience of mathematicians.Open AccessOn the power of function values for the approximation problem in various settings
This is an expository paper on approximating functions from general Hilbert or Banach spaces in the worst case, average case and randomized settings with error measured in the $L_p$ sense. We define the power function as the ratio between the best rate of convergence of algorithms that use function values over the best rate of convergence of algorithms that use arbitrary linear functionals for a worst possible Hilbert or Banach space for which the problem of approximating functions is well defined. Obviously, the power function takes values at most one. If these values are one or close to one than the power of function values is the same or almost the same as the power of arbitrary linear functionals. We summarize and supply a few new estimates on the power function. We also indicate eight open problems related to the power function since this function has not yet been studied for many cases. We believe that the open problems will be of interest to a general audience of mathematicians. - 1 August 2010
- Published by Elsevier in Journal of Complexity
- Vol. 26 (4) , 335
Frank Aurzada, Steffen Dereich, Michael Scheutzow, and Christian Vormoor win the 2009 best paper award
- 1 August 2010
- Published by Elsevier in Journal of Complexity
- Vol. 26 (4) , 335
Frank Aurzada, Steffen Dereich, Michael Scheutzow, and Christian Vormoor win the 2009 best paper award
- 1 December 2009
- Published by Elsevier in Journal of Complexity
- Vol. 25 (6) , 510
Changes to the Editorial Board
- 1 December 2009
- Published by Elsevier in Journal of Complexity
- Vol. 25 (6) , 510
Changes to the Editorial Board