Greedy approximation and the multivariate Haar system

A. Kamont; V. N. Temlyakov

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:

The adaptation of the $k$ -means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm

Rudolf Scitovski, Kristian Sabo (2019)

Applications of Mathematics

Similarity:

We consider the multiple ellipses detection problem on the basis of a data points set coming from a number of ellipses in the plane not known in advance, whereby an ellipse $E$ is viewed as a Mahalanobis circle with center $S$ , radius $r$ , and some positive definite matrix $Σ$ . A very efficient method for solving this problem is proposed. The method uses a modification of the $k$ -means algorithm for Mahalanobis-circle centers. The initial approximation consists of the set of circles whose centers...

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:

The universal Banach space with a $K$ -suppression unconditional basis

Taras O. Banakh, Joanna Garbulińska-Wegrzyn (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Using the technique of Fraïssé theory, for every constant $K \geq 1$ , we construct a universal object $𝕌_{K}$ in the class of Banach spaces possessing a normalized $K$ -suppression unconditional Schauder basis.

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.

Corrigendum to the paper “The universal Banach space with a $K$ -suppression unconditional basis”

Taras O. Banakh, Joanna Garbulińska-Wegrzyn (2020)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We observe that the notion of an almost ${𝔉ℑ}_{K}$ -universal based Banach space, introduced in our earlier paper [1]: Banakh T., Garbulińska-Wegrzyn J., The universal Banach space with a $K$ -suppression unconditional basis, Comment. Math. Univ. Carolin. 59 (2018), no. 2, 195–206, is vacuous for $K = 1$ . Taking into account this discovery, we reformulate Theorem 5.2 from [1] in order to guarantee that the main results of [1] remain valid.

An adaptive $s$ -step conjugate gradient algorithm with dynamic basis updating

Erin Claire Carson (2020)

Applications of Mathematics

Similarity:

The adaptive $s$ -step CG algorithm is a solver for sparse symmetric positive definite linear systems designed to reduce the synchronization cost per iteration while still achieving a user-specified accuracy requirement. In this work, we improve the adaptive $s$ -step conjugate gradient algorithm by the use of iteratively updated estimates of the largest and smallest Ritz values, which give approximations of the largest and smallest eigenvalues of $A$ , using a technique due to G. Meurant and...

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$ .