Gronwall—Bihari不等式的统一探讨

本文探讨Gronwall-Bihari不等式的一些n维拓广.我们获得的结论推广了新近建立的一些结果(其中包括Pachpatte、Yeh、Hristora、Bainor与Shih等人的结果)的推广.     

A Unified Approach to Generalized Stirling Functions

Here presented is a unified approach to generalized Stirling functions by using generalized factorial functions, k-Gamma functions, generalized divided difference, and the unified expression of Stirling numbers defined in [16]. Previous well-known Stirling functions introduced by Butzer and Hauss [4], Butzer, Kilbas, and Trujilloet [6] and others are included as particular cases of our generalization. Some basic properties related to our general pattern such as their recursive relations, generating functions, and asymptotic properties are discussed,which extend the corresponding results about the Stirling numbers shown in [21] to the defined Stirling functions.     

Hadamard良定性的统一研究

对一些非线性问题的Hadamard良定性给出一个统一的定理，应用这个定理，可以容易地推出KyFan点，Nash平衡点等的Hadamard良定性。此外，最优化问题和鞍点问题的通用良定性也被研究给出了两个定理。     

A Unified Monotonic Approach to Generalized Linear Fractional Programming

We present an efficient unified method for solving a wide class of generalized linear fractional programming problems. This class includes such problems as: optimizing (minimizing or maximizing) a pointwise maximum or pointwise minimum of a finite number of ratios of linear functions, optimizing a sum or product of such ratios, etc. – over a polytope. Our approach is based on the recently developed theory of monotonic optimization.     

A Unified Approach to Combinatorial Formulas for Schubert Polynomials

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials; we also present simplifications in some of the existing approaches to this area. We designate certain line diagrams for permutations known as rc-graphs as the main structure. The other structures in the literature we study include: semistandard Young tableaux, Kohnert diagrams, and balanced labelings of the diagram of a permutation. The main tools in our investigation are certain operations on rc-graphs, which correspond to the coplactic operations on tableaux, and thus define a crystal graph structure on rc-graphs; a new definition of these operations is presented. One application of these operations is a straightforward, purely combinatorial proof of a recent formula (due to Buch, Kresch, Tamvakis, and Yong), which expresses Schubert polynomials in terms of products of Schur polynomials. In spite of the fact that it refers to many objects and results related to them, the paper is mostly self-contained.     

A Unified Approach to Uniform Signal Recovery From Nonlinear Observations

Foundations of Computational Mathematics - Recent advances in quantized compressed sensing and high-dimensional estimation have shown that signal recovery is even feasible under strong nonlinear...     

A Unified Gradient Flow Approach to Constrained Nonlinear Optimization Problems

This paper presents a unified gradient flow approach to nonlinear constrained optimization problems. This method is based on a continuous gradient flow reformulation of constrained optimization problems and on a two level time discretization of the gradient flow equation with a splitting parameter . The convergence of the scheme is analyzed and it is shown that the scheme becomes first order when [0, 1] and second order when = 1 and the time discretization step length is sufficiently large. Numerical experiments for continuous, discrete and mixed discrete optimization problems were performed, and the numerical results show that the approach is effective for solving these problems.     

A Unified Constructive Approach to the Topological Degree in Rn

The paper gives an approach to the topological degree in Rⁿ which takes into account numerical requirements and permits derivation of the known degree computation formulas in a simple way. The new approach subsumes several earlier approaches and represents a general principle of construction of degree computation formulas. The basic idea consists of computing the degree of a continuous function relative to a bounded open subset Ω of Rⁿ by means of an auxiliary function which is defined on a polyhedron approximating Ω and maps into a known fixed convex polyhedron containing the origin of Rⁿ. It is further shown that the topological degree of a continuous function relative to an n-dimensional polyhedron P can be computed alone by means of a subset of the boundary of P .     

A Unified Approach to Shifts Induced by Right Invertible Operators

In this paper, shifts for a right invertible operator D induced by an analytic function acting in a linear complete metric space are considered. The case when these shifts coincide with the operator - valued function on a set which contains the set of all D-polynomials and the set of all exponentials is studied. It is shown that in this case these shifts are R-shifts and D-shifts (cf. [1], [10]).     

A Unified Approach to Several Inequalities Involving Functions and Derivatives

There are many inequalities measuring the deviation of the average of a function over an interval from a linear combination of values of the function and some of its derivatives. A general setting is given from which the desired inequalities are obtained using Holder's inequality. Moreover, sharpness of the constants is usually easy to prove by studying the equality cases of Holder's inequality. Comparison of averages, extension to weighted integrals and n-dimensional results are also given.     

A Unified Approach to Convergence Analysis of Discretization Methods for Volterra-typeEquations

This paper presents a general convergence analysis of numericalmethods for solving ordinary differential equations and non-linerVolterra integral and integrodifferential euqations. The conceptof analytic and discrete forms is introduced, Prolongation andrestriction operators reduce the problem of comparing the fundamentalforms. Integral inequalities and their discrete analogues proofof a collocation method for solving Volterra integral equationsof the second kind.     

多目标决策的中心方法之统一探讨

该文从统一的角度研究了多目标决策的中心方法的结构及其收敛性质．提出了形式一般的、可采用三种曲线搜索规则的中心方法之算法模型并在很弱的条件下证明了其全局收敛性以此为基础．讨论了模型中的搜索方向等参量的取法，给出了两类可实现的算法．该文结果统一和推广了已有的单（多）目标决策的中心方法．数值结果表明该算法是有效的．     

A Unified Approach to the Proportional Relation for Discrete-Time Single-Server Queues

It is well known that a simple relation called proportional relation holds for some queueing models, that is, the stationary queue length distribution of one system can be expressed as the product of a constant and the distribution of another system which is different only in the buffer capacity. Recently, the proportional relation has been verified for various discrete-time single-server queues with correlated arrivals, where it has been also shown that the proportional constant can be expressed in terms of the distribution of one system. This implies that the stationary queue length distribution of one system can be completely expressed in terms of the distribution of the other system. In this paper, we consider a generalized model of discrete-time single-server queue, which covers all previous ones, and give a simple and unified proof to the proportional relation as well as the expression of the proportional constant.     

关于Dini-Lipschitz型逼近定理的统一处理方法方法

This survey paper studies the approximation of (polynomial) processes for which the operator norms do not form a bounded sequence. In view of familiar direct estimates and quantitative uniform boundedness principles, a unified approach is given to results concerning the equivalence of Dini-Lipschitz-type conditions with (strong) convergence on (smoothness) classes. Emphasis is laid upon the necessity of these conditions, essential ingredients of the proofs are suitable modifications of the familiar gliding hump method. Apart from the classical results concerned with Fourier partial sums, explicit applications are treated for (trigonometric as well as algebralc) Lagrange interpolation, interpolatory quadrature rules based upon Jacobl knots, multipliers or strong convergence, and for Bochner-Riesz means of multivariate Fourier series for parameter values below the critical index.     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

A Unified Approach to Construct a Class of Daubechies Orthogonal Scaling Functions

We use Lorentz polynomials to give an efficient way to prove Daubechies’ results on the existence of spline type orthogonal scaling functions and to evaluate a class of Daubechies scaling functions in a unified approach.     

On Integrable Conditions of Generalized Almost Complex Structures

Generalized complex geometry is a new kind of geometrical structure which contains complex and symplectic geometry as its special cases. This paper gives the equivalence between the integrable conditions of a generalized almost complex structure in big bracket formalism and those in the general framework.