Cyclicity of bicyclic operators and completeness of translates

We study cyclicity of operators on a separable Banach space which admit a bicyclic vector such that the norms of its images under the iterates of the operator satisfy certain growth conditions. A simple consequence of our main result is that a bicyclic unitary operator on a Banach space with separable dual is cyclic. Our results also imply that if is the shift operator acting on the weighted space of sequences , if the weight ω satisfies some regularity conditions and ω(n) = 1 for nonnegative n, then S is cyclic if . On the other hand one can see that S is not cyclic if the series diverges. We show that the question of Herrero whether either S or S* is cyclic on admits a positive answer when the series is convergent. We also prove completeness results for translates in certain Banach spaces of functions on .     

Nonlinear Methods of Approximation

Abstract. Our main interest in this paper is nonlinear approximation. The basic idea behind nonlinear approximation is that the elements used in the approximation do not come from a fixed linear space but are allowed to depend on the function being approximated. While the scope of this paper is mostly theoretical, we should note that this form of approximation appears in many numerical applications such as adaptive PDE solvers, compression of images and signals, statistical classification, and so on. The standard problem in this regard is the problem of m -term approximation where one fixes a basis and looks to approximate a target function by a linear combination of m terms of the basis. When the basis is a wavelet basis or a basis of other waveforms, then this type of approximation is the starting point for compression algorithms. We are interested in the quantitative aspects of this type of approximation. Namely, we want to understand the properties (usually smoothness) of the function which govern its rate of approximation in some given norm (or metric). We are also interested in stable algorithms for finding good or near best approximations using m terms. Some of our earlier work has introduced and analyzed such algorithms. More recently, there has emerged another more complicated form of nonlinear approximation which we call highly nonlinear approximation. It takes many forms but has the basic ingredient that a basis is replaced by a larger system of functions that is usually redundant. Some types of approximation that fall into this general category are mathematical frames, adaptive pursuit (or greedy algorithms), and adaptive basis selection. Redundancy on the one hand offers much promise for greater efficiency in terms of approximation rate, but on the other hand gives rise to highly nontrivial theoretical and practical problems. With this motivation, our recent work and the current activity focuses on nonlinear approximation both in the classical form of m -term approximation (where several important problems remain unsolved) and in the form of highly nonlinear approximation where a theory is only now emerging.     

Multivariate Frobenius–Padé approximants: Properties and algorithms

The aim of this paper is to construct rational approximants for multivariate functions given by their expansion in an orthogonal polynomial system. This will be done by generalizing the concept of multivariate Padé approximation. After defining the multivariate Frobenius–Padé approximants, we will be interested in the two following problems: the first one is to develop recursive algorithms for the computation of the value of a sequence of approximants at a given point. The second one is to compute the coefficients of the numerator and denominator of the approximants by solving a linear system. For some particular cases we will obtain a displacement rank structure for the matrix of the system we have to solve. The case of a Tchebyshev expansion is considered in more detail.     

Exponentials Reproducing Subdivision Schemes

This paper is concerned with a family of nonstationary, interpolatory subdivision schemes that have the capability of reproducing functions in a finite-dimensional subspace of exponential polynomials. We give conditions for the existence and uniqueness of such schemes, and analyze their convergence and smoothness. It is shown that the refinement rules of an even-order exponentials reproducing scheme converge to the Dubuc—Deslauriers interpolatory scheme of the same order, and that both schemes have the same smoothness. Unlike the stationary case, the application of a nonstationary scheme requires the computation of a different rule for each refinement level. We show that the rules of an exponentials reproducing scheme can be efficiently derived by means of an auxiliary orthogonal scheme , using only linear operations. The orthogonal schemes are also very useful tools in fitting an appropriate space of exponential polynomials to a given data sequence.     

On the spectra of a Cantor measure

We analyze all orthonormal bases of exponentials on the Cantor set defined by Jorgensen and Pedersen in J. Anal. Math. 75 (1998) 185-228. A complete characterization for all maximal sets of orthogonal exponentials is obtained by establishing a one-to-one correspondence with the spectral labelings of the infinite binary tree. With the help of this characterization we obtain a sufficient condition for a spectral labeling to generate a spectrum (an orthonormal basis). This result not only provides us an easy and efficient way to construct various of new spectra for the Cantor measure but also extends many previous results in the literature. In fact, most known examples of orthonormal bases of exponentials correspond to spectral labelings satisfying this sufficient condition. We also obtain two new conditions for a labeling tree to generate a spectrum when other digits (digits not necessarily in {0,1,2,3}) are used in the base 4 expansion of integers and when bad branches are allowed in the spectral labeling. These new conditions yield new examples of spectra and in particular lead to a surprizing example which shows that a maximal set of orthogonal exponentials is not necessarily an orthonormal basis.     

On the corona theorem for almost periodic functions

LetAP ⁺ (R ⁿ ) denote the Banach algebra of all continuous almost periodic functions onR ⁿ whose Bohr-Fourier spectrum is contained in an additive semi-group [0, ) ⁿ . We show that the maximal ideal space ofAP ⁺ (R ⁿ ) may have a nonempty corona and we characterize all for which the corona is empty. Analogous results are established for algebras of almost periodic functions with absolutely convergent Fourier series.     

Approximation order provided by refinable function vectors

In this paper we considerL _p-approximation by integer translates of a finite set of functionsϕ _v (v=0, ...,r − 1) which are not necessarily compactly supported, but have a suitable decay rate. Assuming that the function vectorϕ=(ϕ ^=0/ r−1 is refinable, necessary and sufficient conditions for the refinement mask are derived. In particular, if algebraic polynomials can be exactly reproduced by integer translates ofϕ _v, then a factorization of the refinement mask ofϕ can be given. This result is a natural generalization of the result for a single functionϕ, where the refinement mask ofϕ contains the factor ((1 +e ^−iu )/2) ^m if approximation orderm is achieved. Dedicated to Professor L. Berg on the occasion of his 65th birthday     

A geometric approach to the cascade approximation operator for wavelets

This paper is devoted to an approximation problem for operators in Hilbert space, that appears when one tries to study geometrically thecascade algorithm in wavelet theory. Let be a Hilbert space, and let be a representation ofL ( ) on . LetR be a positive operator inL ( ) such thatR(1) =1, where1 denotes the constant function 1. We study operatorsM on (bounded, but noncontractive) such that

On the convergence of von Neumann''s alternating projection algorithm for two sets

We give several unifying results, interpretations, and examples regarding the convergence of the von Neumann alternating projection algorithm for two arbitrary closed convex nonempty subsets of a Hilbert space. Our research is formulated within the framework of Fejér monotonicity, convex and set-valued analysis. We also discuss the case of finitely many sets.     

Uniformly bounded representations of SL(2,R)

We compute the “norm” of irreducible uniformly bounded representations of $\mathrm{SL}(2,\mathbb{R})$. We show that the Kunze–Stein version of the uniformly bounded representations has minimal norm in its similarity class of uniformly bounded representations.     

Adaptive frame methods for nonlinear variational problems

In this paper we develop adaptive numerical solvers for certain nonlinear variational problems. The discretization of the variational problems is done by a suitable frame decomposition of the solution, i.e., a complete, stable, and redundant expansion. The discretization yields an equivalent nonlinear problem on the space of frame coefficients. The discrete problem is then adaptively solved using approximated nested fixed point and Richardson type iterations. We investigate the convergence, stability, and optimal complexity of the scheme. A theoretical advantage, for example, with respect to adaptive finite element schemes is that convergence and complexity results for the latter are usually hard to prove. The use of frames is further motivated by their redundancy, which, at least numerically, has been shown to improve the conditioning of the discretization matrices. Also frames are usually easier to construct than Riesz bases. We present a construction of divergence-free wavelet frames suitable for applications in fluid dynamics and magnetohydrodynamics. M. Fornasier acknowledges the financial support provided through the Intra-European Individual Marie Curie Fellowship Programme, under contract MOIF-CT-2006-039438. All of the authors acknowledge the hospitality of Dipartimento di Metodi e Modelli Matematici per le Scienze Applicate, Università di Roma “La Sapienza”, Italy, during the early preparation of this work. The authors want to thank Daniele Boffi, Dorina Mitrea, and Karsten Urban for the helpful and fruitful discussions on divergence-free function spaces.     

Integration over a simplex,truncated cubes,and Eulerian numbers

Summary A method of integrating a function over a simplex is described in which (i) the simplex is first transformed into a right-angled isosceles simplex; (ii) this simplex is dissected into small cubes and truncated cubes; (iii) the integration over the truncated cubes is performed by the centroid method or by Stroud's method, and this requires the use of formulae for the moments of a truncated cube. These formulae are developed and are expressed in terms of Eulerian numbers. In the special case when the truncated cube is itself a right-angled isoceles simplex a new algorithm is given, depending on the discrete Fourier transform, for calculating the moments as polynomials inn wheren is the dimensionality.     

Locally bounded set-valued mappings and monotone countable paracompactness

We prove that the following statements are equivalent for a space X: (1) X is monotonically countably paracompact; (2) for every metric space Y there exists an operator Φ assigning to each locally bounded mapping , a locally bounded l.s.c. mapping with ?⊂Φ(?) such that Φ(?)⊂Φ(?^′) whenever ?⊂?^′, where B(Y) is the set of all non-empty closed bounded sets of Y; (3) for every metric space Y, there exist operators Φ and Ψ assigning to each u.s.c. mapping , an l.s.c. mapping and a u.s.c. mapping with ?⊂Φ(?)⊂Ψ(?) such that Φ(?)⊂Φ(?^′) and Ψ(?)⊂Ψ(?^′) whenever ?⊂?^′.     

Approximation Orders of FSI Spaces in L 2 (R d )

A second look at the authors' [BDR1], [BDR2] characterization of the approximation order of a Finitely generated Shift-Invariant (FSI) subspace of L ₂(R ^d ) results in a more explicit formulation entirely in terms of the (Fourier transform of the) generators of the subspace. Further, when the generators satisfy a certain technical condition, then, under the mild assumption that the set of 1-periodizations of the generators is linearly independent, such a space is shown to provide approximation order k if and only if contains a (necessarily unique) satisfying for |j|<k , . The technical condition is satisfied, e.g., when the generators are at infinity for some >k+d. In the case of compactly supported generators, this recovers an earlier result of Jia [J1], [J2]. March 19, 1996. Dates revised: September 6, 1996, March 4, 1997.