检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《应用数学与计算数学学报》2013年第3期382-393,共12页Communication on Applied Mathematics and Computation
基 金:Project supported by the National Natural Science Foundation of China(11071184);the National Natural Science Foundation of Shanxi Province of China(2012011015-6)
摘 要:一般二阶段多分裂迭代法的权矩阵都是预先给出的,在迭代过程中并不知道它的优劣.提出了广义的二阶段多分裂迭代法,它的加权矩阵不必预先给出,而是在迭代过程中通过求超平面上的最优解而得出的随迭代步数变化的动态的权矩阵.这样,动态的权矩阵能使得第k步的近似解更加逼近问题的真解.文中建立了新方法的收敛性理论,并以数值实验验证新方法的有效性.The weighting matrices in a standard multisplitting two-stage itera- tion method are determined previously in general. They are not known to be good or bad. In this paper, some generalized two-stage multisplitting iterative meth- ods are presented, whose weighting matrices are not necessarily known or given in advance. Instead, the variable weighting matrices can be obtained by finding the optimal point on the hyperplane at each step. Thus, the variable weighting matrices enable more approximate to the exact solution for the k-step iteration. The convergence theories of these generalized methods are established. Finally, the numerical comparison of several generalized two-stage parallel multisplitting methods are shown.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229