Quasi-Monte Carlo algorithms for solving linear algebraic equations
From MaRDI portal
Recommendations
Cited in
(15)- Random linear-quadratic mathematical models: Computing explicit solutions and applications
- Stochastic and quasistochastic computations
- Parametrically splitting algorithms
- The relative costs of the Monte Carlo method for solving systems of linear algebraic equations
- scientific article; zbMATH DE number 5899420 (Why is no real title available?)
- MCQMC Algorithms for Solving some Classes of Equations
- scientific article; zbMATH DE number 473057 (Why is no real title available?)
- scientific article; zbMATH DE number 1103067 (Why is no real title available?)
- scientific article; zbMATH DE number 2000359 (Why is no real title available?)
- scientific article; zbMATH DE number 2087122 (Why is no real title available?)
- Combined probabilistic algorithm for solving high dimensional problems
- Implementing quasi-Monte Carlo simulations with linear transformations
- On stochastic and quasistochastic methods for solving equations
- On construction of parallel algorithms in problems of computational mathematics
- Optimization of the quasi-Monte Carlo algorithm for solving systems of linear algebraic equations
This page was built for publication: Quasi-Monte Carlo algorithms for solving linear algebraic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757063)