Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Complexity and information

- J. Traub, A. Werschulz
- Mathematics, Computer Science
- Lezioni Lincee
- 13 January 1999

Part I. Fundamentals: 1. Introduction 2. Information-based complexity 3. Breaking the curse of dimensionality Part II. Some Interesting Topics: 4. Very high-dimensional integration and mathematical… Expand

268 6

Computational complexity of one-step methods for systems of differential equations

- A. Werschulz
- Mathematics
- 1980

Abstract : The problem is to calculate an approximate solution of an initial value problem for an autonomous system of N ordinary differential equations. Using fast power series techniques, we… Expand

14 2- PDF

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

- A. Werschulz
- Mathematics, Computer Science
- Oxford mathematical monographs
- 7 November 1991

Introduction EXAMPLE: A TWO-POINT BOUNDARY VALUE PROBLEM: Introduction Error, cost, and complexity A minimal error algorithm Complexity bounds Comparison with the finite element method Standard… Expand

88 1

What is the complexity of ill-posed problems?

- A. Werschulz
- Mathematics
- 1987

This paper deals with the optimal solution of ill-posed linear problems, i.e..linear problems for which the solution operator is unbounded. We consider worst-case ar,and averagecase settings. Our… Expand

24 1

The Complexity of Definite Elliptic Problems with Noisy Data

- A. Werschulz
- Computer Science, Mathematics
- J. Complex.
- 1 December 1996

TLDR

15 1- PDF

Finite element methods are not always optimal

- A. Werschulz
- Mathematics
- 1 September 1987

Consider a regularly elliptic 2mth order boundary value problem Lu = f with f @e H^r(@W), where r $@?m. In previous work, we showed that the finite element method (FEM) using piecewise polynomials of… Expand

8 1

What Is the Complexity of Surface Integration?

- A. Werschulz, H. Wozniakowski
- Computer Science, Mathematics
- J. Complex.
- 1 June 2001

We study the worst case complexity of computing ?-approximations of surface integrals. This problem has two sources of partial information: the integrand f and the function g defining the surface.… Expand

8 1- PDF

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

- A. Werschulz
- Computer Science, Mathematics
- J. Complex.
- 1 December 2003

TLDR

10 1- PDF

Tractability of multivariate approximation over weighted standard Sobolev spaces

- A. Werschulz, H. Wozniakowski
- Mathematics, Computer Science
- J. Complex.
- 1 August 2019

TLDR

3 1- PDF

Optimal error properties of finite element methods for second order elliptic Dirichlet problems

- A. Werschulz
- Mathematics
- 1 May 1982

We use the informational approach of Traub and Wozniakowski [9] to study the variational form of the second order elliptic Dirichlet problem Lu = f on Q C RN. For f G HW(Q), where r -1, a… Expand

7 1- PDF

...

1

2

3

4

5

...