Chebyshev polynomials for disjoint compact sets

We are concerned with the problem of finding among all polynomials of degreen with leading coefficient 1, the one which has minimal uniform norm on the union of two disjoint compact sets in the complex plane. Our main object here is to present a class of disjoint sets where the best approximation can be determined explicitly for alln. A closely related approximation problem is obtained by considering all polynomials that have degree no larger thann and satisfy an interpolatory constraint. Such problems arise in certain iterative matrix computations. Again, we discuss a class of disjoint compact sets where the optimal polynomial is explicitly known for alln.Communicated by Doron S. Lubinsky     

Universal bases and greedy algorithms for anisotropic function classes

We suggest a three-step strategy to find a good basis (dictionary) for non-linear m-term approximation. The first step consists of solving an optimization problem of finding a near best basis for a given function class F, when we optimize over a collection D of bases (dictionaries). The second step is devoted to finding a universal basis (dictionary) D _u ∈ D for a given pair (F, D) of collections: F of function classes and D of bases (dictionaries). This means that D_u provides near optimal approximation for each class F from a collection F. The third step deals with constructing a theoretical algorithm that realizes near best m-term approximation with regard to D _u for function classes from F. In this paper we work this strategy out in the model case of anisotropic function classes and the set of orthogonal bases. The results are positive. We construct a natural tensor-product-wavelet-type basis and prove that it is universal. Moreover, we prove that a greedy algorithm realizes near best m-term approximation with regard to this basis for all anisotropic function classes.     

Common fixed points in cone metric spaces

In this paper we consider a notion of g-weak contractive mappings in the setting of cone metric spaces and we give results of common fixed points. This results generalize some common fixed points results in metric spaces and some of the results of Huang and Zhang in cone metric spaces. Supported by Universitá degli Studi di Palermo, R. S. ex 60%.     

Rational approximation in the real Hardy spaceH 2 and Stieltjes integrals: A uniquencess theorem

The paper deals with rational approximation over the real Hardy spaceH _{2, R}(V), whereV is the complement of the closed unit disk. The results concern Stieltjes functions

Primitive ideals of locally C*-algebras

This paper is concerned with the connection between the structure space of a locally C*-algebra and the set of its continuous topologically irreducible *-representations. Properties of primitive ideals in such algebras are further investigated, for instance, closed ideals are expressed as intersections of primitive ideals, by using that the Jacobson radical reduces to 0.     

On maximal ranges of polynomial spaces in the unit disk

Let be a domain in C, 0, and let _n ⁰ () be the set of polynomials of degreen such thatP(0)=0 andP(D), whereD denotes the unit disk. The maximal range _n is then defined to be the union of all setsP(D),P _n ⁰ (). We derive necessary and, in the case of ft convex, sufficient conditions for extremal polynomials, namely those boundaries whose ranges meet _n . As an application we solve explicitly the cases where is a half-plane or a strip-domain. This also implies a number of new inequalities, for instance, for polynomials with positive real part inD. All essential extremal polynomials found so far in the convex cases are univalent inD. This leads to the formulation of a problem. It should be mentioned that the general theory developed in this paper also works for other than polynomial spaces.Communicated by J. Milne Anderson.     

Concept of convergence in Banach algebras related to a spectral property

The aim of this note is a discussion about a concept of convergence related to a spectral property in unital complex Banach algebras.     

Adaptive greedy approximations

The problem of optimally approximating a function with a linear expansion over a redundant dictionary of waveforms is NP-hard. The greedy matching pursuit algorithm and its orthogonalized variant produce suboptimal function expansions by iteratively choosing dictionary waveforms that best match the function’s structures. A matching pursuit provides a means of quickly computing compact, adaptive function approximations. Numerical experiments show that the approximation errors from matching pursuits initially decrease rapidly, but the asymptotic decay rate of the errors is slow. We explain this behavior by showing that matching pursuits are chaotic, ergodic maps. The statistical properties of the approximation errors of a pursuit can be obtained from the invariant measure of the pursuit. We characterize these measures using group symmetries of dictionaries and by constructing a stochastic differential equation model. We derive a notion of the coherence of a signal with respect to a dictionary from our characterization of the approximation errors of a pursuit. The dictionary elements slected during the initial iterations of a pursuit correspond to a function’s coherent structures. The tail of the expansion, on the other hand, corresponds to a noise which is characterized by the invariant measure of the pursuit map. When using a suitable dictionary, the expansion of a function into its coherent structures yields a compact approximation. We demonstrate a denoising algorithm based on coherent function expansions.     

On the L 1-condition number of the univariate Bernstein basis

We show that the size of the 1-norm condition number of the univariate Bernstein basis for polynomials of degree n is O (2ⁿ / √n). This is consistent with known estimates [3], [5] for p = 2 and p = ∞ and leads to asymptotically correct results for the p-norm condition number of the Bernstein basis for any p with 1 ≤ p ≤ ∞.     

The numerical range of elementary operators

For n-tuplesA=(A ₁,...,A _n ) andB=(B ₁,...,B _n ) of operators on a Hilbert spaceH, letR _A,B denote the operator onL(H) defined by . In this paper we prove that

Conjectures around the baker-gammel-wills conjecture

The Baker-Gammel-Wills Conjecture states that if a functionf is meromorphic in a unit diskD, then there should, at least, exist an infinite subsequenceN ⊆N such that the subsequence of diagonal Padé approximants tof developed at the origin with degrees contained inN converges tof locally uniformly inD/{poles off}. Despite the fact that this conjecture may well be false in the general Padé approximation in several respects. In the present paper, six new conjectures about the convergence of diagonal Padé approximants are formulated that lead in the same direction as the Baker-Gammel-Wills Conjecture. However, they are more specific and they are based on partial results and theoretical considerations that make it rather probable that these new conjectures hold true.     

Maximal polynomial subordination to univalent functions in the unit disk

Let C be a simply connected domain, 0, and let _n,nN, be the set of all polynomials of degree at mostn. By _n() we denote the subset of polynomials p _n withp(0)=0 andp(D), whereD stands for the unit disk {z: |z|<1}, and=" by=">we denote the maximal range of these polynomials. Letf be a conformal mapping fromD onto ,f(0)=0. The main theme of this note is to relate _n (or some important aspects of it) to the imagesf _s (D), wheref _s (z):=f[(1–s)z], 0s<1. for=" instance=" we=" prove=" the=" existence=" of=" a=" universal=">c ₀ such that, forn2c ₀,     

A domain decomposition method for conformal mapping onto a rectangle

Letg be the function which maps conformally a rectangleR onto a simply connected domainG so that the four vertices ofR are mapped respectively onto four specified pointsz ₁,z ₂,z ₃,z ₄ onG. This paper is concerned with the study of a domain decomposition method for computing approximations tog and to an associated domain functional in cases where: (i)G is bounded by two parallel straight lines and two Jordan arcs. (ii) The four pointsz ₁,z ₂,z ₃,Z ₄, are the corners where the two straight lines meet the two arcs.Communicated by Dieter Gaier.     

Structures and uniqueness conditions of MK-weighted pseudoinverses

For given matricesM, A andK of appropriate sizes, we study the following two kinds of MK-weighted pseudoinverses ofA. The first kind of weighted pseudoinverseX is characterized by the following four Moore-Penrose like conditions:

Lehmer pairs of zeros,the de Bruijn-Newman constant Λ, and the Riemann Hypothesis

We give here a rigorous formulation for a pair of consecutive simple positive zeros of the functionH ₀ (which is closely related to the Riemann -function) to be a Lehmer pair of zeros ofH ₀. With this formulation, we establish that each such pair of zeros gives a lower bound for the de Bruijn-Newman constant (where the Riemann Hypothesis is equivalent to the assertion that 0). We also numerically obtain the following new lower bound for :

Faber polynomials corresponding to rational exterior mapping functions

Faber polynomials corresponding to rational exterior mapping functions of degree (m, m − 1) are studied. It is shown that these polynomials always satisfy an (m + 1)-term recurrence. For the special case m = 2, it is shown that the Faber polynomials can be expressed in terms of the classical Chebyshev polynomials of the first kind. In this case, explicit formulas for the Faber polynomials are derived.     

On optimal recovery of a holomorphic function in the unit ball of Cn

Some problems of optimal recovery in the Hardy and Bergman spaces in the unit ball ofC ⁿ are solved. In particular, some variants of the Schwartz Lemma follow.Communicated by Charles A. Micchelli.     

Moduli of smoothness andK-functionals inL p, 0<p<1

It is shown that forL _p, 0p<1, the=">K-functional betweenL _p andW _p ^r is identically zero. Useful measures that are equivalent to the moduli of smoothness are found. The equivalence results that are given are valid for 0p.Communicated by Vilmos Totik.     

Crowding for analytic functions with elongated range

Letf be a function analytic in the unit diskD. If the rangef(D) off is contained in a rectangleR with sidesa andb withba such thatf(D) touches both small sides ofR, then the supremum norm of the derivative satisfies f b·(b/a). We derive tight bounds for the best possible function in this estimate. In particular, we show that for small .Communicated by Dieter Gaier.     

Feynman’s operational calculi for noncommuting operators: The monogenic calculus

In recent papers the authors presented their approach to Feynman’s operational calculi for a system of not necessarily commuting bounded linear operators acting on a Banach space. The central objects of the theory are the disentangling algebra, a commutative Banach algebra, and the disentangling map which carries this commutative structure into the noncommutative algebra of operators. Under assumptions concerning the growth of disentangled exponential expressions, the associated functional calculus for the system of operators is a distribution with compact support which we view as the joint spectrum of the operators with respect to the disentangling map. In this paper, the functional calculus is represented in terms of a higher-dimensional analogue of the Riesz-Dunford calculus using Clifford analysis.