On the greedy algorithm by the Haar system

• The paper investigates the uniform and almost everywhere convergence of the greedy algorithm by the Haar system. Necessary and sufficient conditions for norming the functions of Haar system are obtained, which guarantee the uniformconvergence for functions from C[0, 1] and almost everywhere convergence for functions from L1[0, 1].

Ämnesord

NATURVETENSKAP  -- Matematik -- Matematisk analys (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Mathematical Analysis (hsv//eng)

Nyckelord

Greedy algorithm

Haar system

uniform convergence

Mathematics

Matematik

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)