Follow
Arthur G. Werschulz
Arthur G. Werschulz
Professor of Computer Science, Fordham University
Verified email at dsm.fordham.edu
Title
Cited by
Cited by
Year
Complexity and information
JF Traub, AG Werschulz
Cambridge University Press, 1998
3551998
The computational complexity of differential and integral equations: An information-based approach
AG Werschulz
Oxford University Press, 1991
1501991
What is the complexity of ill-posed problems?
AG Werschulz
Numerical functional analysis and optimization 9 (9-10), 945-967, 1987
421987
What is the complexity of the Fredholm problem of the second kind?
AG Werschulz
The Journal of Integral Equations, 213-241, 1985
301985
Is Gauss quadrature optimal for analytic functions?
MA Kowalski, AG Werschulz, H Woźniakowski
Numerische Mathematik 47 (1), 89-98, 1985
291985
On the numerical solutions of Helmholtz’s equation by the finite element method
AK Aziz, A Werschulz
SIAM Journal on Numerical Analysis 17 (5), 681-686, 1980
251980
Are linear algorithms always good for linear problems?
AG Werschulz, H Woźniakowski
aequationes mathematicae 31, 202-212, 1986
201986
Tractability of multivariate approximation over a weighted unanchored Sobolev space
AG Werschulz, H Woźniakowski
Constructive Approximation 30, 395-421, 2009
192009
Complexity of differential and integral equations
AG Werschulz
Journal of Complexity 1 (2), 232-255, 1985
171985
A new characterization of (s, t)-weak tractability
AG Werschulz, H Woźniakowski
Journal of Complexity 38, 68-79, 2017
162017
Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
AG Werschulz
Journal of Complexity 19 (6), 758-798, 2003
162003
The complexity of definite elliptic problems with noisy data
AG Werschulz
Journal of Complexity 12 (4), 440-473, 1996
161996
Linear ill-posed problems are solvable on the average for all Gaussian measures
JF Traub, AG Werschulz
Mathematical Intelligencer 16 (2), 42-48, 1994
161994
Computational complexity of one-step methods for systems of differential equations
AG Werschulz
Mathematics of Computation 34 (149), 155-174, 1980
161980
Tractability of quasilinear problems I: General results
AG Werschulz, H Woźniakowski
Journal of approximation theory 145 (2), 266-285, 2007
142007
The complexity of the Poisson problem for spaces of bounded mixed derivatives
AG Werschulz
141995
On the average case solvability of III-posed problems
MA Kon, K Ritter, AG Werschulz
Journal of Complexity 7 (3), 220-224, 1991
141991
The complexity of indefinite elliptic problems with noisy data
AG Werschulz
131997
What is the complexity of surface integration?
AG Werschulz, H Woźniakowski
journal of complexity 17 (2), 442-466, 2001
102001
Optimal error properties of finite element methods for second order elliptic Dirichlet problems
AG Werschulz
mathematics of computation 38 (158), 401-413, 1982
101982
The system can't perform the operation now. Try again later.
Articles 1–20