Arthur G. Werschulz

According to our database, Arthur G. Werschulz authored at least 35 papers between 1979 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Complexity for a class of elliptic ordinary integro-differential equations.

Arthur G. Werschulz

J. Complex., April, 2024

2022

Complexity and tractability for a class of elliptic partial integro-differential equations.

Arthur G. Werschulz

J. Complex., 2022

2021

Tractability for Volterra problems of the second kind with convolution kernels.

Arthur G. Werschulz, Henryk Wozniakowski

J. Complex., 2021

2019

Tractability of multivariate approximation over weighted standard Sobolev spaces.

Arthur G. Werschulz, Henryk Wozniakowski

J. Complex., 2019

2017

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

Arthur G. Werschulz, Henryk Wozniakowski

J. Complex., 2017

2015

Tight Tractability Results for a Model Second-Order Neumann Problem.

Arthur G. Werschulz, Henryk Wozniakowski

Found. Comput. Math., 2015

2009

Information-based Complexity and Information-based Optimization.

Joseph F. Traub, Arthur G. Werschulz

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₂-approximation.

Arthur G. Werschulz

J. Complex., 2009

2007

Tractability of quasilinear problems II: Second-order elliptic problems.

Arthur G. Werschulz, Henryk Wozniakowski

Math. Comput., 2007

A note on the complexity and tractability of the heat equation.

Arthur G. Werschulz

J. Complex., 2007

Tractability of quasilinear problems I: General results.

Arthur G. Werschulz, Henryk Wozniakowski

J. Approx. Theory, 2007

2003

Where does smoothness count the most for Fredholm equations of the second kind with noisy information?

Arthur G. Werschulz

J. Complex., 2003

2002

What Is the Complexity of Volume Calculation?

Arthur G. Werschulz, Henryk Wozniakowski

J. Complex., 2002

2001

What Is the Complexity of Surface Integration?

Arthur G. Werschulz, Henryk Wozniakowski

J. Complex., 2001

ANNOUNCEMENT: 2001 Best Paper Award Committee.

Ian H. Sloan, Arthur G. Werschulz

J. Complex., 2001

2000

What Is the Complexity of Stieltjes Integration?

Arthur G. Werschulz

J. Complex., 2000

1999

Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems?

Arthur G. Werschulz

J. Complex., 1999

1998

Complexity and information.

Joseph F. Traub, Arthur G. Werschulz

Lezioni Lincee, Cambridge University Press, ISBN: 978-0-521-48005-5, 1998

1997

The Complexity of Indefinite Elliptic Problems with Noisy Data.

Arthur G. Werschulz

J. Complex., 1997

1996

The Complexity of Definite Elliptic Problems with Noisy Data.

Arthur G. Werschulz

J. Complex., 1996

1995

What Is the Complexity of Solution-Restricted Operator Equations?

Arthur G. Werschulz

J. Complex., 1995

The Complexity of Multivariate Elliptic Problems with Analytic Data.

Arthur G. Werschulz

J. Complex., 1995

1994

The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data.

Arthur G. Werschulz

J. Complex., 1994

1993

The Complexity of Two-Point Boundary-Value Problems with Analytic Data.

Arthur G. Werschulz

J. Complex., 1993

1991

Optimal residual algorithms for linear operator equations.

Arthur G. Werschulz

J. Complex., 1991

On the average case solvability of III-posed problems.

Mark A. Kon, Klaus Ritter, Arthur G. Werschulz

J. Complex., 1991

Computational complexity of differential and integral equations - an information-based approach.

Arthur G. Werschulz

Oxford mathematical monographs, Oxford University Press, ISBN: 978-0-19-853589-8, 1991

1989

Average case complexity of elliptic partial differential equations.

Arthur G. Werschulz

J. Complex., 1989

Optimal algorithms for a problem of optimal control.

Arthur G. Werschulz

J. Complex., 1989

1987

An information-based approach to III-posed problems.

Arthur G. Werschulz

J. Complex., 1987

1985

Complexity of differential and integral equations.

Arthur G. Werschulz

J. Complex., 1985

1981

On Maximal Order for Local and Global Numerical Problems.

Arthur G. Werschulz

J. Comput. Syst. Sci., 1981

1979

Optimal Order for Approximation of Derivatives.

Arthur G. Werschulz

J. Comput. Syst. Sci., 1979

Maximal Order and Order of Information for Numerical Quadrature.

Arthur G. Werschulz

J. ACM, 1979

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

Arthur G. Werschulz

Computing, 1979