zbMath0754.65129MaRDI QIDQ4000361
Arthur G. Werschulz
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of nonlinear two-point boundary-value problems,
Where does smoothness count the most for Fredholm equations of the second kind with noisy information?,
Linear ill-posed problems are solvable on the average for all Gaussian measures,
Worst-case errors for some spatial approximations to a model problem in two-dimensional transport theory,
The quantum setting with randomized queries for continuous problems,
Perspectives on information-based complexity,
The quantum query complexity of elliptic PDE,
The average case complexity of the Fredholm equation of second kind with free term in \(H^ r(\Gamma)\),
Tractability of quasilinear problems. I: General results,
The complexity of indefinite elliptic problems with noisy data,
Enhancing the Order of the Milstein Scheme for Stochastic Partial Differential Equations with Commutative Noise,
The complexity of Fredholm equations of the second kind: noisy information about everything,
Tractability of the Fredholm problem of the second kind,
Quantum radial basis function method for the Poisson equation,
Tight tractability results for a model second-order Neumann problem,
Where does smoothness count the most for two-point boundary-value problems?,
Quantum algorithm and circuit design solving the Poisson equation,
Adaptivity and computational complexity in the numerical solution of ODEs,
On the average case solvability of ill-posed problems,
Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces,
Linear information versus function evaluations for \(L_2\)-approximation,
Newton's method and a mesh-independence principle for certain semilinear boundary-value problems,
A note on the complexity and tractability of the heat equation,
Optimal recovery of solutions of the generalized heat equation in the unit ball from inaccurate data,
High dimensional numerical problems,
Polynomial cost for solving IVP for high-index DAE,
Computability of Solutions of Operator Equations,
The randomized information complexity of elliptic PDE,
The optimal approximations for solving linear ill-posed problems,
The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information,
Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time,
What is the complexity of surface integration?,
The power of adaption for approximating functions with singularities,
Optimized general sparse grid approximation spaces for operator equations,
On the power of standard information for multivariate approximation in the worst case setting,
New averaging technique for approximating weighted integrals,
On the power of standard information for \(L_{\infty}\) approximation in the randomized setting,
What is the complexity of Stieltjes integration?,
Average approximations and moments of measures,
Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: the relation to the \(L_{2}\)-approximation,
Tractability of quasilinear problems II: Second-order elliptic problems,
The power of standard information for multivariate approximation in the randomized setting,
Complexity theory for Lie-group solvers
