Very Hyperbolic Polynomials

A real polynomial in one variable is hyperbolic if it has only real roots. A function f is a primitive of order k of a function g if f ^(k) = g. A hyperbolic polynomial is very hyperbolic if it has hyperbolic primitives of all orders. In the paper, we prove a property of the domain of very hyperbolic polynomials and describe this domain in the case of degree 4.     

Optimization with additional variables and constraints

Norton, Plotkin and Tardos proved that—loosely spoken, an LP problem is solvable in time O(Tq^k+1) if deleting k fixed columns or rows, we obtain a problem which can be solved by an algorithm that makes at most T steps and q comparisons. This paper improves this running time to O(Tq^k).     

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.     

新组合型的三角插值多项式

将被插函数进行组合平均,构造一个新组合型的三角插值多项式Cn(f;t,x),使得它在全轴上一致收敛到每个以2π为周期的连续函数,且对Cj2π连续函数类的逼近阶达到最佳,这里0jt,t为任给的奇自然数.     

A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms

A NP-hard problem (P) of mixed-discrete linear programming is considered which consists in the minimization of a linear objective function subject to a special non-connected subset of an unbounded polymatroid. For this problem we describe three polynomial approximate algorithms including a greedy algorithm and a fully polynomial approximation scheme solving a special subproblem of (P).     

The a posteriori error estimates of Chebyshev–Petrov–Galerkin methods for second-order equations

In this paper, the a posteriori error estimates of Chebyshev–Petrov–Galerkin approximations are investigated. For simplicity, we choose the Poisson equation with Dirichlet boundary conditions to discuss the a posteriori error estimators, and deduce their efficient and reliable properties. Some numerical experiments are performed to verify the theoretical analysis for the a posteriori error estimators.     

Interpolation from spaces spanned by monomials

This is an extension and emendation of recent results on the use of Gauss elimination in multivariate polynomial interpolation and, in particular, ideal interpolation. Dedicated to Mariano Gasca on the occasion of his sixtieth birthday     

Some inequalities for characteristic functions. II

Recently we established Matysiak and Szablowski's conjecture [V. Matysiak, P.J. Szablowski, Theory Probab. Appl. 45 (2001) 711-713] about a lower bound of real-valued characteristic functions. In this paper, applying an alternative approach we are able to give explicitly the ranges of argument for which the obtained inequalities hold true for general characteristic functions.     

Differential equations and recursion relations for Laguerre functions on symmetric cones

We obtain the differential equation and recurrence relations satisfied by the Laguerre functions on an arbitrary symmetric cone .