A new Monte Carlo method for solving systems of linear algebraic equations
From MaRDI portal
Publication:4993678
DOI10.22034/cmde.2020.30640.1453zbMath1474.65005OpenAlexW3007581867MaRDI QIDQ4993678
Behrouz Fathi-Vajargah, Zeinab Hassanzadeh
Publication date: 16 June 2021
Full work available at URL: https://cmde.tabrizu.ac.ir/article_9941_5505de9e6ed44357cc1d84a45c2d0259.pdf
transition probability matrixspectral radiusMonte Carlo methodergodic Markov chainsystem of linear algebraic equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds for eigenvalues of the Hadamard product and the Fan product of matrices
- Monte Carlo method for the real and complex fuzzy system of linear algebraic equations
- On two inequalities for the Hadamard product and the Fan product of matrices
- Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
- New inequalities on eigenvalues of the Hadamard product and the Fan product of matrices
- A new \textit{walk on equations} Monte Carlo method for solving systems of linear algebraic equations
- Bounds on eigenvalues of the Hadamard product and the Fan product of matrices
- New advantages to obtain accurate matrix inversion
- Different stochastic algorithms to obtain matrix inversion
- Convergence Analysis of Markov Chain Monte Carlo Linear Solvers Using Ulam--von Neumann Algorithm
- Some inequalities for the spectral radius of the Hadamard product of two nonnegative matrices
- Block preconditioning of real-valued iterative algorithms for complex linear systems
- Bounds on the spectral radius of a Hadamard product of nonnegative or positive semidefinite matrices
- Matrix Analysis
- Pseudo-random numbers for constructing discrete Markov chains by the Monte Carlo method
- Iterative Solution Methods
- Computational Science – ICCS 2005
This page was built for publication: A new Monte Carlo method for solving systems of linear algebraic equations
