Displaying 181 – 200 of 313

Showing per page

On the Bernstein-Walsh-Siciak theorem

Rafał Pierzchała (2012)

Studia Mathematica

By the Oka-Weil theorem, each holomorphic function f in a neighbourhood of a compact polynomially convex set K N can be approximated uniformly on K by complex polynomials. The famous Bernstein-Walsh-Siciak theorem specifies the Oka-Weil result: it states that the distance (in the supremum norm on K) of f to the space of complex polynomials of degree at most n tends to zero not slower than the sequence M(f)ρ(f)ⁿ for some M(f) > 0 and ρ(f) ∈ (0,1). The aim of this note is to deduce the uniform version,...

On the characterization of Hardy-Besov spaces on the dyadic group and its applications

Jun Tateoka (1994)

Studia Mathematica

C. Watari [12] obtained a simple characterization of Lipschitz classes L i p ( p ) α ( W ) ( 1 p , α > 0 ) on the dyadic group using the L p -modulus of continuity and the best approximation by Walsh polynomials. Onneweer and Weiyi [4] characterized homogeneous Besov spaces B p , q α on locally compact Vilenkin groups, but there are still some gaps to be filled up. Our purpose is to give the characterization of Besov spaces B p , q α by oscillations, atoms and others on the dyadic groups. As applications, we show a strong capacity inequality of the...

On the convergence rate of approximation schemes for Hamilton-Jacobi-Bellman equations

Guy Barles, Espen Robstad Jakobsen (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Using systematically a tricky idea of N.V. Krylov, we obtain general results on the rate of convergence of a certain class of monotone approximation schemes for stationary Hamilton-Jacobi-Bellman equations with variable coefficients. This result applies in particular to control schemes based on the dynamic programming principle and to finite difference schemes despite, here, we are not able to treat the most general case. General results have been obtained earlier by Krylov for finite difference...

On the convergence rate of approximation schemes for Hamilton-Jacobi-Bellman Equations

Guy Barles, Espen Robstad Jakobsen (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Using systematically a tricky idea of N.V. Krylov, we obtain general results on the rate of convergence of a certain class of monotone approximation schemes for stationary Hamilton-Jacobi-Bellman equations with variable coefficients. This result applies in particular to control schemes based on the dynamic programming principle and to finite difference schemes despite, here, we are not able to treat the most general case. General results have been obtained earlier by Krylov for finite...

Currently displaying 181 – 200 of 313