首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 23 毫秒
1.
The nth cyclic function is defined by

We prove that if k is an integer with 1kn−1, then

holds for all positive real numbers x with the best possible constantsα=1 and β= 2n-k over n.  相似文献   

2.
In this paper, we will show that Lagrange interpolatory polynomials are optimal for solving some approximation theory problems concerning the finding of linear widths.In particular, we will show that

, where n is a set of the linear operators with finite rank n+1 defined on −1,1], and where n+1 denotes the set of polynomials p=∑i=0n+1aixi of degreen+1 such that an+11. The infimum is achieved for Lagrange interpolatory polynomial for nodes .  相似文献   

3.
In Akhiezer's book [“The Classical Moment Problem and Some Related Questions in Analysis,” Oliver & Boyd, Edinburghasol;London, 1965] the uniqueness of the solution of the Hamburger moment problem, if a solution exists, is related to a theory of nested disks in the complex plane. The purpose of the present paper is to develop a similar nested disk theory for a moment problem that arises in the study of certain orthogonal rational functions. Let {αn}n=0be a sequence in the open unit disk in the complex plane, let

( /|αk|=−1 whenαk=0), and let

We consider the following “moment” problem: Given a positive-definite Hermitian inner product ·, · on × , find a non-decreasing functionμon [−π, π] (or a positive Borel measureμon [−π,π)) such that

In particular we give necessary and sufficient conditions for the uniqueness of the solution in the case that If this series diverges the solution is always unique.  相似文献   

4.
We characterize the set of functions which can be approximated by polynomials with the following norm

for a big class of weights w0w1, …, wk  相似文献   

5.
We prove the existence of a function which is holomorphic exactly in the unit disk and has universal translates with respect to a prescribed closed set E∂ and satisfies C(∂ \E). If Q is a subsequence of 0 with upper density d(Q)=1 then the function can be constructed such that in addition

  相似文献   

6.
Let Λ(λj)j=0 be a sequence of distinct real numbers. The span of {xλ0xλ1, …, xλn} over is denoted by Mn(Λ)span{xλ0xλ1, …, xλn}. Elements of Mn(Λ) are called Müntz polynomials. The principal result of this paper is the following Markov-type inequality for products of Müntz polynomials. T 2.1. LetΛ(λj)j=0andΓ(γj)j=0be increasing sequences of nonnegative real numbers. Let

Then

18(n+m+1)(λnm).In particular ,

Under some necessary extra assumptions, an analog of the above Markov-type inequality is extended to the cases when the factor x is dropped, and when the interval [0, 1] is replaced by [ab](0, ∞).  相似文献   

7.
It is a well-known conjecture that given m ε N, the set of natural numbers, the sequence {mn}n−0, defined by the iterative formula m0 = m,
has some iterate mj = 1. It is shown in this paper that for any k ε N, “almost every” natural number m greater than unity has k iterates less than m.  相似文献   

8.
For a linear differential system y′ = Ay with unknown matrix A, we approximate A by a particular linear combination of values of the observed exponential matrix
and show that the L1 norm of the error matrix is O(hn).  相似文献   

9.
Oblique Projections and Abstract Splines   总被引:1,自引:0,他引:1  
Given a closed subspace of a Hilbert space and a bounded linear operator AL( ) which is positive, consider the set of all A-self-adjoint projections onto :

In addition, if 1 is another Hilbert space, T: → 1 is a bounded linear operator such that T*T=A and ξ , consider the set of (T, ) spline interpolants to ξ:

A strong relationship exists between (A, ) and sp(T, ,ξ). In fact, (A, ) is not empty if and only if s p(T, ,ξ) is not empty for every ξ . In this case, for any ξ it holds

and for any ξ , the unique vector of s p(T, ,ξ) with minimal norm is (1−PA, )ξ, where PA, is a distinguished element of (A, ). These results offer a generalization to arbitrary operators of several theorems by de Boor, Atteia, Sard and others, which hold for closed range operators.  相似文献   

10.
We consider noncommutative continued fractions of the form b0 + a1(b1 + a2(b2 + a3(…)−1 c3)−1 c2)−1 c1, (1) where an, bn and cn are elements of some Banach algebra B and bn−1 exists. Such expressions play an important role in the numerical investigation of various problems in theoretical physics and in applied mathematics, but up to now their convergence was not studied in the general case. In this paper we prove a theorem which is an extension of a wellknown theorem of Pringsheim and, in particular, guarantees the convergence of (1) under the following hypotheses:
. As an application, we give a generalization of a theorem of van Vleck. The paper closes with an extensive bibliography.  相似文献   

11.
Let p > 1, and dμ a positive finite Borel measure on the unit circle Γ: = {z ε C: ¦z¦ = 1}. Define the monic polynomial φn, p(z)=zn+…εPn >(the set of polynomials of degree at most n) satisfying
. Under certain conditions on dμ, the asymptotics of φn, p(z) for z outside, on, or inside Γ are obtained (cf. Theorems 2.2 and 2.4). Zero distributions of φn, p are also discussed (cf. Theorems 3.1 and 3.2).  相似文献   

12.
Assume that X is a compact connected orientable nonsingular real algebraic variety with an algebraic free S1-action so that the quotient Y=X/S1 is also a real algebraic variety. If π : XY is the quotient map then the induced map between reduced algebraic K-groups, tensored with ,

is onto, where , denoting the ring of entire rational (regular) functions on the real algebraic variety X, extending partially the Bochnak–Kucharz result that

for any real algebraic variety X. As an application we will show that for a compact connected Lie group G .  相似文献   

13.
The Bernstein Constant and Polynomial Interpolation at the Chebyshev Nodes   总被引:1,自引:0,他引:1  
In this paper, we establish new asymptotic relations for the errors of approximation in Lp[−1,1], 0<p∞, of xλ, λ>0, by the Lagrange interpolation polynomials at the Chebyshev nodes of the first and second kind. As a corollary, we show that the Bernstein constant

is finite for λ>0 and .  相似文献   

14.
Let the function fC[0,1] satisfy f( . We prove the estimate

.  相似文献   

15.
Given α (0, 1), let Tα be the Carleson class of all meromorphic maps ƒ from the unit disk to the extended complex plane with

where ƒ# and dm mean the spherical derivative of ƒ and Lebesgue area measure on separately. And, let BITα and BITα,0 be the biholomorphically invariant families (amongst the Carleson class) consisting of those ƒ Tα with sup and lim|w| → 1 ||ƒ ο φw||Tα = 0 respectively, where
. The main purpose of this article is to study BITα and BITα,0 via the Ahlfors-Shimizu characteristic, canonical factorization and bounded holomorphic maps.  相似文献   

16.
Generalizations of prophet inequalities for single sequences are obtained for optimal stopping of several parallel sequences of independent random variables. For example, if {Xi, j, 1 ≤ in, 1 ≤ j < ∞} are independent non-negative random variables, then
and this bound is best possible. Applications are made to comparisons of the optimal expected returns of various alternative methods of stopping of parallel processes.  相似文献   

17.
We study the asymptotic behavior of the sequence of polynomials orthogonal with respect to the discrete Sobolev inner product on the unit circle

where f(Z)=(f(z1), …, f(l1)(z1), …, f(zm), …, f(lm)(zm)), A is a M×M positive definite matrix or a positive semidefinite diagonal block matrix, M=l1+…+lm+m, belongs to a certain class of measures, and |zi|>1, i=1, 2, …, m.  相似文献   

18.
z-Approximations     
Approximation algorithms for NP-hard optimization problems have been widely studied for over three decades. Most of these measure the quality of the solution produced by taking the ratio of the cost of the solution produced by the algorithm to the cost of an optimal solution. In certain cases, this ratio may not be very meaningful—for example, if the ratio of the worst solution to the best solution is at most some constant α, then an approximation algorithm with factor α may in fact yield the worst solution! To overcome this hurdle (among others), several authors have independently suggested the use of a different measure which we call z-approximation. An algorithm is an α z-approximation if it runs in polynomial time and produces a solution whose distance from the optimal one is at most α times the distance between the optimal solution and the worst possible solution. The results known so far about z-approximations are either of the inapproximability type or rather straightforward observations. We design polynomial time algorithms for several fundamental discrete optimization problems; in particular we obtain a z-approximation factor of for the

(TSP) (with no triangle inequality assumption). For the TSP this improves to . We also show that if there is a polynomial time algorithm that for any fixed ε > 0 yields an ε z-approximation then P = NP. We also present z-approximations for severa1 other problems such as

, and

.  相似文献   

19.
The object of this paper is to study the rapidity of convergence of the Taylor mean of the Fourier series of ƒ(x) when ƒ(x) belongs to the class Lip(α, p). We show that it is of Jackson order provided that a suitable integrability condition is imposed upon the function
.  相似文献   

20.
This note characterizes the denseness of rational systems
in C[−1, 1], where the nonreal poles in {ak}k=1 \[−1, 1] are paired by complex conjugation. This extends an Achiezer's result.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号