The following pages link to Arthur G. Werschulz (Q610937):
Displaying 50 items.
- (Q209580) (redirect page) (← links)
- A new characterization of \((s,t)\)-weak tractability (Q346298) (← links)
- The complexity of Fredholm equations of the second kind: noisy information about everything (Q610938) (← links)
- What is the complexity of volume calculation? (Q700188) (← links)
- Measuring uncertainty without a norm (Q798906) (← links)
- Tractability of multivariate approximation over a weighted unanchored Sobolev space (Q843721) (← links)
- Tractability of quasilinear problems. I: General results (Q880024) (← links)
- Tight tractability results for a model second-order Neumann problem (Q896550) (← links)
- Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: the relation to the \(L_{2}\)-approximation (Q1049400) (← links)
- Is Gauss quadrature optimal for analytic functions? (Q1062222) (← links)
- What is the complexity of elliptic systems? (Q1069283) (← links)
- Are linear algorithms always good for linear problems? (Q1082778) (← links)
- Complexity of differential and integral equations (Q1085950) (← links)
- Finite element methods are not always optimal (Q1096364) (← links)
- An information-based approach to ill-posed problems (Q1100852) (← links)
- Optimal algorithms for a problem of optimal control (Q1123393) (← links)
- A finite element method for the Tricomi problem (Q1142554) (← links)
- Maximal order for quadratures using n evaluations (Q1145838) (← links)
- On maximal order for local and global numerical problems (Q1158734) (← links)
- Optimal residual algorithms for linear operator equations (Q1179027) (← links)
- On the average case solvability of ill-posed problems (Q1179452) (← links)
- Computational complexity of one-step methods for a scalar autonomous differential equation (Q1258165) (← links)
- Optimal order for approximation of derivatives (Q1259134) (← links)
- Average case complexity of elliptic partial differential equations (Q1262102) (← links)
- The complexity of two-point boundary-value problems with piecewise analytic data (Q1342509) (← links)
- Linear ill-posed problems are solvable on the average for all Gaussian measures (Q1345067) (← links)
- The complexity of multivariate elliptic problems with analytic data (Q1346598) (← links)
- The complexity of indefinite elliptic problems with noisy data (Q1383441) (← links)
- What is the complexity of Stieltjes integration? (Q1578424) (← links)
- Counterexamples in optimal quadrature (Q1820547) (← links)
- Surface approximation is sometimes easier than surface integration (Q1885349) (← links)
- Where does smoothness count the most for Fredholm equations of the second kind with noisy information? (Q1887113) (← links)
- What is the complexity of solution-restricted operator equations? (Q1908046) (← links)
- Tractability of the Fredholm problem of the second kind (Q1931290) (← links)
- Where does smoothness count the most for two-point boundary-value problems? (Q1961052) (← links)
- Tractability of multivariate approximation over weighted standard Sobolev spaces (Q2001209) (← links)
- Tractability for Volterra problems of the second kind with convolution kernels (Q2034562) (← links)
- Complexity and tractability for a class of elliptic partial integro-differential equations (Q2074932) (← links)
- A nearly-optimal algorithm for the Fredholm problem of the second kind over a non-tensor product Sobolev space (Q2351445) (← links)
- The complexity of definite elliptic problems with noisy data (Q2365417) (← links)
- The complexity of two-point boundary-value problems with analytic data (Q2365848) (← links)
- A note on the complexity and tractability of the heat equation (Q2465287) (← links)
- Complexity of Indefinite Elliptic Problems (Q3030179) (← links)
- Does Increased Regularity Lower Complexity? (Q3219026) (← links)
- Tractability of quasilinear problems II: Second-order elliptic problems (Q3426021) (← links)
- What is the Complexity of Related Elliptic, Parabolic, and Hyperbolic Problems? (Q3747673) (← links)
- (Q3747683) (← links)
- What is the complexity of ill-posed problems? (Q3757277) (← links)
- (Q3826018) (← links)
- Computational Complexity of One-Step Methods for Systems of Differential Equations (Q3875248) (← links)
