On the asymptotic optimality of the estimation by collisions in the Neuman-Ulam scheme for systems of network equations in the multidimensional Dirichlet problem

MaRDI QIDQ1422796zbMATH OpenFDO

Authors D. L. Danilov

Publication date 26 February 2004

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

zbMATH Keywords

collision estimationcomplexitydifference schemeDirichiet boundary value problemMonte-Carlo methodsNeuman-Ulam conjugate schemePoisson equationstochastic algorithmsystems of network equations

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Monte Carlo methods (65C05) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Asymptotic complexity of the collisions estimator for solving linear systems
• Complexity of the Neumann-Ulam scheme for solving a system of grid equations of the multidimensional Dirichlet problem
• The relative costs of the Monte Carlo method for solving systems of linear algebraic equations
• scientific article; zbMATH DE number 1131701
• Randomized method of successive approximations for solving systems of linear algebraic equations

Cited in

(2)

• Complexity of the Neumann-Ulam scheme for solving a system of grid equations of the multidimensional Dirichlet problem
• Asymptotic complexity of the collisions estimator for solving linear systems

This page was built for publication: On the asymptotic optimality of the estimation by collisions in the Neuman-Ulam scheme for systems of network equations in the multidimensional Dirichlet problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422796)