Visco-penalization of the sum of two monotone operators

A new type of approximating curve for finding a particular zero of the sum of two maximal monotone operators in a Hilbert space is investigated. This curve consists of the zeros of perturbed problems in which one operator is replaced with its Yosida approximation and a viscosity term is added. As the perturbation vanishes, the curve is shown to converge to the zero of the sum that solves a particular strictly monotone variational inequality. As an off-spring of this result, we obtain an approximating curve for finding a particular zero of the sum of several maximal monotone operators. Applications to convex optimization are discussed.     

Levitin–Polyak well-posedness of generalized quasivariational inequalities with functional constraints

In this paper, we study Levitin–Polyak type well-posedness for generalized quasivariational inequality problems with explicit constraints. Four types of Levitin–Polyak well-posedness will be introduced. Various criteria and characterizations will be derived for these types of Levitin–Polyak well-posedness.     

Modified form of binary and ternary 3-point subdivision schemes

Binary 3-point scheme, developed by Hormann and Sabin [Hormann, K. and Sabin, Malcolm A., 2008, A family of subdivision schemes with cubic precision, Computer Aided Geometric Design, 25, 41-52], has been modified by introducing a tension parameter which generates a family of C¹ limiting curves for certain range of tension parameter. Ternary 3-point scheme, introduced by Siddiqi and Rehan [Siddiqi, Shahid S. and Rehan, K., 2009, A ternary three point scheme for curve designing, International Journal of Computer Mathematics, In Press, DOI: 10.1080/00207160802428220], has also been modified by introducing a tension parameter which generates family of C¹ and C² limiting curves for certain range of tension parameter. Laurent polynomial method is used to investigate the continuity of the subdivision schemes. The performance of modified schemes has been demonstrated by considering different examples along with its comparison with the established subdivision schemes.     

Statistical and Geometrical Way of Model Selection for a Family of Subdivision Schemes

The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes(for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes.     

一类新的(2n-1)点二重动态逼近细分

利用正弦函数构造了一类新的带有形状参数ω的(2n-1)点二重动态逼近细分格式.从理论上分析了随n值变化时这类细分格式的C~k连续性和支集长度;算法的一个特色是随着细分格式中参数ω的取值不同,相应生成的极限曲线的表现张力也有所不同,而且这一类算法所对应的静态算法涵盖了Chaikin,Hormann,Dyn,Daniel和Hassan的算法.文末附出大量数值实例,在给定相同的初始控制顶点,且极限曲线达到同一连续性的前提下和现有几种算法做了比较,数值实例表明这类算法生成的极限曲线更加饱满,表现力更强.     

强Z-连续domain和Z-代数domain的刻画定理

给出强Z-连续domain和Z-代数domain的一个刻画及一个范畴性质--余反射性质.     

APPROXIMATING ANALYSIS OF A KIND OF REPAIRABLE STANDBY SYSTEMS

ＬＩＷＥＩ（李伟）；ＣＡＯＪＩＮＨＵＡ（曹晋华）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ，Ｂｅｉｊｉｎｇ１０００８０，ＣｈｉｎａａｎｄＡｓｉａ－ＰａｃｉｆｉｃＯｐｅｒａｔｉｏ...     

W空间中有界线性算子的最佳逼近及其应用

１．引言 对线性算子的有限秩算子逼近是最经典的问题．并且它的应用极广．如数值积分公式、函数的逼近、数值原函数、方程的数值解法等．１９８６年,在文［１］中,首次给出了在再生核空间中函数的最佳逼近算子（恒等算子的有限秩算子逼近）．之后;在文［２］中给出了数值原函数．又在文［３］、［５］、［６］等中利用有限秩算子逼近（并非是最佳逼近）给出了一些方程的数值解法．但这些讨论都是在一元函数空间上只对特殊算子进行的．１９９７年,虽然在文［４］中给出了完备的二元再生核空间及二元函数的最佳逼近插值算子．但是对多元…     

On the numerical solution of the generalized Prandtl equation using variation-diminishing splines

Convergence results are proved for Cauchy principal value integrals of the Schoenberg variation-diminishing splines and its first derivative. The use of such splines in the numerical solution of the Prandtl and generalized Prandtl integral equations is proposed. A Nyström-type method and a modified Nyström method are used and compared computationally.     

Levitin–Polyak Well-Posedness of Vector Variational Inequality Problems with Functional Constraints

The Levitin–Polyak well-posedness for a constrained problem guarantees that, for an approximating solution sequence, there is a subsequence which converges to a solution of the problem. In this article, we introduce several types of (generalized) Levitin–Polyak well-posednesses for a vector variational inequality problem with both abstract and functional constraints. Various criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posednesses are presented.