On Lower Bounds for the L 1-Norm of Exponential Sums

In the paper a method for finding lower bounds of the L ₁-norm of some exponential sums is described.     

Conic Formulation for l p -Norm Optimization

In this paper, we formulate the l _p -norm optimization problem as a conic optimization problem, derive its duality properties (weak duality, zero duality gap, and primal attainment) using standard conic duality and show how it can be solved in polynomial time applying the framework of interior-point algorithms based on self-concordant barriers.     

The L p -curvature images of convex bodies and L p -projection bodies

Associated with the L _p -curvature image defined by Lutwak, some inequalities for extended mixed p-affine surface areas of convex bodies and the support functions of L _p -projection bodies are established. As a natural extension of a result due to Lutwak, an L _p -type affine isoperimetric inequality, whose special cases are L _p -Busemann-Petty centroid inequality and L _p -affine projection inequality, respectively, is established. Some L _p -mixed volume inequalities involving L _p -projection bodies are also established.     

Minimum L1-Distance Projection onto the Boundary of a Convex Set: Simple Characterization

We show that the minimum distance projection in the L ₁-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a polyhedron leads to either an elementary minmax problem or a set of easily solved linear programs, depending upon whether the polyhedron is given as the intersection of a set of half spaces or as the convex hull of a set of extreme points. The outcome is an easier and more straightforward derivation of the special case results given in a recent paper by Briec (Ref. 1).     

Approximation by Reciprocals of Polynomials with Positive Coefficients in L p Spaces

We prove that, if f(x) L ^p _[0,1], 1 < p < , f(x) 0, x [0,1], f 0, then there is a polynomial p(x) ⁺ _n such that f - 1/p _LP C(p)(f,n ^-1/2) _LP where ⁺ _n indicates the set of all polynomials of degree n with positive coeficients (see the definition (1) in the text).     

Estimates of the distances to direct lines and rays from the poles of simplest fractions bounded in the norm of L p on these sets

For each p > 1, we obtain a lower bound for the distances to the real axis from the poles of simplest fractions (i.e., logarithmic derivatives of polynomials) bounded by 1 in the norm of L _p on this axis; this estimate improves the first estimate of such kind derived by Danchenko in 1994. For p = 2, the estimate turns out to be sharp. Similar estimates are obtained for the distances from the poles of simplest fractions to the vertices of angles and rays.     

Bivariate Sign Tests Based on the Sup, L 1 and L 2 Norms

The bivariate location problem is considered. The sup, L ₁ and L ₂ norms are used to construct bivariate sign tests from the univariate sign statistics computed on the projected observations on all lines passing through the origin. The tests so obtained are affine-invariant and distribution-free under the null hypothesis. The sup-norm gives rise to Hodges' test. A class of tests derived from the L ₂-norm, with Blumen's test as a member, is seen to be related to a class proposed by Oja and Nyblom (1989, J. Amer. Statist. Assoc., 84, 249-259). The L ₁-norm gives rise to a new test. Its asymptotic null distribution is seen to be the same as that of the L ₁-norm of a certain normal process related to the standard Wiener process. An explicit expression of its cumulative distribution function is given. A simulation study will examine the merits of the three approaches.     

Exact L 2-norm plane separation

We consider the problem of separating two sets of points in an n-dimensional real space with a (hyper)plane that minimizes the sum of L _p -norm distances to the plane of points lying on the wrong side of it. Despite recent progress, practical techniques for the exact solution of cases other than the L ₁ and L _∞-norm were unavailable. We propose and implement a new approach, based on non-convex quadratic programming, for the exact solution of the L ₂-norm case. We solve in reasonable computing times artificial problems of up to 20000 points (in 6 dimensions) and 13 dimensions (with 2000 points). We also observe that, for difficult real-life instances from the UCI Repository, computation times are substantially reduced by incorporating heuristic results in the exact solution process. Finally, we compare the classification performance of the planes obtained for the L ₁, L ₂ and L _∞ formulations. It appears that, despite the fact that L ₂ formulation is computationally more expensive, it does not give significantly better results than the L ₁ and L _∞ formulations.     

L r Estimates for Degenerate Elliptic Problems

We prove L ^r estimates for the Dirichlet problem –div(a(x,u,Du))=f with f in L ^q for 1q+, where the operator satisfies (|s|)|| ^p a(x,s,), with p>1. These estimates are obtained without symmetrization and are sharp in some cases.     

The Central Approximation Theorems for the Method of Left Gamma Quasi-Interpolants in L p spaces

The optimal degree of approximation of the method of Gammaoperators G _n in L _p spaces is O(n ^-1). In order to obtain much faster convergence, quasi-interpolants G _n ^(k) of G _n in the sense of Sablonnière are considered. We show that for fixed k the operator-norms G _n ^(k) _p are uniformly bounded in n. In addition to this, for the first time in the theory of quasi-interpolants, all central problems for approximation methods (direct theorem, inverse theorem, equivalence theorem) could be solved completely for the L _p metric. Left Gamma quasi-interpolants turn out to be as powerful as linear combinations of Gammaoperators [6].     

On Rearrangements of the Haar System in L p

In this paper we study operators rearranging the Haar system in each bundle. It is proved that the norm of any nonidentical rearrangement admits a nontrivial lower bound in L ^p spaces, .     

A Lower Bound for the L 1-norm of Fourier Series of Polynomial Type

Mathematical Notes -     

A program for solving the L2 reduced-order model problem with fixed denominator degree

A set of necessary conditions that must be satisfied by the L₂ optimal rational transfer matrix approximating a given higher-order transfer matrix, is briefly described. On its basis, an efficient iterative numerical algorithm has been obtained and implemented using standard MATLAB functions. The purpose of this contribution is to make the related computer program available and to illustrate some significant applications.Work partially supported byConsorzio Padova Ricerche through the IRI programme Consortia Città Ricerche—Central European Initiative.     

一类四阶奇异非线性椭圆方程的加权模误差估计

利用有限元方法研究了一类四阶奇异非线性椭圆方程,利用有限元的逆性质,给出了考虑数值积分影响时的加权H2模误差估计.     

On Korovkin Type Theorem in the Space of Locally Integrable Functions

It is shown that a Korovkin type theorem for a sequence of linear positive operators acting in weighted space L _p,w (loc) does not hold in all this space and is satisfied only on some subspace.     

双曲空间中完备子流形的特征值估计

研究了$(n+p)$维双曲空间$\mathbb{H}^{n+p}$中完备非紧子流形的第一特征值的上界.特别地,证明了$\mathbb{H}^{n+p}$中具有平行平均曲率向量$H$和无迹第二基本形式有限$L^q(q\geq n)$范数的完备子流形的第一特征值不超过$\frac{(n-1)^2(1-|H|^2)}{4}$,和$\mathbb{H}^{n+1}(n\leq5)$中具有常平均曲率向量$H$和无迹第二基本形式有限$L^q(2(1-\sqrt{\frac{2}{n}})相似文献