Arthur G. Werschulz

According to our database1, Arthur G. Werschulz authored at least 32 papers between 1979 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Tractability of multivariate approximation over weighted standard Sobolev spaces.
J. Complex., 2019

2017
A new characterization of (s, t)-weak tractability.
J. Complex., 2017

2015
Tight Tractability Results for a Model Second-Order Neumann Problem.
Found. Comput. Math., 2015

2009
Information-based Complexity and Information-based Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: The relation to the L<sub>2</sub>-approximation.
J. Complex., 2009

2007
Tractability of quasilinear problems II: Second-order elliptic problems.
Math. Comput., 2007

A note on the complexity and tractability of the heat equation.
J. Complex., 2007

Tractability of quasilinear problems I: General results.
J. Approx. Theory, 2007

2003
Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
J. Complex., 2003

2002
What Is the Complexity of Volume Calculation?
J. Complex., 2002

2001
What Is the Complexity of Surface Integration?
J. Complex., 2001

ANNOUNCEMENT: 2001 Best Paper Award Committee.
J. Complex., 2001

2000
What Is the Complexity of Stieltjes Integration?
J. Complex., 2000

1999
Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems?
J. Complex., 1999

1998
Complexity and information.
Lezioni Lincee, Cambridge University Press, ISBN: 978-0-521-48005-5, 1998

1997
The Complexity of Indefinite Elliptic Problems with Noisy Data.
J. Complex., 1997

1996
The Complexity of Definite Elliptic Problems with Noisy Data.
J. Complex., 1996

1995
What Is the Complexity of Solution-Restricted Operator Equations?
J. Complex., 1995

The Complexity of Multivariate Elliptic Problems with Analytic Data.
J. Complex., 1995

1994
The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data.
J. Complex., 1994

1993
The Complexity of Two-Point Boundary-Value Problems with Analytic Data.
J. Complex., 1993

1991
Optimal residual algorithms for linear operator equations.
J. Complex., 1991

On the average case solvability of III-posed problems.
J. Complex., 1991

Computational complexity of differential and integral equations - an information-based approach.
Oxford mathematical monographs, Oxford University Press, ISBN: 978-0-19-853589-8, 1991

1989
Average case complexity of elliptic partial differential equations.
J. Complex., 1989

Optimal algorithms for a problem of optimal control.
J. Complex., 1989

1987
An information-based approach to III-posed problems.
J. Complex., 1987

1985
Complexity of differential and integral equations.
J. Complex., 1985

1981
On Maximal Order for Local and Global Numerical Problems.
J. Comput. Syst. Sci., 1981

1979
Optimal Order for Approximation of Derivatives.
J. Comput. Syst. Sci., 1979

Maximal Order and Order of Information for Numerical Quadrature.
J. ACM, 1979

Computational complexity of one-step methods for a scalar autonomous differential equation.
Computing, 1979


  Loading...