A new iterative Monte Carlo approach for inverse matrix problem
From MaRDI portal
Publication:1298607
DOI10.1016/S0377-0427(98)00043-0zbMath0936.65025OpenAlexW2000476502MaRDI QIDQ1298607
T. T. Dimov, T. V. Gurov, Ivan T. Dimov
Publication date: 3 May 2000
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(98)00043-0
preconditioningiterative methodsMarkov chainMonte Carlo algorithmstruncation errorconvergence controlstochastic errorinverse matrix problem
Related Items (16)
An efficient backward Monte Carlo estimator for solving a quantum-kinetic equation with memory kernel ⋮ An Improved “Walk on Equations” Monte Carlo Algorithm for Linear Algebraic Systems ⋮ Biological applications and numerical solution based on Monte Carlo method for a two-dimensional parabolic inverse problem ⋮ Different stochastic algorithms to obtain matrix inversion ⋮ Monte Carlo method via a numerical algorithm to solve a parabolic problem ⋮ Parallel Monte Carlo computations for solving SLAE with minimum communications ⋮ Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra ⋮ A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method ⋮ An efficient non-rejective implementation of the πps sampling designs ⋮ Monte Carlo linear solvers with non-diagonal splitting ⋮ A way to obtain Monte Carlo matrix inversion with minimal error ⋮ A new \textit{walk on equations} Monte Carlo method for solving systems of linear algebraic equations ⋮ Adaptive Monte Carlo methods for solving hyperbolic telegraph equation ⋮ A probabilistic linear solver based on a multilevel Monte Carlo method ⋮ Multiway Monte Carlo Method for Linear Systems ⋮ Combined probabilistic algorithm for solving high dimensional problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walk on distant mesh points Monte Carlo methods
- Monte Carlo algorithms: Performance analysis for some computer architectures
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Fast Parallel Matrix Inversion Algorithms
- Iterative Solution Methods
- SYSTOLIC MATRIX INVERSION USING A MONTE CARLO METHOD
- The Monte Carlo Method
- “Monte Carlo” Methods for the Iteration of Linear Operators
This page was built for publication: A new iterative Monte Carlo approach for inverse matrix problem