时滞惯性流形及近似时滞惯性流形族

时滞惯性流形是对耗散系统惯性流形、近似惯性流形的最新发展,它基于对 大小涡分量间相互作用更细致的观察,即改变了惯性流形和近似惯性流形方法中大小 涡分量间相互作用为瞬时行为的隐含假定,而认为这种作用与系统的历史相关的．本 文结出了一类耗散系统时滞惯性流形的存在性证明,由于其存在性不需要“谱间隔条 件”保证,因而时滞惯性流形是广泛存在的．随后我们引出了一类离散的时滞惯性流 形,并在此基础上构造了一种近似时滞惯性流形族,分别给出了它们近似时滞惯性流 形的误差估计,结果显示这种新方法为构造稳定和高精度的算法提供了可能．     

Galerkin方法的一种简单后处理过程

基于近似惯性流形思想,以流函数形式定常Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程为例,给出了一种简单的后处理Ｇａｌｅｒｋｉｎ方法。其主要思想是利用近似惯性流形概念和对真解的一种新的分解,构造高低频分量间的近似作用规律。文中证明了这种简单的后处理Ｇａｌｅｒｋｉｎ方法可以较小的代价获得较经典Ｇａｌｅｒｋｉｎ方法高得多的精度。     

实对称带状矩阵逆特征值问题

研究了一类实对称带状矩阵逆特征值问题：给定三个互异实数λ,μ和v及三个非零实向量x,y和z,分别构造实对称五对角矩阵T和实对称九对角矩阵A,使其都具有特征对(λ,x),(μ,y)和(v,z)．给出了此类问题的两种提法,研究了问题的可解性以及存在惟一解的充分必要条件,最后给出了数值算法和数值例子．     

竖直毛细管中有限长液柱的粘性流体运动

本文考虑了竖直毛细管中具有两个自由面的有限长液柱的粘性流体运动.假设流体是牛顿的对边界条件进行线性化后,得到了小雷诺数情形下速度、压力和自由面形状的级数形式的分析表达式,对水和血液在多种液柱长度下求出了数值结果.分析表明在上下弯月面处有强回流.最大回流速度可达主流平均速度57%左右此外,本文还研究了惯性效应.采用时间相关的有限差分法求出了R_e=24.5时非线性方程的数值解.将此数值解和小雷诺数时的分析解进行比较表明,当R_e≤24.5时惯性效应不大.     

Accelerated hybrid and shrinking projection methods for variational inequality problems

ABSTRACT

In this paper, we introduce several new extragradient-like approximation methods for solving variational inequalities in Hilbert spaces. Our algorithms are based on Tseng's extragradient method, subgradient extragradient method, inertial method, hybrid projection method and shrinking projection method. Strong convergence theorems are established under appropriate conditions. Our results extend and improve some related results in the literature. In addition, the efficiency of our algorithms is shown through numerical examples which are defined by the hybrid projection methods.     

Multilevel algorithms for ill-posed problems

Summary In this paper new multilevel algorithms are proposed for the numerical solution of first kind operator equations. Convergence estimates are established for multilevel algorithms applied to Tikhonov type regularization methods. Our theory relates the convergence rate of these algorithms to the minimal eigenvalue of the discrete version of the operator and the regularization parameter. The algorithms and analysis are presented in an abstract setting that can be applied to first kind integral equations.Dedicated to Jim Bramble on the occasion of his sixtieth birthday     

Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings

In this article, we first introduce a modified inertial Mann algorithm and an inertial CQ-algorithm by combining the accelerated Mann algorithm and the CQ-algorithm with the inertial extrapolation, respectively. This strategy is intended to speed up the convergence of the given algorithms. Then we established the convergence theorems for two provided algorithms. For the inertial CQ-algorithm, the conditions on the inertial parameters are very weak. Finally, the numerical experiments are presented to illustrate that the modified inertial Mann algorithm and inertial CQ-algorithm may have a number of advantages over other methods in computing for some cases.     

An Inertial Semi-forward-reflected-backward Splitting and Its Application

Inertial methods play a vital role in accelerating the convergence speed of optimization algorithms. This work is concerned with an inertial semi-forward-reflected-backward splitting algorithm of approaching the solution of sum of a maximally monotone operator, a cocoercive operator and a monotone-Lipschitz continuous operator. The theoretical convergence properties of the proposed iterative algorithm are also presented under mild conditions. More importantly, we use an adaptive stepsize rule in...     

Modified extragradient algorithms for solving equilibrium problems

ABSTRACT

In this paper, we introduce some new algorithms for solving the equilibrium problem in a Hilbert space which are constructed around the proximal-like mapping and inertial effect. Also, some convergence theorems of the algorithms are established under mild conditions. Finally, several experiments are performed to show the computational efficiency and the advantage of the proposed algorithm over other well-known algorithms.     

STABILITY OF INERTIAL ALGORITHMS*

This paper describes some inertial algorithms for the approximation of nonlincar evolution equations and studies a priori estimates of the approximate solutiom and the stability of the inertial algorithms.     

电力系统中地网腐蚀诊断的一种新的数学模型及其仿真计算

对电力系统中具有重大应用价值的地网腐蚀诊断问题抽象出仿真求解的一种新的数学模型:即求解带约束的非线性隐式方程组模型.但由于问题本身的物理特性决定了所建立的数学模型具有以下特点:一是非线性方程组为欠定方程组,而且非线性程度非常高;二是方程组的所有函数均为隐函数;三是方程组附加若干箱约束条件.这种特性给模型分析与算法设计带来巨大困难.对于欠定方程组的求解,文中根据工程实际背景,尽可能地扩充方程的个数,使之成为超定方程组,然后对欠定方程组和超定方程组分别求解并进行比较.将带约束的非线性隐函数方程组求解问题,转化为无约束非线性最小二乘问题,并采用矩阵求导等技术和各种算法设计技巧克服隐函数的计算困难,最后使用拟牛顿信赖域方法进行计算.大量的计算实例表明,文中所提出的数学模型及求解方法是可行的.与目前广泛采用的工程简化模型相比较,在模型和算法上具有很大优势.     

New algorithms for the split variational inclusion problems and application to split feasibility problems

ABSTRACT

In this paper, we suggest two new iterative methods for finding an element of the solution set of split variational inclusion problem in real Hilbert spaces. Under suitable conditions, we present weak and strong convergence theorems for these methods. We also apply the proposed algorithms to study the split feasibility problem. Finally, we give some numerical results which show that our proposed algorithms are efficient and implementable from the numerical point of view.     

N-S方程一般近似惯性流形构造和逼近

1．引言为了用有限维常微分方程来研究Navier七lobes（N七）方程的长时间动力学行为,Foias,Sell和Temaml］引入了耗散系统惯性流形的概念．但惯性流形存在的一个相当苛刻的条件一谱间隔条件一是包括N习方程在内的很多耗散系统无法满足的．因此,Foias,Manlea和TemamZ］随后又提出了近似惯性流形的概念．近似惯性流形也是一个光滑的Lipschitz流形,所有原方程的解在时间充分大时,将被吸引进入该流形的一个三邻域中．因其存在性不需要谱间隔条件来保证,从而可证明包括N－S方程在内的一大类耗散系统存在近似惯性流形．利用近似惯性…     

一类凸二次规划的新算法

本文给出了求解一类凸二次规划问题的新算法.这种算法既保留了传统算法的优点,又避免了其它算法中出现的添加人工变量过多、循环等问题.算例表明,这种算法是简便而有效的.     

An inertial shrinking projection algorithm for split common fixed point problems

In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are obtained without the assumption of semi-compactness on mappings. Finally, some numerical examples are presented to illustrate the results in this paper.     

A third order,semi-explicit method in the numerical solution of first kind Volterra integral equations

We present a new numerical method for the solution of nonsingular Volterra integral equations of the first kind. It belongs to a new class of methods that are semi-explicit, provide self-starting algorithms and possess favourable stability properties. The third order convergence of the particular method exhibited is established, under suitable conditions, and numerical results are illustrated.     

非线性不等式与等式约束的多目标规划问题的区间极大熵方法

利用极大熵方法将带多个非线性不等式约束和多个非线性等式约束的多目标规划问题变为两个非线性不等式约束的单个可微的目标函数优化问题,并结合区间分析知识给出一种新的解决多目标规划问题的区间方法.     

An iterative approach to solve multiobjective linear fractional programming problems

This paper suggests an iterative parametric approach for solving multiobjective linear fractional programming (MOLFP) problems which only uses linear programming to obtain efficient solutions and always converges to an efficient solution. A numerical example shows that this approach performs better than some existing algorithms. Randomly generated MOLFP problems are also solved to demonstrate the performance of new introduced algorithm.     

Competitive analysis of online inventory problem with interrelated prices

This paper investigates the online inventory problem with interrelated prices in which a decision of when and how much to replenish must be made in an online fashion even without concrete knowledge of future prices.Four new online models with different price correlations are proposed in this paper,which are the linear-decrease model,the log-decrease model,the logarithmic model and the exponential model.For the first two models,the online algorithms are developed,and as the performance measure of online algorithm,the upper and lower bounds of competitive ratios of the algorithms are derived respectively.For the exponential and logarithmic models,the online algorithms are proposed by the solution of linear programming and the corresponding competitive ratios are analyzed,respectively.Additionally,the algorithm designed for the exponential model is optimal,and the algorithm for the logarithmic model is optimal only under some certain conditions.Moreover,some numerical examples illustrate that the algorithms based on the dprice-conservative strategy are more suitable when the purchase price fluctuates relatively flat.     

Local and parallel finite element algorithms based on two-grid discretizations

A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorithms are motivated by the observation that, for a solution to some elliptic problems, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. The theoretical tools for analyzing these methods are some local a priori and a posteriori estimates that are also obtained in this paper for finite element solutions on general shape-regular grids. Some numerical experiments are also presented to support the theory.