Implementation of Monte Carlo algorithms for eigenvalue problem using MPI

DOI10.1007/BFB0056594MaRDI QIDQ4225277zbMATH OpenFDO

Authors I. Dimov, V. N. Alexandrov, Aneta Karaivanova

Publication date 10 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0056594

zbMATH Keywords

algorithmconvergencedominant eigenvaluelarge sparse test matriceslargest eigenvalueMonte Carlo methodsnumerical examplessmallest eigenvalue

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• Monte Carlo algorithms for calculating eigenvalues
• Parallel computations of eigenvalues based on a Monte Carlo approach
• scientific article; zbMATH DE number 1569645

Cited in

(8)

• Parallel Monte Carlo algorithms for information retrieval
• New hybrid Monte Carlo methods and computing the dominant generalized eigenvalue
• Monte Carlo algorithms for calculating eigenvalues
• Parallel computations of eigenvalues based on a Monte Carlo approach
• scientific article; zbMATH DE number 1969621 (Why is no real title available?)
• scientific article; zbMATH DE number 1569645 (Why is no real title available?)
• Computational Science – ICCS 2005
• Matrix balancing and robust Monte Carlo algorithm for evaluating dominant eigenpair

This page was built for publication: Implementation of Monte Carlo algorithms for eigenvalue problem using MPI

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225277)