φ-强伪压缩映象隐迭代过程的收敛性分析

在任意Banach空间讨论了有限个φ-强伪压缩映射族隐迭代过程的收敛性问题.利用φ的性质和迭代过程本身的特性,得到了隐迭代过程收敛于公共不动点的若干结果.这些结果补充和推广了过去的研究成果.因此它丰富和发展了隐迭代法的理论.     

MODIFIED NEWTON＇S ALGORITHM FOR COMPUTING THE GROUP INVERSES OF SINGULAR TOEPLITZ MATRICES

Newton＇s iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton＇s iteration can be done efficiently. We show that the convergence of the modified Newton iteration is still very fast. Numerical results are presented to demonstrate the fast convergence of the proposed method.     

关于线性互补问题的模系矩阵分裂迭代方法

模系矩阵分裂迭代方法是求解大型稀疏线性互补问题的有效方法之一.本文的目标是归纳总结模系矩阵分裂迭代方法的最新发展和已有成果,主要内容包括相应的多分裂迭代方法, 二级多分裂迭代方法和两步多分裂迭代方法, 以及这些方法的收敛理论.     

On inexact Newton methods based on doubling iteration scheme for non‐symmetric algebraic Riccati equations

Newton iteration method can be used to find the minimal non‐negative solution of a certain class of non‐symmetric algebraic Riccati equations. However, a serious bottleneck exists in efficiency and storage for the implementation of the Newton iteration method, which comes from the use of some direct methods in exactly solving the involved Sylvester equations. In this paper, instead of direct methods, we apply a fast doubling iteration scheme to inexactly solve the Sylvester equations. Hence, a class of inexact Newton iteration methods that uses the Newton iteration method as the outer iteration and the doubling iteration scheme as the inner iteration is obtained. The corresponding procedure is precisely described and two practical methods of monotone convergence are algorithmically presented. In addition, the convergence property of these new methods is studied and numerical results are given to show their feasibility and effectiveness for solving the non‐symmetric algebraic Riccati equations. Copyright © 2010 John Wiley & Sons, Ltd.     

Preconditioned AHSS iteration method for singular saddle point problems

In this paper, for solving the singular saddle point problems, we present a new preconditioned accelerated Hermitian and skew-Hermitian splitting (AHSS) iteration method. The semi-convergence of this method and the eigenvalue distribution of the preconditioned iteration matrix are studied. In addition, we prove that all eigenvalues of the iteration matrix are clustered for any positive iteration parameters α and β. Numerical experiments illustrate the theoretical results and examine the numerical effectiveness of the AHSS iteration method served either as a preconditioner or as a solver.     

有限族非扩张映象的公共不动点的具误差和具扰动映射的迭代程序

本文在实一致凸和q-一致光滑Banach空间中研究了一类新的有限族非扩张映象的公共不动点的具误差和具扰动映射的显式迭代程序并且得到了一些收敛性定理.特别地,获得了该显式迭代程序强收敛性的充要条件.本文所得到结果推广了文[1]中的相应结果.     

Recent results on iteration theory: iteration groups and semigroups in the real case

In this survey paper we present some recent results in the iteration theory. Mainly, we focus on the problems concerning real iteration groups (flows) and semigroups (semiflows) such as existence, regularity and embeddability. We also discuss some issues associated to the problem of embedddability, i.e. iterative roots and approximate iterability. The topics of this paper are: (1) measurable iteration semigroups; (2) embedding of diffeomorphisms in regular iteration semigroups in \({{\mathbb{R}}^n}\) space; (3) iteration groups of fixed point free homeomorphisms on the plane; (4) embedding of interval homeomorphisms with two fixed points in a regular iteration group; (5) commuting functions and embeddability; (6) iterative roots; (7) the structure of iteration groups on an interval; (8) iteration groups of homeomorphisms of the circle; (9) approximately iterable functions; (10) set-valued iteration semigroups; (11) iterations of mean-type mappings; (12) Hayers–Ulam stability of the translation equation. Most of the results presented here was obtained by the means of functional equations. We indicate the relations between the iteration theory and functional equations.     

关于有限族Lipschitz映射多步Ishikawa迭代算法的收敛性及其应用

本文的目的是研究Lipschitz映射公共不动点问题.基于传统的Ishikawa迭代和Noor迭代方法,我们引入多步Ishikawa迭代算法,并且分别给出了该算法强收敛于有限族拟-Lipschitz映射和伪压缩映射公共不动点的充分必要条件.此外,我们证明了该算法强收敛到非扩张映射的公共不动点.作为应用,我们给出数值试验证实所得的结论.     

一类弱非线性方程组的Picard-MHSS迭代方法

修正的Hermite/反Hermite分裂(MHSS)迭代方法是一类求解大型稀疏复对称线性代数方程组的无条件收敛的迭代算法.基于非线性代数方程组的特殊结构和性质,我们选取Picard迭代为外迭代方法,MHSS迭代作为内迭代方法,构造了求解大型稀疏弱非线性代数方程组的Picard-MHSS和非线性MHSS-like方法.这两类方法的优点是不需要在每次迭代时均精确计算和存储Jacobi矩阵,仅需要在迭代过程中求解两个常系数实对称正定子线性方程组.除此之外,在一定条件下,给出了两类方法的局部收敛性定理.数值结果证明了这两类方法是可行、有效和稳健的.     

渐近伪压缩和渐近非扩张映像不动点的迭代逼近问题

研究了Banach空间中渐近伪压缩和渐近非扩张映像不动点的迭代逼近问题,改进和发展了张石生教授等人的相应结果.     

Solution of finite systems of equations by interval iteration

In actual practice, iteration methods applied to the solution of finite systems of equations yield inconclusive results as to the existence or nonexistence of solutions and the accuracy of any approximate solutions obtained. On the other hand, construction of interval extensions of ordinary iteration operators permits one to carry out interval iteration computationally, with results which can give rigorous guarantees of existence or nonexistence of solutions, and error bounds for approximate solutions. Examples are given of the solution of a nonlinear system of equations and the calculation of eigenvalues and eigenvectors of a matrix by interval iteration. Several ways to obtain lower and upper bounds for eigenvalues are given.Sponsored by the United States Army under Contract No. DAAG29-80-C-0041.     

非扩张映象有限族的公共不动点的隐式迭代方法

本文在实一致凸和q一致光滑Banach空间中研究了一类新的有限族非扩张映象的公共不动点的具误差和具扰动映射的隐式迭代程序并且得到了一些收敛性定理.特别地,获得了该隐式迭代程序强收敛性的充要条件.本文所得结论推广了文[1,2]中的相应结果.     

Termination criteria for inexact fixed‐point schemes

We analyze inexact fixed‐point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed‐point iteration. Important applications are the Picard iteration and partitioned fluid‐structure interaction. For the analysis, the iteration is modeled as a perturbed fixed‐point iteration, and existing analysis is extended to the nested case x = F ( S ( x )). We prove that if the iteration converges, it converges to the exact solution irrespective of the tolerance in the inner systems, provided that a nonstandard relative termination criterion is employed, whereas standard relative and absolute criteria do not have this property. Numerical results demonstrate the effectiveness of the approach with the nonstandard termination criterion. Copyright © 2015 John Wiley & Sons, Ltd.     

Inexact inverse subspace iteration for generalized eigenvalue problems

n this paper, we present an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax=λBx. We first formulate a version of inexact inverse subspace iteration in which the approximation from one step is used as an initial approximation for the next step. We then analyze the convergence property, which relates the accuracy in the inner iteration to the convergence rate of the outer iteration. In particular, the linear convergence property of the inverse subspace iteration is preserved. Numerical examples are given to demonstrate the theoretical results.     

利普希茨伪紧缩映射下的利普希茨摄动迭代的Bruck公式

在非线性分析中,处理伪紧缩算子及其变形的解(不动点)存在性和近似性,从而使演化方程的求解已经发展成为一个独立的理论.使用近似不动点技术,采用摄动迭代方法,目的是证明利普希茨伪紧缩映射序列的收敛性.该迭代方法适用于比利普希茨伪紧缩算子更一般的非线性算子以及Bruck迭代法无法证明其收敛性的情况.推广了Chidume和Zegeye的结果.     

ON HERMITIAN AND SKEW-HERMITIAN SPLITTING ITERATION METHODS FOR CONTINUOUS SYLVESTER EQUATIONS

We present a Hermitian and skew-Hermitian splitting (HSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semi-definite matrices. The unconditional convergence of the HSS iteration method is proved and an upper bound on the convergence rate is derived. Moreover, to reduce the computing cost, we establish an inexact variant of the HSS iteration method and analyze its convergence property in detail. Numerical results show that the HSS iteration method and its inexact variant are efficient and robust solvers for this class of continuous Sylvester equations.     

Generalized skew‐Hermitian triangular splitting iteration methods for saddle‐point linear systems

A generalized skew‐Hermitian triangular splitting iteration method is presented for solving non‐Hermitian linear systems with strong skew‐Hermitian parts. We study the convergence of the generalized skew‐Hermitian triangular splitting iteration methods for non‐Hermitian positive definite linear systems, as well as spectrum distribution of the preconditioned matrix with respect to the preconditioner induced from the generalized skew‐Hermitian triangular splitting. Then the generalized skew‐Hermitian triangular splitting iteration method is applied to non‐Hermitian positive semidefinite saddle‐point linear systems, and we prove its convergence under suitable restrictions on the iteration parameters. By specially choosing the values of the iteration parameters, we obtain a few of the existing iteration methods in the literature. Numerical results show that the generalized skew‐Hermitian triangular splitting iteration methods are effective for solving non‐Hermitian saddle‐point linear systems with strong skew‐Hermitian parts. Copyright © 2013 John Wiley & Sons, Ltd.     

一类非线性算子的带误差的Ishikawa迭代程序及其稳定性

建立了任意实Banach空间中带误差的Ishikawa迭代程序逼近Lipschitz强伪压缩算子的不动点的一般性定理,指出已被广泛广泛研究的Ishikawa迭代序列的稳定性问题仅是带误差的Ishikawa迭代程序的特例,作为直接的应用,用不同于通常的方法证得任意实Banach空间中的Ishikawa迭代序列关于Lipschitz强伪压缩算子是稳定的,这些推广或发展了近期许多相应的结果。     

Product-type skew-Hermitian triangular splitting iteration methods for strongly non-Hermitian positive definite linear systems

By further generalizing the modified skew-Hermitian triangular splitting iteration methods studied in [L. Wang, Z.-Z. Bai, Skew-Hermitian triangular splitting iteration methods for non-Hermitian positive definite linear systems of strong skew-Hermitian parts, BIT Numer. Math. 44 (2004) 363-386], in this paper, we present a new iteration scheme, called the product-type skew-Hermitian triangular splitting iteration method, for solving the strongly non-Hermitian systems of linear equations with positive definite coefficient matrices. We discuss the convergence property and the optimal parameters of this method. Moreover, when it is applied to precondition the Krylov subspace methods, the preconditioning property of the product-type skew-Hermitian triangular splitting iteration is analyzed in detail. Numerical results show that the product-type skew-Hermitian triangular splitting iteration method can produce high-quality preconditioners for the Krylov subspace methods for solving large sparse positive definite systems of linear equations of strong skew-Hermitian parts.     

Notes on the optimal variational iteration method

Here, various variational iteration algorithms are compared. An auxiliary parameter can be introduced in the iteration procedure, and can be identified optimally, which results in Turkyilmazoglu’s optimal variational iteration method. Some unknown auxiliary parameters can be also included in the initial solution, and can be optimally determined, that is Heri?anu and Marinca’s optimal variational iteration method.