首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
选择了求解Hilbert矩阵线性方程组的三种数值解方法,提出了SOR迭代中的松弛因子的预处理方法,比较了高斯-赛德尔迭代和SOR迭代数值解的迭代收敛次数,并给出了SOR迭代收敛最快时的松弛因子取值.最后通过SOR迭代解分量及误差范围,说明了提出的SOR迭代预处理方法是有效的.  相似文献   

2.
对一类非线性方程组,本文给出一种球形迭代解法。它的基本思想是:以空间某一固定点为球心,给出一球形区域为方程组解的初估计范围,以球中任一点为迭代初值,按某一格式迭代,当迭代解超出这一区域,则将这球形区域的半径扩大,同时重新从迭代初值出发迭代,我们将证明,当球形区域最终包含方程组解时,迭代解至多有限次超出球形区域,直至收敛到方程组的解。这种解法具有大范围收敛性,同时允许迭代格式中带有误差项,适合这种解法的非线性方程组较[1],[2],[3]中的更广,而迭代格式中的误差项又比[4]中更一般。  相似文献   

3.
对拟线性抛物组第一边界问题构造了迭代差分格式,并证明迭代差分格式的解收敛于问题的唯一解.  相似文献   

4.
龙宪军 《应用数学》2005,18(4):603-609
本文引入并研究了Hilbert空间中的一类广义多值拟变分包含问题.借助预解算子技巧构造了一个新的两步迭代算法来逼近广义多值拟变分包含的解,并且证明了其解的存在性以及迭代算法生成的迭代序列的收敛性.  相似文献   

5.
在共轭梯度思想的启发下,本文给出了迭代算法求解约束矩阵方程AXB+CXD=F的对称解及其最佳逼近.应用迭代算法,矩阵方程AXB+CXD=F的相容性可以在迭代过程中自动判断.当矩阵方程AXB+CXD=F有对称解时,在有限的误差范围内,对任意初始对称矩阵X1,运用迭代算法,经过有限步可得到矩阵方程的对称解;选取合适的初始迭代矩阵,还可以迭代出极小范数对称解.而且,对任意给定的矩阵X0,矩阵方程AXB+CXD=F的最佳逼近对称解可以通过迭代求解新的矩阵方程A(X)B+C(X)D=(F)的极小范数对称解得到.文中的数值例子证实了该算法的有效性.  相似文献   

6.
当多矩阵变量线性矩阵方程(LME)相容时,通过修改共轭梯度法的下降方向及其有关系数,建立求LME的一种异类约束解的迭代算法.当LME不相容时,先通过构造等价的线性矩阵方程组(LMEs),将不相容的LME异类约束最小二乘解(Ls解)问题转化为相容的LMEs异类约束解问题,然后参照求LME的异类约束解的迭代算法,建立求LME的一种异类约束Ls解的迭代算法.不考虑舍入误差时,迭代算法可在有限步计算后求得LME的一组异类约束解或者异类约束Ls解;选取特殊的初始矩阵时,可求得LME的极小范数异类约束解或者异类约束Ls解.此外,还可在LME的异类约束解或者异类约束Ls解集合中给出指定矩阵的最佳逼近矩阵.算例表明,迭代算法是有效的.  相似文献   

7.
一类广义变分包含的迭代解   总被引:6,自引:0,他引:6  
介绍一类新的涉及集值映射的变分包含问题,构造其迭代序列,并证明迭代序列收敛于变分包含问题的解,给出迭代序列与解的误差估计。  相似文献   

8.
汪小梅  张志强  朱华 《数学杂志》2016,36(3):591-597
本文研究了一类非线性中立型脉冲发展方程解的存在性和唯一性的问题.利用迭代分析方法结合半群理论的知识,得到了其解的表达式,并构造解的迭代序列,同时证明了其解的存在性和唯一性.通过研究发现其解的存在性和唯一性与脉冲时滞条件密不可分,利用迭代分析法求解此类问题具有一定的优越性.  相似文献   

9.
唐艳 《数学杂志》2015,35(1):123-130
本文研究了非扩张半群的变分不等式的不动点解的迭代算法.利用变分不等式与不动点问题的解的关系,结合粘性逼近方法,建立了非扩张半群的不动点的两步迭代格式,证明了该方法所得到的迭代序列在一定条件下的强收敛性,并收敛于某变分不等式的唯一解.  相似文献   

10.
考虑求解一类非线性反应扩散对流方程的块单调迭代算法,其中包括传统的块Picard,块Jacobi,以及在区域分解算法中常用的并行Schwarz算法.所讨论的算法可从问题的一个上解和下解出发,产生一个上解迭代序列和下解迭代序列并单调收敛于离散问题的解.这类算法的优点在于算法的并行结构好且可直接通过所产生的上解和下解迭代序列,得到迭代解的最大模误差界.在理论上,得到了算法的单调收敛性、线性与超线性收敛性.  相似文献   

11.
一类二阶两点边值问题的单调迭代方法   总被引:2,自引:0,他引:2  
通过改进经典的单调迭代方法对于一类二阶两点边值的问题的正解建立了单调迭代程序。这些迭代程序都是从常值函数开始的,因而是可行并且有效的。  相似文献   

12.
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.  相似文献   

13.
迭代根问题是动力系统嵌入流问题的弱问题,是动态插值方法的基础.然而,即使是对一维映射,迭代根的非单调性和全局光滑性都是困难的问题.本文介绍这方面的若干新结果,尤其是关于严格逐段单调连续函数的连续迭代根的存在性和构造,以及迭代根局部光滑与全局光滑的新进展.最后给出多项式迭代根这类既严格逐段单调又具光滑性的迭代根的存在条件及计算方法.  相似文献   

14.
围绕两个典型迭代数列的构造问题,以问题为驱动,提出一种生成迭代数列的新方法,并通过数值实验或理论证明验证迭代数列的收敛性.  相似文献   

15.
In this paper, we propose a new simultaneous iterative algorithm for solving the split common fixed point problem of directed operators. Inspired by the idea of cyclic iterative algorithm, we also introduce two iterative algorithms which combine the process of cyclic and simultaneous together. Under mild assumptions, we prove convergence of the proposed iterative sequences. As applications, we obtain several iteration schemes to solve the inverse problem of multiple-sets split feasibility problem. Numerical experiments are presented to confirm the efficiency of the proposed iterative algorithms.  相似文献   

16.
Summary. Two block monotone iterative schemes for a nonlinear algebraic system, which is a finite difference approximation of a nonlinear elliptic boundary-value problem, are presented and are shown to converge monotonically either from above or from below to a solution of the system. This monotone convergence result yields a computational algorithm for numerical solutions as well as an existence-comparison theorem of the system, including a sufficient condition for the uniqueness of the solution. An advantage of the block iterative schemes is that the Thomas algorithm can be used to compute numerical solutions of the sequence of iterations in the same fashion as for one-dimensional problems. The block iterative schemes are compared with the point monotone iterative schemes of Picard, Jacobi and Gauss-Seidel, and various theoretical comparison results among these monotone iterative schemes are given. These comparison results demonstrate that the sequence of iterations from the block iterative schemes converges faster than the corresponding sequence given by the point iterative schemes. Application of the iterative schemes is given to a logistic model problem in ecology and numerical ressults for a test problem with known analytical solution are given. Received August 1, 1993 / Revised version received November 7, 1994  相似文献   

17.
An expression for the coefficients of a linear iterative equation in terms of the parameters of the source equation is given both for equations in standard form and for equations in reduced normal form. The operator that generates an iterative equation of a general order in reduced normal form is also obtained and some other properties of iterative equations are established. An expression for the parameters of the source equation of the transformed equation under equivalence transformations is obtained, and this gives rise to the derivation of important symmetry properties for iterative equations. The transformation mapping a given iterative equation to the canonical form is obtained in terms of the simplest determining equation, and several examples of application are discussed.  相似文献   

18.
王婷  唐烁 《应用数学和力学》2017,38(12):1342-1358
借鉴含导数两步迭代格式转化成不含导数两步迭代格式的思想,提出了一种更通用的两步无导数迭代格式,通过权值保证了两步无导迭代格式达到最优阶;利用自加速参数和Newton(牛顿)插值多项式得到了两参和三参有记忆迭代格式,并与已有的两参和三参有记忆迭代格式进行比较;给出了几个格式的吸引域,比较了几个迭代格式的性能.  相似文献   

19.
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.  相似文献   

20.
研究了2n阶Lidstone边值问题正解的逐次迭代,其中非线性项依赖于所有偶数阶导数.通过考察非线性项在某些有国介集合上的“高度”并利用单调迭代方法构造了一个逐次迭代程序.这个迭代程序从一个多项式开始并且是可行的.使用这个结论获得了m个正解的迭代方法,其中m是一个任意的自然数.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号