首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
While the theory of asymptotics for L2-minimal polynomials is highly developed, so far not much is known about Lp-minimal polynomials, Indeed, Bernstein gave asymptotics for the minimum deviation, Fekete and Walsh gave nth root asymptotics and, recently, Lubinsky and Saff came up with asymptotics outside the support [-1,1]. But the main point of interest, the asymptotic representation on the support, still remains open. Here we settle it for weight functions of the form where w is positive and on [-1,1] with and $\alpha > (2/p) - 1\  {\rm if}\  1  <a href=相似文献   

2.
Regularized minimization problems with nonconvex, nonsmooth, even non-Lipschitz penalty functions have attracted much attention in recent years, owing to their wide applications in statistics, control, system identification and machine learning. In this paper, the non-Lipschitz ? p (0 < p < 1) regularized matrix minimization problem is studied. A global necessary optimality condition for this non-Lipschitz optimization problem is firstly obtained, specifically, the global optimal solutions for the problem are fixed points of the so-called p-thresholding operator which is matrix-valued and set-valued. Then a fixed point iterative scheme for the non-Lipschitz model is proposed, and the convergence analysis is also addressed in detail. Moreover, some acceleration techniques are adopted to improve the performance of this algorithm. The effectiveness of the proposed p-thresholding fixed point continuation (p-FPC) algorithm is demonstrated by numerical experiments on randomly generated and real matrix completion problems.  相似文献   

3.
4.
In this paper we perform a comparative analysis of Lebesgue functions and constants of a family of Lagrange polynomials. We prove that if a polynomial from the family has the minimal norm in the space of square summable functions, then it also has the minimal norm as an operator which maps the space of continuous functions into itself.  相似文献   

5.
6.
Let ℋ be a separable infinite dimensional complex Hilbert space, and let ℒ(H) denote the algebra of all bounded linear operators on ℋ into itself. Let A = (A 1, A 2,..., A n), B = (B 1, B 2,..., B n) be n-tuples of operators in ℒ(H); we define the elementary operators Δ A,B : ℒ(H) ↦ ℒ(H) by
. In this paper, we characterize the class of pairs of operators A, B ∈ ℒ(H) satisfying Putnam-Fuglede’s property, i.e, the class of pairs of operators A,B ∈ ℒ(H) such that implies for all TC 1 (H) (trace class operators). The main result is the equivalence between this property and the fact that the ultraweak closure of the range of the elementary operator ΔA,B is closed under taking adjoints. This leads us to give a new characterization of the orthogonality (in the sense of Birkhoff) of the range of an elementary operator and its kernel in C 1 classes. This work was supported by the research center project No. 2005-04.  相似文献   

7.
Let C be a fixed compact convex subset of and let xp be the unique minimal p-norm element in C for any . In this paper, we study the convergence of xp as p or , respectively. We characterize also the limit point as the minimal element of C with respect to the lexical minimax order relation or the lexical minitotal order relation, respectively.Communicated by D. G. LuenbergerThe author thanks Professor H. Komiya for valuable advice and an anonymous referee for kind comments.  相似文献   

8.
9.
We are interested in numerical algorithms for weighted L1 approximation of functions defined on . We consider the space ℱr,d which consists of multivariate functions whose all mixed derivatives of order r are bounded in L1-norm. We approximate f∈ℱr,d by an algorithm which uses evaluations of the function. The error is measured in the weighted L1-norm with a weight function ρ. We construct and analyze Smolyak's algorithm for solving this problem. The algorithm is based on one-dimensional piecewise polynomial interpolation of degree at most r−1, where the interpolation points are specially chosen dependently on the smoothness parameter r and the weight ρ. We show that, under some condition on the rate of decay of ρ, the error of the proposed algorithm asymptotically behaves as , where n denotes the number of function evaluations used. The asymptotic constant is known and it decreases to zero exponentially fast as d→∞.  相似文献   

10.
We obtain formulas for the volume of a spherical tetrahedron with ℤ2-symmetry realized as rotation about the axis passing through the midpoints of a pair of skew edges. We show the dependence of the volume formula on the edge lengths and dihedral angles of the tetrahedron. Several different formulas result whose scopes are determined by the geometric characteristics of the tetrahedron.  相似文献   

11.
In this paper we give a closed-form expression for the Drinfeld modular polynomial \({\Phi_T(X,Y) \in \mathbb{F}_q(T)[X,Y]}\) for arbitrary q and prove a conjecture of Schweizer. A new identity involving the Catalan numbers plays a central role.  相似文献   

12.
Suppose π1(E, F) is the space of all absolutely 1-summing operators between two Banach spacesE andF. We show that ifF has a copy of c0, then π1 (E, F) will have a copy of c0, and under some conditions ifE has a copy of ℓ1 then π1 (E, F) would have a complemented copy of ℓ1.  相似文献   

13.
We present some surprisingly elementary arguments to prove that for every >0, if m is sufficiently large, then the crossing number of the Cartesian product Cm×Cn is at least (0.8–)mn, for every nm. The self–contained proof we give involves only one (rather elementary) geometrical result. The rest of the proof involves purely combinatorial arguments.Supported by CONA-CYT (Grant J32168E) and by FAI-UASLPFinal version received: July 14, 2003  相似文献   

14.
15.
Let Γ be an antipodal graph with intersection array {2r+1, 2r?2, 1; 1, 2, 2r+1}, where 2r(r + 1) ≤ 4096. If 2r + 1 is a prime power, then Mathon’s scheme provides the existence of an arc-transitive graph with this intersection array. Note that 2r + 1 is not a prime power only for r ∈ {7, 17, 19, 22, 25, 27, 31, 32, 37, 38, 42, 43}. We study automorphisms of hypothetical distance-regular graphs with the specified values of r. The cases r ∈ {7, 17, 19} were considered earlier. We prove that, if Γ is a vertex-symmetric graph with intersection array {2r + 1, 2r ? 2, 1; 1, 2, 2r +1}, 2r + 1 is not a prime power, and r ≤ 43, then r = 25, 27, or 31.  相似文献   

16.
We prove that the mixed problem for the Klein–Gordon–Fock equation u tt (x, t) ? u xx (x, t) + au(x, t) = 0, where a ≥ 0, in the rectangle Q T = [0 ≤ x ≤ l] × [0 ≤ tT] with zero initial conditions and with the boundary conditions u(0, t) = μ(t) ∈ L p [0, T ], u(l, t) = 0, has a unique generalized solution u(x, t) in the class L p (Q T ) for p ≥ 1. We construct the solution in explicit analytic form.  相似文献   

17.
For a linear differential expression with matrix coefficients in the class L p , p ≥ 2, and with a parameter λ, we consider a boundary value problem with boundary conditions at the endpoints of the interval [a, b]. Under the condition that the problem is regular, we obtain a formula for the Fourier series expansion of an arbitrary vector function of the class L p in the root functions of the problem.  相似文献   

18.
We consider the action of suitable trace operators on non homogeneous theta series that are Siegel modular forms for the principal congruence subgroups of the symplectic group of level q, n[q]. Then, we prove that modular forms for the Hecke subgroup of level q, 0,n[q], that are linear combination of such theta series, can also be expressed as combination of (homogeneous) theta series that are modular forms with respect to 0,n[q].  相似文献   

19.
For sine and cosine Fourier serieswithmonotonic coefficients we study Lp-convergence (1 < p < ∞) of their Cesàro means of a negative order.  相似文献   

20.
There are examples of complete spacelike surfaces in the Lorentzian product ℍ2 × ℝ1 with constant Gaussian curvature K ≤ −1. In this paper, we show that there exists no complete spacelike surface in ℍ2 × ℝ1 with constant Gaussian curvature K > −1.  相似文献   

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

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