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.     

On the numerical solution of Korteweg-de Vries equation by the iterative splitting method

In this paper, we apply the method of iterative operator splitting on the Korteweg-de Vries (KdV) equation. The method is based on first, splitting the complex problem into simpler sub-problems. Then each sub-equation is combined with iterative schemes and solved with suitable integrators. Von Neumann analysis is performed to achieve stability criteria for the proposed method applied to the KdV equation. The numerical results obtained by iterative splitting method for various initial conditions are compared with the exact solutions. It is seen that they are in a good agreement with each other.     

一类Riccati矩阵方程广义自反解的双迭代算法

本文研究了一类Riccati矩阵方程广义自反解的数值计算问题.利用牛顿算法将Riccati矩阵方程的广义自反解问题转化为线性矩阵方程的广义自反解或者广义自反最小二乘解问题,再利用修正共轭梯度法计算后一问题,获得了求Riccati矩阵方程的广义自反解的双迭代算法.拓宽了求解非线性矩阵方程的迭代算法.数值算例表明双迭代算法是有效的.     

求解非线性算子方程的加速迭代格式

研究非线性算子方程的近似求解方法.首先对通常的求解非线性方程加速迭代格式进行推广,得到高阶收敛速度的加速迭代格式,最后把这种加速迭代格式推广到非线性算子方程的求解中去,利用非线性算子的渐进展开,证明了这种加速格式具有三阶的收敛速度.     

椭圆轨道真近点角的级数计算方法

用级数展开方法得到真近点角超越方程,由迭代法求真近点角与时间的关系,讨论迭代收敛的充分条件．对于不满足迭代收敛充分条件情形,列写偏近点角超越方程,用迭代法求偏近点角变化规律,用数值积分方法求出真近点角与时间的关系,指出所有椭圆轨道都满足偏近点角迭代收敛的充分条件．讨论小偏心率椭圆轨道真近点角近似超越方程,由迭代法求真近点角与时间的关系．数值模拟结果表明该方法的有效性．     

Sylvester矩阵方程极小范数最小二乘解的迭代解法

研究了Sylvester矩阵方程最小二乘解以及极小范数最小二乘解的迭代解法,首先利用递阶辨识原理,得到了求解矩阵方程AX+YB=C的极小范数最小二乘解的一种迭代算法,进而,将这种算法推广到一般线性矩阵方程A_iX_iB_i=C的情形,最后,数值例子验证了算法的有效性.     

一类非线性矩阵方程对称解的双迭代算法

利用逆矩阵的Neumann级数形式,将在Schur插值问题中遇到的含未知矩阵二次项之逆的非线性矩阵方程转化为高次多项式矩阵方程,然后采用牛顿算法求高次多项式矩阵方程的对称解,并采用修正共轭梯度法求由牛顿算法每一步迭代计算导出的线性矩阵方程的对称解或者对称最小二乘解,建立求非线性矩阵方程的对称解的双迭代算法.双迭代算法仅要求非线性矩阵方程有对称解,不要求它的对称解唯一,也不对它的系数矩阵做附加限定.数值算例表明,双迭代算法是有效的.     

含高次逆幂的矩阵方程对称解的双迭代算法

本文研究了在控制理论和随机滤波等领域中遇到的一类含高次逆幂的矩阵方程的等价矩阵方程对称解的数值计算问题.采用牛顿算法求等价矩阵方程的对称解,并采用修正共轭梯度法求由牛顿算法每一步迭代计算导出的线性矩阵方程的对称解或者对称最小二乘解,建立了求这类矩阵方程对称解的双迭代算法,数值算例验证了双迭代算法是有效的.     

多孔介质二相驱动问题一种修正特征有限元方法的迭代解法及其收敛性分析

0 引言 多孔介质二相驱动问题的数学模型是由压力方程与浓度方程组成的偏微分方程组的初边值问题.关于该问题的数值解问题,已有大量的文献.为了得到最优的L~2-模误差估计,好多方法用混合元方法解压力方程.我们知道,混合元法得到的方程组系数矩阵是非正定的,从而解混合元比解标准元要困难得多,虽然许多人研究了混合元方法的求解问题,但到目前为止,还没有看到令人满意的好的算法.为了避开对混合元的求解,著名学者T.F.Russell考虑了用标准有限元方法解压力方程,用特征有限元方法解浓度方程的求解方法及其迭代解法,对只有分子扩散的二相驱动问题得到了最优的L~2模误差估计,对有机械弥散的一般二相驱动问题得不到最优的L~2模误差估计,同时在收敛性证明中要求压力有限元空间的指数至少是二.     

求解热传导反问题的一种正则化Newton型迭代法

讨论热传导方程求解系数的一个反问题．把问题归结为一个非线性不适定的算子方程后,考虑该方程的Newton型迭代方法．对线性化后的Newton方程用隐式迭代法求解,关键的一步是引入了一种新的更合理的确定(内)迭代步数的后验准则．对新方法及对照的Tikhonov方法和Bakushiskii方法进行了数值实验,结果显示了新方法具有明显的优越性．     

求解2—D波动方程系数反问题的迭代方法及收敛性

本文针对地震勘探中提出一类重要的２－Ｄ波动方程反演问题，通过定义一个新的非线性算子将２－Ｄ波动方程的反演问题归结为一个新的非线性算子方程，详细讨论了非线性算子的性质，给出了求解反问题的迭代方法，并证明了这种迭代方法的收敛性。     

An iterative method based on equation decomposition for the fourth‐order singular perturbation problem

In this article, we propose an iterative method based on the equation decomposition technique ( 1 ) for the numerical solution of a singular perturbation problem of fourth‐order elliptic equation. At each step of the given method, we only need to solve a boundary value problem of second‐order elliptic equation and a second‐order singular perturbation problem. We prove that our approximate solution converges to the exact solution when the domain is a disc. Our numerical examples show the efficiency and accuracy of our method. Our iterative method works very well for singular perturbation problems, that is, the case of 0 < ε ? 1, and the convergence rate is very fast. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

H-非线性方程组的一种高效迭代解法

１．引言满足参见（［５］）（１．１）的任一非线性刚性函数ｆ（ｙ）：所产生的非线性方程组称之为由 ｆ（ｙ）产生的 Ｈ－非线性方程组,其中 Ａ,Ａ１为与 ｆ（ｙ）的刚性无关的常数,最多为中等大小;的第ｉ个特征值;常数,或者ｖ＞０且最多为中等大小;所谓“中等大小”是指与。相比较而言的;显然,已知;ａ,ｂ,ｃ,ｄ满足且均为常数,（１．２）是由混合（Ｈｙｂｒｉｄ）法解初值问题导出的,其中 ｈ是积分步长．对ｋ１＝ １,即所谓一阶刚性初值问题,混合法已有诸多研究（见［６,９－１１,１４－１６］）;对 ｋ１＝ ２,即所…     

A Divergent Technique for the Approximate Solution of Some Simultaneous Linear Equations by Iterative Methods

A technique is given for solving certain types of simultaneouslinear equations by iterative methods where the iterative methodsare divergent. An application of the technique is made to thesolution of Laplace's equation by the Jacobi interative method.     

Convergence of hybrid viscosity and steepest-descent methods for pseudocontractive mappings and nonlinear Hammerstein equations

In this article, we first introduce an iterative method based on the hybrid viscosity approximation method and the hybrid steepest-descent method for finding a fixed point of a Lipschitz pseudocontractive mapping (assuming existence) and prove that our proposed scheme has strong convergence under some mild conditions imposed on algorithm parameters in real Hilbert spaces. Next, we introduce a new iterative method for a solution of a nonlinear integral equation of Hammerstein type and obtain strong convergence in real Hilbert spaces. Our results presented in this article generalize and extend the corresponding results on Lipschitz pseudocontractive mapping and nonlinear integral equation of Hammerstein type reported by some authors recently. We compare our iterative scheme numerically with other iterative scheme for solving non-linear integral equation of Hammerstein type to verify the efficiency and implementation of our new method.     

Mathematical stencil and its application in finite difference approximation to the poisson equation

The concept of mathematical stencil and the strategy of stencil elimination for solving the finite difference equation is presented,and then a new type of the iteration algo- rithm is established for the Poisson equation.The new algorithm has not only the obvious property of parallelism,but also faster convergence rate than that of the classical Jacobi iteration.Numerical experiments show that the time for the new algorithm is less than that of Jacobi and Gauss-Seidel methods to obtain the same precision,and the computational velocity increases obviously when the new iterative method,instead of Jacobi method,is applied to polish operation in multi-grid method,furthermore,the polynomial acceleration method is still applicable to the new iterative method.     

A numerical method for reconstructing the coefficient in a wave equation

We present a numerical method for reconstructing the coefficient in a wave equation from a single measurement of partial Dirichlet boundary data. The original inverse problem is converted to a nonlinear integral differential equation, which is solved by an iterative method. At each iteration, one linear second‐order elliptic problem is solved to update the reconstruction of the coefficient, then the reconstructed coefficient is used to solve the forward problem to obtain the new data for the next iteration. The initial guess of the iterative method is provided by an approximate model. This model extends the approximate globally convergent method proposed by Beilina and Klibanov, which has been well developed for the determination of the coefficient in a special wave equation. Numerical experiments are presented to demonstrate the stability and robustness of the proposed method with noisy data.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 289–307, 2015     

矩阵方程AX＋XB=C的双对称解及其最佳逼近

提出一种求解线性矩阵方程AX＋XB=C双对称解的迭代法.该算法能够自动地判断解的情况,并在方程相容时得到方程的双对称解,在方程不相容时得到方程的最小二乘双对称解.对任意的初始矩阵,在没有舍入误差的情况下,经过有限步迭代得到问题的一个双对称解.若取特殊的初始矩阵,则可以得到问题的极小范数双对称解,从而巧妙地解决了对给定矩...     

Variational iterative method and initial-value problems

The variational iterative method is revisited for initial-value problems in ordinary or partial differential equation. A distributional characterization of the Lagrange multiplier - the keystone of the method - is proposed, that may be interpreted as a retarded Green function. Such a formulation makes possible the simplification of the iteration formula into a Picard iterative scheme, and facilitates the convergence analysis. The approximate analytical solution of a nonlinear Klein-Gordon equation with inhomogeneous initial data is proposed.     

矩阵方程X+A*X-nA=I的正定解

In this paper we give some sufficient conditions and some necessary conditions under which the matrix equation X A^*X^-nA=I has a positive definite solution. An iterative method which converges to a positive definite solution of this equation is constructed. And an error estimate formula on this iterative method is also derived.