Greedy approximation and the multivariate Haar system

A. Kamont; V. N. Temlyakov

The search session has expired. Please query the service again.

Displaying similar documents to “Greedy approximation and the multivariate Haar system”

On the Gram-Schmidt orthonormalizatons of subsystems of Schauder systems

Robert E. Zink (2002)

Colloquium Mathematicae

Similarity:

In one of the earliest monographs that involve the notion of a Schauder basis, Franklin showed that the Gram-Schmidt orthonormalization of a certain Schauder basis for the Banach space of functions continuous on [0,1] is again a Schauder basis for that space. Subsequently, Ciesielski observed that the Gram-Schmidt orthonormalization of any Schauder system is a Schauder basis not only for C[0,1], but also for each of the spaces $L^{p} [0, 1]$ , 1 ≤ p < ∞. Although perhaps not probable, the latter...

Necessary condition for Kostyuchenko type systems to be a basis in Lebesgue spaces

Aydin Sh. Shukurov (2012)

Colloquium Mathematicae

Similarity:

A necessary condition for Kostyuchenko type systems and system of powers to be a basis in $L_{p}$ (1 ≤ p < +∞) spaces is obtained. In particular, we find a necessary condition for a Kostyuchenko system to be a basis in $L_{p}$ (1 ≤ p < +∞).

On bases, compactness and weak convergence in the Banach space $A_{p}$

J. T. Marti (1971)

Colloquium Mathematicae

Similarity:

A descent algorithm for $ε$ - approximation of continuous functions with values in unitary space

M. Janc (1982)

Matematički Vesnik

Similarity:

Three-space problems and bounded approximation properties

Wolfgang Lusky (2003)

Studia Mathematica

Similarity:

Let ${R ₙ}_{n = 1}^{\infty}$ be a commuting approximating sequence of the Banach space X leaving the closed subspace A ⊂ X invariant. Then we prove three-space results of the following kind: If the operators Rₙ induce basis projections on X/A, and X or A is an $ℒ_{p}$ -space, then both X and A have bases. We apply these results to show that the spaces $C_{Λ} = \bar{s p a n} z^{k} : k \in Λ \subset C ()$ and $L_{Λ} = \bar{s p a n} z^{k} : k \in Λ \subset L ₁ ()$ have bases whenever Λ ⊂ ℤ and ℤ∖Λ is a Sidon set.

Addendum to "Necessary condition for Kostyuchenko type systems to be a basis in Lebesgue spaces" (Colloq. Math. 127 (2012), 105-109)

Aydin Sh. Shukurov (2014)

Colloquium Mathematicae

Similarity:

It is well known that if φ(t) ≡ t, then the system ${φ ⁿ (t)}_{n = 0}^{\infty}$ is not a Schauder basis in L₂[0,1]. It is natural to ask whether there is a function φ for which the power system ${φ ⁿ (t)}_{n = 0}^{\infty}$ is a basis in some Lebesgue space $L_{p}$ . The aim of this short note is to show that the answer to this question is negative.

Uniform convergence of the greedy algorithm with respect to the Walsh system

Martin Grigoryan (2010)

Studia Mathematica

Similarity:

For any 0 < ϵ < 1, p ≥ 1 and each function $f \in L^{p} [0, 1]$ one can find a function $g \in L^{\infty} [0, 1)$ with mesx ∈ [0,1): g ≠ f < ϵ such that its greedy algorithm with respect to the Walsh system converges uniformly on [0,1) and the sequence $| c_{k} (g) | : k \in s p e c (g)$ is decreasing, where $c_{k} (g)$ is the sequence of Fourier coefficients of g with respect to the Walsh system.

The general methods of finding the sum $S_{n}$ for all kinds of series

K. Orlov (1981)

Matematički Vesnik

Similarity:

On the Kaczmarz algorithm of approximation in infinite-dimensional spaces

Stanisław Kwapień, Jan Mycielski (2001)

Studia Mathematica

Similarity:

The Kaczmarz algorithm of successive projections suggests the following concept. A sequence $(e_{k})$ of unit vectors in a Hilbert space is said to be effective if for each vector x in the space the sequence (xₙ) converges to x where (xₙ) is defined inductively: x₀ = 0 and $x ₙ = x_{n - 1} + α ₙ e ₙ$ , where $α ₙ = ⟨ x - x_{n - 1}, e ₙ ⟩$ . We prove the effectivity of some sequences in Hilbert spaces. We generalize the concept of effectivity to sequences of vectors in Banach spaces and we prove some results for this more general concept.

On the weighted Euclidean matching problem in $ℝ^{d}$

Birgit Anthes, Ludger Rüschendorf (2001)

Applicationes Mathematicae

Similarity:

A partitioning algorithm for the Euclidean matching problem in $ℝ^{d}$ is introduced and analyzed in a probabilistic model. The algorithm uses elements from the fixed dissection algorithm of Karp and Steele (1985) and the Zig-Zag algorithm of Halton and Terada (1982) for the traveling salesman problem. The algorithm runs in expected time $n {(l o g n)}^{p - 1}$ and approximates the optimal matching in the probabilistic sense.

Subsystems of the Schauder system whose orthonormalizations are Schauder bases for $L^{p} [0, 1]$

Robert E. Zink (1989)

Colloquium Mathematicae

Similarity:

General Haar systems and greedy approximation

Anna Kamont (2001)

Studia Mathematica

Similarity:

We show that each general Haar system is permutatively equivalent in $L^{p} ([0, 1])$ , 1 < p < ∞, to a subsequence of the classical (i.e. dyadic) Haar system. As a consequence, each general Haar system is a greedy basis in $L^{p} ([0, 1])$ , 1 < p < ∞. In addition, we give an example of a general Haar system whose tensor products are greedy bases in each $L^{p} ({[0, 1]}^{d})$ , 1 < p < ∞, d ∈ ℕ. This is in contrast to [11], where it has been shown that the tensor products of the dyadic Haar system are not greedy bases...

On the non-equivalence of rearranged Walsh and trigonometric systems in $L_{p}$

Aicke Hinrichs, Jörg Wenzel (2003)

Studia Mathematica

Similarity:

We consider the question of whether the trigonometric system can be equivalent to some rearrangement of the Walsh system in $L_{p}$ for some p ≠ 2. We show that this question is closely related to a combinatorial problem. This enables us to prove non-equivalence for a number of rearrangements. Previously this was known for the Walsh-Paley order only.

Uniqueness of unconditional basis of $ℓ_{p} (c ₀)$ and $ℓ_{p} (ℓ ₂)$ , 0 < p < 1

F. Albiac, C. Leránoz (2002)

Studia Mathematica

Similarity:

We prove that the quasi-Banach spaces $ℓ_{p} (c ₀)$ and $ℓ_{p} (ℓ ₂)$ (0 < p < 1) have a unique unconditional basis up to permutation. Bourgain, Casazza, Lindenstrauss and Tzafriri have previously proved that the same is true for the respective Banach envelopes $ℓ ₁ (c ₀)$ and ℓ₁(ℓ₂). They used duality techniques which are not available in the non-locally convex case.

Conditionality constants of quasi-greedy bases in super-reflexive Banach spaces

F. Albiac, J. L. Ansorena, G. Garrigós, E. Hernández, M. Raja (2015)

Studia Mathematica

Similarity:

We show that in a super-reflexive Banach space, the conditionality constants $k_{N} (ℬ)$ of a quasi-greedy basis ℬ grow at most like $O ({(l o g N)}^{1 - ε})$ for some 0 < ε < 1. This extends results by the third-named author and Wojtaszczyk (2014), where this property was shown for quasi-greedy bases in $L_{p}$ for 1 < p < ∞. We also give an example of a quasi-greedy basis ℬ in a reflexive Banach space with $k_{N} (ℬ) \approx l o g N$ .

An improvement of Euclid's algorithm

Zítko, Jan, Kuřátko, Jan

Similarity:

The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using $c$ - $s$ transformation and $Q R$ -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.

Seasonal time-series imputation of gap missing algorithm (STIGMA)

Eduardo Rangel-Heras, Pavel Zuniga, Alma Y. Alanis, Esteban A. Hernandez-Vargas, Oscar D. Sanchez (2023)

Kybernetika

Similarity:

This work presents a new approach for the imputation of missing data in weather time-series from a seasonal pattern; the seasonal time-series imputation of gap missing algorithm (STIGMA). The algorithm takes advantage from a seasonal pattern for the imputation of unknown data by averaging available data. We test the algorithm using data measured every $10$ minutes over a period of $365$ days during the year 2010; the variables include global irradiance, diffuse irradiance, ultraviolet irradiance,...

Haar wavelets on the Lebesgue spaces of local fields of positive characteristic

Biswaranjan Behera (2014)

Colloquium Mathematicae

Similarity:

We construct the Haar wavelets on a local field K of positive characteristic and show that the Haar wavelet system forms an unconditional basis for $L^{p} (K)$ , 1 < p < ∞. We also prove that this system, normalized in $L^{p} (K)$ , is a democratic basis of $L^{p} (K)$ . This also proves that the Haar system is a greedy basis of $L^{p} (K)$ for 1 < p < ∞.

Unconditionality of general Franklin systems in $L^{p} [0, 1]$ , 1 < p < ∞

Gegham G. Gevorkyan, Anna Kamont (2004)

Studia Mathematica

Similarity:

By a general Franklin system corresponding to a dense sequence = (tₙ, n ≥ 0) of points in [0,1] we mean a sequence of orthonormal piecewise linear functions with knots , that is, the nth function of the system has knots t₀, ..., tₙ. The main result of this paper is that each general Franklin system is an unconditional basis in $L^{p} [0, 1]$ , 1 < p < ∞.

Convergence of greedy approximation I. General systems

S. V. Konyagin, V. N. Temlyakov (2003)

Studia Mathematica

Similarity:

We consider convergence of thresholding type approximations with regard to general complete minimal systems eₙ in a quasi-Banach space X. Thresholding approximations are defined as follows. Let eₙ* ⊂ X* be the conjugate (dual) system to eₙ; then define for ε > 0 and x ∈ X the thresholding approximations as $T_{ε} (x) : = \sum_{j \in D_{ε} (x)} e *_{j} (x) e_{j}$ , where $D_{ε} (x) : = j : | e *_{j} (x) | \geq ε$ . We study a generalized version of $T_{ε}$ that we call the weak thresholding approximation. We modify the $T_{ε} (x)$ in the following way. For ε > 0, t ∈ (0,1) we set $D_{t, ε} (x) : = j : t ε \leq | e *_{j} (x) | < ε$ and consider...

$L_{\infty}$ -Convergence of Finite Element Approximation

J. A. Nitsche (1975)

Publications mathématiques et informatique de Rennes

Similarity:

Second derivatives of norms and contractive complementation in vector-valued spaces

Bas Lemmens, Beata Randrianantoanina, Onno van Gaans (2007)

Studia Mathematica

Similarity:

We consider 1-complemented subspaces (ranges of contractive projections) of vector-valued spaces $ℓ_{p} (X)$ , where X is a Banach space with a 1-unconditional basis and p ∈ (1,2) ∪ (2,∞). If the norm of X is twice continuously differentiable and satisfies certain conditions connecting the norm and the notion of disjointness with respect to the basis, then we prove that every 1-complemented subspace of $ℓ_{p} (X)$ admits a basis of mutually disjoint elements. Moreover, we show that every contractive projection...

A basis of Zₘ

Min Tang, Yong-Gao Chen (2006)

Colloquium Mathematicae

Similarity:

Let $σ_{A} (n) = | (a, a^{'}) \in A ² : a + a^{'} = n |$ , where n ∈ N and A is a subset of N. Erdős and Turán conjectured that for any basis A of order 2 of N, $σ_{A} (n)$ is unbounded. In 1990, Imre Z. Ruzsa constructed a basis A of order 2 of N for which $σ_{A} (n)$ is bounded in the square mean. In this paper, we show that there exists a positive integer m₀ such that, for any integer m ≥ m₀, we have a set A ⊂ Zₘ such that A + A = Zₘ and $σ_{A} (n ̅) \leq 768$ for all n̅ ∈ Zₘ.