Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Matrix balancing and robust Monte Carlo algorithm for evaluating dominant eigenpair
Authors: Behrouz Fathi Vajargah, Farshid Mehrdoust
Keywords: Monte Carlo algorithms; Robust Monte Carlo algorithm; Markov chain; Balancing; Eigenpair; Large scale matrices
– 0.22 Mb
Keywords: Monte Carlo algorithms; Robust Monte Carlo algorithm; Markov chain; Balancing; Eigenpair; Large scale matrices
Abstract
Matrix balancing may effect the stability of algorithms in matrix computations and the accuracy of computed solutions. In this paper, we first introduce an algorithm for matrix balancing. Then, using Monte Carlo method we propose a robust algorithm to evaluate dominant eigenpair of a given matrix. Finally, several randomly generated examples are presented to show the efficiency of the new method.Faculty of Mathematical Sciences,
University of Guilan,
Rasht, P.O. Box: 1914, Iran
E-mail: ,
University of Guilan,
Rasht, P.O. Box: 1914, Iran
E-mail: ,
Fulltext
– 0.22 Mb
Contents
- Performance evaluation of clustering techniques for image segmentation
- Perfect Octagon Quadrangle Systems with an upper C4-system and a large spectrum
- Information encryption systems based on Boolean functions
- Service for fault tolerance in the Ad Hoc Networks based on Multi Agent Systems
- Matrix balancing and robust Monte Carlo algorithm for evaluating dominant eigenpair
- Study of language-theoretic computational paradigms inspired by biology
- International Workshop on Intelligent Information Systems
