Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces

In recent years, Landweber iteration has been extended to solve linear inverse problems in Banach spaces by incorporating non-smooth convex penalty functionals to capture features of solutions. This method is known to be slowly convergent. However, because it is simple to implement, it still receives a lot of attention. By making use of the subspace optimization technique, we propose an accelerated version of Landweber iteration with non-smooth convex penalty which significantly speeds up the method. Numerical simulations are given to test the efficiency.     

解强刚性块线代数方程组的两类L-收敛迭代法

对解强刚性块线代数方程组X=(A(?)J)X φ,本文提出了L-收敛的最佳单参数迭代法(L-OOPI)和L-收敛的多参数迭代直接法(L-MPID),并给出了数值例子．数例表明,对于强刚性块线代数方程组,该二迭代法是有效的．     

用带误差项的Ishikawa迭代过程逼近φ-强增生算子的零点

本文使用新的分析技巧研究了一致光滑Ｂａｎａｃｈ空间中φ 强增生算子的零点逼近问题，所得结果改进和扩展了近期许多相应的结果     

R^N中—（p,q）-Laplacian拟线性椭圆方程组正解的存在性和多重性

研究了—（p,q）-Laplacian拟线性椭圆方程组.当连续函数V和W在两种情形下,利用Moser迭代技巧和Ljusternik-Schnirelmann畴数理论,建立了方程组正解的存在性和多重性结果.     

线性方程组异步并行迭代法的舍入误差分析

本文对求解大型线性方程组的异步并行迭代法进行了浮点运算的舍入误差分析,给出了算法是向前稳定的充分条件.     

双层网格圆底扁球壳的非线性稳定问题

从基于等效夹层壳思想的双层网格扁壳,非线性弯曲理论的变分方程出发,利用坐标变换方法和驻值余能原理,导出双层网格圆底扁球壳,在均布压力作用下的轴对称大挠度方程和边界条件．采用修正迭代法,求得了两类边界条件下双层网格圆底扁球壳的非线性载荷-位移关系式和临界屈曲载荷的解析表达式,并讨论了几何参数对临界屈曲载荷的影响．     

Newton's method on Riemannian manifolds: covariant alpha theory

In this paper, Smale's theory is generalized to the contextof intrinsic Newton iteration on geodesically complete analyticRiemannian and Hermitian manifolds. Results are valid for analyticmappings from a manifold to a linear space of the same dimension,or for analytic vector fields on the manifold. The invariant is defined by means of high-order covariant derivatives. Boundson the size of the basin of quadratic convergence are given.If the ambient manifold has negative sectional curvature, thosebounds depend on the curvature. A criterion of quadratic convergencefor Newton iteration from the information available at a pointis also given.     

Comparison Results Between Preconditioned Jacobi and the AOR Iterative Method

The large scale linear systems with M-matrices often appear in a wide variety of areas of physical,fluid dynamics and economic sciences.It is reported in[1]that the convergence rate of the IMGS method,with the preconditioner I S_α,is superior to that of the basic SOR iterative method for the M-matrix.This paper considers the preconditioned Jacobi(PJ)method with the preconditioner P=I S_α S_β,and proves theoretically that the convergence rate of the PJ method is better than that of the basic AOR method.Numerical examples are provided to illustrate the main results obtained.     

Sub-iteration leads to accuracy and stability enhancements of semi-implicit schemes for the Navier–Stokes equations

We present an iterative semi-implicit scheme for the incompressible Navier–Stokes equations, which is stable at CFL numbers well above the nominal limit. We have implemented this scheme in conjunction with spectral discretizations, which suffer from serious time step limitations at very high resolution. However, the approach we present is general and can be adopted with finite element and finite difference discretizations as well. Specifically, at each time level, the nonlinear convective term and the pressure boundary condition – both of which are treated explicitly in time – are updated using fixed-point iteration and Aitken relaxation. Eigenvalue analysis shows that this scheme is unconditionally stable for Stokes flows while numerical results suggest that the same is true for steady Navier–Stokes flows as well. This finding is also supported by error analysis that leads to the proper value of the relaxation parameter as a function of the flow parameters. In unsteady flows, second- and third-order temporal accuracy is obtained for the velocity field at CFL number 5–14 using analytical solutions. Systematic accuracy, stability, and cost comparisons are presented against the standard semi-implicit method and a recently proposed fully-implicit scheme that does not require Newton’s iterations. In addition to its enhanced accuracy and stability, the proposed method requires the solution of symmetric only linear systems for which very effective preconditioners exist unlike the fully-implicit schemes.     

临界或超临界增长分数阶Schrodinger-Poisson方程正解的存在性

本文研究如下分数阶Schrodinger-Poisson方程{(-△)^su+Vx(u)+K(x)φu=f(u)+λ|u|^q-2ux∈R³,(-△)^tφ=K(x)u²,x∈R³其中S∈(3/4,1),t∈(0,1),f是在原点超线性无穷远次临界的连续非线性项,指数q≥2_s^*=6/3-2x.当λ>0充分小时,我们利用变分方法证明上述问题正解的存在性.本文的主要贡献是处理了超临界情形.