Randomized method of successive approximations for solving systems of linear algebraic equations

被引：4
作者：
Bulavskii, YV
机构：
[1] Computing Center, The Siberian Branch of the Russian Academy of Sciences
来源：
RUSSIAN JOURNAL OF NUMERICAL ANALYSIS AND MATHEMATICAL MODELLING | 1995年 / 10卷 / 06期
基金：
俄罗斯基础研究基金会;
关键词：
D O I：
10.1515/rnam.1995.10.6.481
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We suggest that the multiplication of a matrix by a vector for systems with dense matrices in the method of successive approximations should be randomized. For the special case we obtain the familiar Neumann-Ulam scheme for solving systems of linear algebraic equations. The method is intended to find the statistical characteristics of solutions to equations with stochastic parameters.
引用
收藏
页码：481 / 493
页数：13
相关论文
共 7 条
  • [1] Berman A., Plemmons R.J., Nonnegative Matrices in Mathematical Sciences, (1979)
  • [2] Ermakov S.M., Mikhailov G.A., Statistical Modelling, (1982)
  • [3] Kalos M.H., Whitlock P.A., Monte Carlo Methods, (1986)
  • [4] Lankaster P., Theory of Matrices, (1969)
  • [5] Mikhailov G.A., Optimization of Weighted Monte Carlo Methods, (1982)
  • [6] Monte Carlo Methods in Statistical Physics, (Ed. K. Binder), (1979)
  • [7] Yan Y., Yan, Sparse preconditioned iterative methods for dense linear systems, SIAM J. Sci. Comput, 5, pp. 1190-1200, (1994)
1