Implementation of Monte Carlo Algorithms for Eigenvalue Problem Using MPI

15 years 7 months ago

Download parallel.bas.bg

The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered. Three almost optimal Monte Carlo algorithms are presented:

Ivan Dimov, Vassil N. Alexandrov, Aneta Karaivanov

Real-time Traffic

Algorithm Uses Iterations | Distributed And Parallel Computing | Monte Carlo | Monte Carlo Algorithm | PVM 1998 |

claim paper

» A Grid Free Monte Carlo Algorithm for Solving Elliptic Boundary Value Problems

» MonteCarlo Sampling for NPHard Maximization Problems in the Framework of Weighted Parsing

» A replica exchange Monte Carlo algorithm for protein folding in the HP model

» Negative information and line observations for Monte Carlo localization

» Lazy localization using the FrozenTime Smoother

» Parallel Importance Separation for Multiple Integrals and Integral Equations

» Improving convergence of the stochastic decomposition algorithm by using an efficient samp...

» QuasiRandom Sampling for Condensation

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	PVM
Authors	Ivan Dimov, Vassil N. Alexandrov, Aneta Karaivanova

Comments (0)

Sciweavers

Implementation of Monte Carlo Algorithms for Eigenvalue Problem Using MPI

Algorithm Uses Iterations | Distributed And Parallel Computing | Monte Carlo | Monte Carlo Algorithm | PVM 1998 |

Explore & Download

Productivity Tools

Sciweavers