Average errors for zero finding: lower bounds for smooth or monotone functions. (Summary).
Average errors for zero finding: lower bounds for smooth or monotone functions.
Average errors for zero finding: Lower bounds.
Soft Decision Decoding of Binary Linear Block Codes Using the Bfgs-Method
Spatial Besov regularity for stochastic partial differential equations on Lipschitz domains
We use the scale of Besov spaces , 1/τ = α/d + 1/p, α > 0, p fixed, to study the spatial regularity of solutions of linear parabolic stochastic partial differential equations on bounded Lipschitz domains ⊂ ℝ. The Besov smoothness determines the order of convergence that can be achieved by nonlinear approximation schemes. The proofs are based on a combination of weighted Sobolev estimates and characterizations of Besov spaces by wavelet expansions.
Page 1