Arthur G. Werschulz

Publication Activity (10 Years)

Years Active: 1979-2024
Publications (10 Years): 6

Top Topics

Differential Equations

Top Venues

Found. Comput. Math.

Publications

Arthur G. Werschulz
Complexity for a class of elliptic ordinary integro-differential equations. J. Complex. 81 (2024)
Arthur G. Werschulz
Complexity and tractability for a class of elliptic partial integro-differential equations. J. Complex. 69 (2022)
Arthur G. Werschulz, Henryk Wozniakowski
Tractability for Volterra problems of the second kind with convolution kernels. J. Complex. 64 (2021)
Arthur G. Werschulz, Henryk Wozniakowski
Tractability of multivariate approximation over weighted standard Sobolev spaces. J. Complex. 53 (2019)
Arthur G. Werschulz, Henryk Wozniakowski
A new characterization of (s, t)-weak tractability. J. Complex. 38 (2017)
Arthur G. Werschulz, Henryk Wozniakowski
Tight Tractability Results for a Model Second-Order Neumann Problem. Found. Comput. Math. 15 (4) (2015)
Arthur G. Werschulz
-approximation. J. Complex. 25 (6) (2009)
Arthur G. Werschulz, Henryk Wozniakowski
Tractability of quasilinear problems I: General results. J. Approx. Theory 145 (2) (2007)
Arthur G. Werschulz, Henryk Wozniakowski
Tractability of quasilinear problems II: Second-order elliptic problems. Math. Comput. 76 (258) (2007)
Arthur G. Werschulz
A note on the complexity and tractability of the heat equation. J. Complex. 23 (4-6) (2007)
Arthur G. Werschulz
Where does smoothness count the most for Fredholm equations of the second kind with noisy information? J. Complex. 19 (6) (2003)
Arthur G. Werschulz, Henryk Wozniakowski
What Is the Complexity of Volume Calculation? J. Complex. 18 (2) (2002)
Ian H. Sloan, Arthur G. Werschulz
ANNOUNCEMENT: 2001 Best Paper Award Committee. J. Complex. 17 (3) (2001)
Arthur G. Werschulz, Henryk Wozniakowski
What Is the Complexity of Surface Integration? J. Complex. 17 (2) (2001)
Arthur G. Werschulz
What Is the Complexity of Stieltjes Integration? J. Complex. 16 (2) (2000)
Arthur G. Werschulz
Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems? J. Complex. 15 (3) (1999)
Arthur G. Werschulz
The Complexity of Indefinite Elliptic Problems with Noisy Data. J. Complex. 13 (4) (1997)
Arthur G. Werschulz
The Complexity of Definite Elliptic Problems with Noisy Data. J. Complex. 12 (4) (1996)
Arthur G. Werschulz
The Complexity of Multivariate Elliptic Problems with Analytic Data. J. Complex. 11 (1) (1995)
Arthur G. Werschulz
What Is the Complexity of Solution-Restricted Operator Equations? J. Complex. 11 (4) (1995)
Arthur G. Werschulz
The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data. J. Complex. 10 (4) (1994)
Arthur G. Werschulz
The Complexity of Two-Point Boundary-Value Problems with Analytic Data. J. Complex. 9 (1) (1993)
Arthur G. Werschulz
Optimal residual algorithms for linear operator equations. J. Complex. 7 (2) (1991)
Mark A. Kon, Klaus Ritter, Arthur G. Werschulz
On the average case solvability of III-posed problems. J. Complex. 7 (3) (1991)
Arthur G. Werschulz
Optimal algorithms for a problem of optimal control. J. Complex. 5 (2) (1989)
Arthur G. Werschulz
Average case complexity of elliptic partial differential equations. J. Complex. 5 (3) (1989)
Arthur G. Werschulz
An information-based approach to III-posed problems. J. Complex. 3 (3) (1987)
Arthur G. Werschulz
Complexity of differential and integral equations. J. Complex. 1 (2) (1985)
Arthur G. Werschulz
On Maximal Order for Local and Global Numerical Problems. J. Comput. Syst. Sci. 23 (1) (1981)
Arthur G. Werschulz
Optimal Order for Approximation of Derivatives. J. Comput. Syst. Sci. 18 (3) (1979)
Arthur G. Werschulz
Computational complexity of one-step methods for a scalar autonomous differential equation. Computing 23 (4) (1979)
Arthur G. Werschulz
Maximal Order and Order of Information for Numerical Quadrature. J. ACM 26 (3) (1979)