Asymptotic complexity of the collisions estimator for solving linear systems
type: Item
instance of: scholarly article
title: Asymptotic complexity of the collisions estimator for solving linear systems
zbMATH Open document ID: 0946.65020
author: D. L. Danilov
author: Sergeĭ Mikhaĭlovich Ermakov
published in: Computational Mathematics and Mathematical Physics
publication date: 2000-05-04T00:00:00Z
review text: The authors continue the study of the complexity of stochastic algorithms for solving sets of linear algebraic equations. An analysis of the complexity of the collisions estimator is carried out in the Neumann-Ulam adjoint scheme for solving a set of linear algebraic equations. It is shown that the considered stochastic method has not only a better asymptotic order of complexity than iterative methods, but, in some cases, is asymptotically optimal. For example, the indicated optimality property appears in sets of grid equations for certa in boundary value problems of mathematical physics.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 65N06
zbMATH DE Number: 1438774
zbMATH Keywords: asymptotic complexity
zbMATH Keywords: stochastic algorithms
zbMATH Keywords: linear algebraic equations
zbMATH Keywords: collision estimator
zbMATH Keywords: Neumann-Ulam adjoint scheme
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1438774