GPSD迭代法和Jacobi迭代法的敛散关系

证明了当Jacobi迭代矩阵B非负时,解线性方程组Ax=b(A为不可约矩阵)的GPSD迭代法(0＜ωi＜Ti≤1,i=1,2,…,n)和Jacobi迭代法同时敛散,给出了其谱半径p(ST,Ω)和ρ(B)之间的关系.     

A convergence analysis of nonlinear implicit iterative method for nonlinear ill-posed problems

Implicit iterative method acquires good effect in solving linear ill-posed problems. We have ever applied the idea of implicit iterative method to solve nonlinear ill-posed problems, under the restriction that α is appropriate large, we proved the monotonicity of iterative error and obtained the convergence and stability of iterative sequence, numerical results show that the implicit iterative method for nonlinear ill-posed problems is efficient. In this paper, we analyze the convergence and stability of the corresponding nonlinear implicit iterative method when α_k are determined by Hanke criterion.     

无穷区间上一类分数阶微分方程正解的显式迭代序列

By applying the monotone iterative method,this study develops two explicit monotone iterative sequences for approximating the minimal and maximal positive solutions.At the same time,by applying the Banach fixed-point theory,an explicit iterative sequence and error estimate for approximating the unique positive solution is obtained.Some examples are given to illustrate the application of the results.     

Φ-伪压缩映象带混合型误差的迭代序列的强稳定性

引入带混合型误差的 Ishikawa和 Mann迭代序列 ,在没有 D是有界闭集与多值映象 T是一致连续的较弱条件下 ,在实 Banach空间中研究了多值Φ -伪压缩映象不动点的带混合型误差的 Ishikawa和 Mann迭代序列的逼近问题 ,使用与文献完全不同的方法 ,建立了带混合型误差的 Ishikawa和 Mann迭代序列的强稳定性定理 ,从而统一和发展了几位作者早期与最近的相关结果 .     

Numerical analysis for the quadratic matrix equations from a modification of fixed‐point type

In this paper, we study the quadratic matrix equations. To improve the application of iterative schemes, we use a transform of the quadratic matrix equation into an equivalent fixed‐point equation. Then, we consider an iterative process of Chebyshev‐type to solve this equation. We prove that this iterative scheme is more efficient than Newton's method. Moreover, we obtain a local convergence result for this iterative scheme. We finish showing, by an application to noisy Wiener‐Hopf problems, that the iterative process considered is computationally more efficient than Newton's method.     

Picard’s iterative method for nonlinear advection-reaction-diffusion equations

Picard’s iterative method for the solution of nonlinear advection-reaction-diffusion equations is formulated and its convergence proved. The method is based on the introduction of a complete metric space and makes uses of a contractive mapping and Banach’s fixed-point theory. From Picard’s iterative method, the variational iteration method is derived without making any use at all of Lagrange multipliers and constrained variations. Some examples that illustrate the advantages and shortcomings of the iterative procedure presented here are shown.     

关于解线性系统的一个有效的贝叶斯迭代方法

This paper concerns with the statistical methods for solving general linear systems. After a brief review of Bayesian perspective for inverse problems,a new and efficient iterative method for general linear systems from a Bayesian perspective is proposed.The convergence of this iterative method is proved,and the corresponding error analysis is studied.Finally, numerical experiments are given to support the efficiency of this iterative method,and some conclusions are obtained.     

Meromorphic iterative roots of linear fractional functions

Iterative root problem can be regarded as a weak version of the problem of embedding a homeomorphism into a flow. There are many results on iterative roots of monotone functions. However, this problem gets more diffcult in non-monotone cases. Therefore, it is interesting to find iterative roots of linear fractional functions (abbreviated as LFFs), a class of non-monotone functions on ℝ. In this paper, iterative roots of LFFs are studied on ℂ. An equivalence between the iterative functional equation for non-constant LFFs and the matrix equation is given. By means of a method of finding matrix roots, general formulae of all meromorphic iterative roots of LFFs are obtained and the precise number of roots is also determined in various cases. As applications, we present all meromorphic iterative roots for functions z and 1/z. This work was supported by the Youth Fund of Sichuan Provincial Education Department of China (Grant No. 07ZB042)     

求解带非线性边界条件的反应扩散方程数值解的组合迭代方法

1　引　　言我们首先考虑如下抛物型方程ｕｔ-ＤΔｕ =ｆ(ｘ ,ｔ ,ｕ) (ｔ∈ ( 0 ,Ｔ],ｘ∈Ω ) ｕ/ ν+ βｕ =ｇ(ｘ ,ｔ ,ｕ) (ｔ∈ ( 0 ,Ｔ],ｘ∈ Ω )ｕ(ｘ ,0 ) =ψ(ｘ) (ｘ∈Ω )( 1 .1 )其中Ｔ为正常数 ,Ω 是ＲＰ 空间的有界区域 记ＱＴ=Ω × ( 0 ,Ｔ],ＳＴ= Ω × ( 0 ,Ｔ],假设在ＱＴ上Ｄ≡ｄ(ｘ ,ｔ) >0 ,在ＳＴ 上β≡β(ｘ ,ｔ)≥ 0 又设 ｆ(ｘ ,ｔ,ｕ) ,ｇ(ｘ ,ｔ,ｕ)为关于ｕ的非线性函数 ,且对ｘ ,ｔ各参数满足Ｈ¨ｏｌｄｅｒ连续条件 将 ( 1 .1 )离散化之后我们得到相应的有限差分系统 ,当 ｇ(ｘ ,ｔ,ｕ)为ｕ的线性…     

中立型脉冲发展方程解的存在性和唯一性

本文研究了一类非线性中立型脉冲发展方程解的存在性和唯一性的问题.利用迭代分析方法结合半群理论的知识,得到了其解的表达式,并构造解的迭代序列,同时证明了其解的存在性和唯一性.通过研究发现其解的存在性和唯一性与脉冲时滞条件密不可分,利用迭代分析法求解此类问题具有一定的优越性.     

NEWTON迭代法的一个改进

从N EW TON迭代法和中值定理“中值点”的渐近性出发,给出了N EW TON迭代法的一个改进.研究表明,本文定理对于探讨迭代法的改进有着十分重要的作用.     

预测式迭代方法──一种新的迭代思想

本文以Ｎｅｗｔｏｎ迭代法为基础，从几何解释出发，给出了一种加快迭代速度的新方法（暂称为“预测式迭代方法”）。其定义不仅在于方法本身有很好的实用价值，更重要的是，它提供了一种加速迭代的新思想。     

一类块三对角阵特征值的求解及应用

提出了求一类块三对角矩阵A的特征值和特征向量的方法,求得了该类矩阵的特征值和特征向量的表达式,并写出了用迭代法解该类方程组Au=f时迭代矩阵的特征值.     

非Hermitian正定线性方程组的外推的HSS迭代方法

为了高效地求解大型稀疏非Hermitian正定线性方程组，在白中治、Golub和Ng提出的Hermitian和反Hermitian分裂（HSS）迭代法的基础上，通过引入新的参数并结合迭代法的松弛技术，对HSS迭代方法进行加速，提出了一种新的外推的HSS迭代方法（EHSS），并研究了该方法的收敛性.数值例子表明：通过参数值的选择，新方法比HSS方法具有更快的收敛速度和更少的迭代次数，选择了合适的参数值后，可以提高HSS方法的收敛效率.     

Monotone Convergence of Iterative Methods for Singular Linear Systems

In this paper, monotonicity of iterative methods for solving general solvable singularly systems is discussed. The monotonicity results given by Berman, Plemmons, and Semal are generalized to singular systems. It is shown that for an iterative method introduced by a nonnegative splitting of the coefficient matrix there exist some initial guesses such that the iterative sequence converges towards a solution of the system from below or from above. The monotonicity of the block Gauss-Seidel method for solving a p-cyclic system and Markov chain is considered.     

Block s‐step Krylov iterative methods

Block (including s‐step) iterative methods for (non)symmetric linear systems have been studied and implemented in the past. In this article we present a (combined) block s‐step Krylov iterative method for nonsymmetric linear systems. We then consider the problem of applying any block iterative method to solve a linear system with one right‐hand side using many linearly independent initial residual vectors. We present a new algorithm which combines the many solutions obtained (by any block iterative method) into a single solution to the linear system. This approach of using block methods in order to increase the parallelism of Krylov methods is very useful in parallel systems. We implemented the new method on a parallel computer and we ran tests to validate the accuracy and the performance of the proposed methods. It is expected that the block s‐step methods performance will scale well on other parallel systems because of their efficient use of memory hierarchies and their reduction of the number of global communication operations over the standard methods. Copyright © 2009 John Wiley & Sons, Ltd.     

Acceleration procedures for matrix iterative methods

In this paper, several procedures for accelerating the convergence of an iterative method for solving a system of linear equations are proposed. They are based on projections and are closely related to the corresponding iterative projection methods for linear systems.     

A two-step Steffensen's method under modified convergence conditions

A simplification of a third order iterative method is proposed. The main advantage of this method is that it does not need to evaluate neither any Fréchet derivative nor any bilinear operator. A semilocal convergence theorem in Banach spaces, under modified Kantorovich conditions, is analyzed. A local convergence analysis is also performed. Finally, some numerical results are presented.     

非线性最小二乘问题的一种迭代解法

本文给出了求解非线性最小二乘问题的一种迭代解法 ,即由已知节点数据 (xi,yi) (i=1 ,2 ,… ,m)求函数 y=f(x,b1,b2 ,… ,bn)中非线性参数 b1,b2 ,… ,bn 的一种迭代解法 .并用实际算例的结果说明了该迭代解法优于一般线性化方法 ,说明了该种方法在实际工程领域中的应用     

Real valued iterative methods for solving complex symmetric linear systems

Complex valued systems of equations with a matrix R + 1S where R and S are real valued arise in many applications. A preconditioned iterative solution method is presented when R and S are symmetric positive semi‐definite and at least one of R, S is positive definite. The condition number of the preconditioned matrix is bounded above by 2, so only very few iterations are required. Applications when solving matrix polynomial equation systems, linear systems of ordinary differential equations, and using time‐stepping integration schemes based on Padé approximation for parabolic and hyperbolic problems are also discussed. Numerical comparisons show that the proposed real valued method is much faster than the iterative complex symmetric QMR method. Copyright © 2000 John Wiley & Sons, Ltd.