On an extremal problem of Selberg II

Let m_p be the minimum of the product under the conditions that and . In our previous paper [J. Kaneko, On an extremal problem of Selberg, J. Approx. Theory 142 (2006) 129–137], we showed that the following estimates hold. provided p255. In this note, we prove that the limit of as p→∞ exists and is expressed by the (unique) solution of some simultaneous transcendental equations. By using this expression we obtain numerically.     

Relaxation of variational problems in two-dimensional nonlinear elasticity

Consider a plate occupying in a reference configuration a bounded open set Ω ⊂ ℝ ² , and let be its stored-energy function. In this paper we are concerned with relaxation of variational problems of type:

Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients

^** Email: todor{at}math.ethz.ch^*** Corresponding author. Email: schwab{at}math.ethz.ch A scalar, elliptic boundary-value problem in divergence formwith stochastic diffusion coefficient a(x, ) in a bounded domainD ^d is reformulated as a deterministic, infinite-dimensional,parametric problem by separation of deterministic (x D) andstochastic ( ) variables in a(x, ) via Karhúnen–Loèveor Legendre expansions of the diffusion coefficient. Deterministic,approximate solvers are obtained by projection of this probleminto a product probability space of finite dimension M and sparsediscretizations of the resulting M-dimensional parametric problem.Both Galerkin and collocation approximations are considered.Under regularity assumptions on the fluctuation of a(x, ) inthe deterministic variable x, the convergence rate of the deterministicsolution algorithm is analysed in terms of the number N of deterministicproblems to be solved as both the chaos dimension M and themultiresolution level of the sparse discretization resp. thepolynomial degree of the chaos expansion increase simultaneously.     

Complete Solutions and Extremality Criteria to Polynomial Optimization Problems

This paper presents a set of complete solutions to a class of polynomial optimization problems. By using the so-called sequential canonical dual transformation developed in the author’s recent book [Gao, D.Y. (2000), Duality Principles in Nonconvex Systems: Theory, Method and Applications, Kluwer Academic Publishers, Dordrecht/Boston/London, xviii + 454 pp], the nonconvex polynomials in can be converted into an one-dimensional canonical dual optimization problem, which can be solved completely. Therefore, a set of complete solutions to the original problem is obtained. Both global minimizer and local extrema of certain special polynomials can be indentified by Gao-Strang’s gap function and triality theory. For general nonconvex polynomial minimization problems, a sufficient condition is proposed to identify global minimizer. Applications are illustrated by several examples.     

也谈厄米多项式的递推关系

由厄米多项式的母函数出发,推导出厄米多项式的递推关系以及厄米多项式中系数的递推关系.     

Lemniscates and inequalities for the logarithmic capacities of continua

It is shown that if P(z) = z ⁿ + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2^?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained.     

Estimates for the Eigenvalues of Matrices

For matrices whose eigenvalues are real (such as Hermitian or real symmetric matrices), we derive simple explicit estimates for the maximal (λ_max) and the minimal (λ_min) eigenvalues in terms of determinants of order less than 3. For 3 × 3 matrices, we derive sharper estimates, which use det A but do not require to solve cubic equations.     

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure

We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ɛ in time polynomial in the problem size and in 1/ɛ. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) production and backlogging cost functions. We omit concavity and convexity restrictions. Furthermore, we take advantage of a straightforward dynamic programming algorithm applied to a rounded problem.     

On the divisor function of sets with even partition functions

Summary For P∈ F₂[z] with P(0)=1 and deg(P)≧ 1, let A =A(P) be the unique subset of N (cf. [9]) such that Σ_n≧0 p(A,n)zⁿ ≡ P(z) mod 2, where p(A,n) is the number of partitions of n with parts in A. To determine the elements of the set A, it is important to consider the sequence σ(A,n) = Σ _{d|n, d∈A} d, namely, the periodicity of the sequences (σ(A,2^kn) mod 2^k+1)_n≧1 for all k ≧ 0 which was proved in [3]. In this paper, the values of such sequences will be given in terms of orbits. Moreover, a formula to σ(A,2^kn) mod 2^k+1 will be established, from which it will be shown that the weight σ(A₁,2^kz_i) mod 2^k+1 on the orbit <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>z_i$ is moved on some other orbit z_j when A₁ is replaced by A₂ with A₁= A(P₁) and A₂= A(P₂) P₁ and P₂ being irreducible in F₂[z] of the same odd order.     

Characterization of rankings generated by linear discriminant analysis

Pairwise linear discriminant analysis can be regarded as a process to generate rankings of the populations. But in general, not all rankings are generated. We give a characterization of generated rankings. We also derive some basic properties of this model.