Asymptotic complexity of the collisions estimator for solving linear systems
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.
- On the asymptotic optimality of the estimation by collisions in the Neuman-Ulam scheme for systems of network equations in the multidimensional Dirichlet problem
- Asymptotic complexity of Monte Carlo methods for solving linear systems
- scientific article; zbMATH DE number 1131701
- scientific article; zbMATH DE number 4140952
This page was built for publication: Asymptotic complexity of the collisions estimator for solving linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975767)