首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7篇
  国内免费   1篇
  完全免费   1篇
  数学   9篇
  2018年   2篇
  2017年   1篇
  2014年   1篇
  2011年   1篇
  2009年   1篇
  2007年   2篇
  1997年   1篇
排序方式: 共有9条查询结果,搜索用时 171 毫秒
1
1.
Approximation of fixed points of a strictly pseudocontractive mapping   总被引:16,自引:0,他引:16  
A fixed point of the strictly pseudocontractive mapping is obtained as the limit of an iteratively constructed sequence with error estimation in general Banach spaces.

  相似文献

2.
The paper uses Euclidean Jordan algebras as a basic tool to extend smoothing functions, which include the Chen-Mangasarian class and the Fischer-Burmeister smoothing functions, to symmetric cone complementarity problems. Computable formulas for these functions and their Jacobians are derived. In addition, it is shown that these functions are Lipschitz continuous with respect to parameter # and continuously differentiable on J × J for any μ 〉 0.  相似文献
3.
本文提出了一个求解非凸半定规划的非线性Lagrange算法,当二阶充分条件以及严格互补条件成立时,证明了这一算法的收敛性定理.收敛结果表明,当惩罚参数小于某个阀值时,算法是局部收敛的;此外,还给出了解的一个依赖于惩罚参数的误差界.  相似文献
4.
令n 为qm -1 的正因子. 本文主要借助特征标、分圆类及Gauss 周期的知识确定了GF(q) 上码长为n、维数为m 的不可约循环码在一些特殊情形下的权重分布, 这些不可约循环码为二权、三权或是四权码.  相似文献
5.
The purpose in this paper is to prove a theorem of strong convergence to a common solution for a finite family of accretive operators in a strictly convex Banach space by means of a new iterative algorithm, which is a generalization and extension of the results of Kim and Xu [T.H. Kim, H.K. Xu, Strong convergence of modified Mann iterations, Nonlinear Anal. 61 (2005) 51–60], and Zegeye and Shahzad [H. Zegeye, N. Shahzad, Strong convergence theorems for a common zero of a finite family of m-accretive mappings, Nonlinear Anal. 66 (2007) 1161–1169]. Further using the result, the theorem of strong convergence to a common fixed point is discussed for a finite family of pseudocontractive mappings under certain conditions.  相似文献
6.
In this paper, we consider a single-server multi-queue polling system with unlimited-size batch service (so called ‘Israeli queue’) operating in a multi-phase random environment. The polling system consists of a service region and a waiting region, and the external environment evolves through time, i.e., when the external environment is in state i, after a period time, it stays in this state or makes a transition from this state to its adjacent ones. By using matrix analytic method and spectral expansion method, stationary probabilities are derived for computations of performance measures and the conditional waiting times of customers in waiting region. In addition, some numerical examples are presented to show the impact of parameters on performance measures.  相似文献
7.
In this paper, we consider a new class of the GI/M/1 queue with single working vacation and vacations. When the system become empty at the end of each regular service period, the server first enters a working vacation during which the server continues to serve the possible arriving customers with a slower rate, after that, the server may resume to the regular service rate if there are customers left in the system, or enter a vacation during which the server stops the service completely if the system is empty. Using matrix geometric solution method, we derive the stationary distribution of the system size at arrival epochs. The stochastic decompositions of system size and conditional system size given that the server is in the regular service period are also obtained. Moreover, using the method of semi-Markov process (SMP), we gain the stationary distribution of system size at arbitrary epochs. We acquire the waiting time and sojourn time of an arbitrary customer by the first-passage time analysis. Furthermore, we analyze the busy period by the theory of limiting theorem of alternative renewal process. Finally, some numerical results are presented.  相似文献
8.
This paper deals with an M / G / 1 queue with vacations and multiple phases of operation. If there are no customers in the system at the instant of a service completion, a vacation commences, that is, the system moves to vacation phase 0. If none is found waiting at the end of a vacation, the server goes for another vacation. Otherwise, the system jumps from phase 0 to some operative phase i with probability \(q_i\), \(i = 1,2, \ldots ,n.\) In operative phase i, \(i = 1,2, \ldots ,n\), the server serves customers according to the discipline of FCFS (First-come, first-served). Using the method of supplementary variables, we obtain the stationary system size distribution at arbitrary epoch. The stationary sojourn time distribution of an arbitrary customer is also derived. In addition, the stochastic decomposition property is investigated. Finally, we present some numerical results.  相似文献
9.
This paper deals with the problem of finding minimum‐norm fixed point of nonexpansive mappings. We present two types of iteration methods (one is implicit, and the other is explicit). We establish strong convergence theorems for both methods. Some applications are given regarding convex optimization problems and split feasibility problems. These results improve some known results existing in the literatures. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号