Computational performances of new Monte Carlo algorithm in comparison to SPAI preconditioner for solving linear systems

zbMATH Open1131.65032MaRDI QIDQ5437704FDOQ5437704

Behrouz Fathi Vajargah

Publication date: 28 January 2008

zbMATH Keywords

Markov chainnumerical exampleslinear systemsparseMonte Carlo algorithmsBICGSTABSPAI preconditioner

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Linear ordinary differential equations and systems (34A30)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations 👍 👎
• A new Monte Carlo method for solving systems of linear algebraic equations 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Computational performances of new Monte Carlo algorithm in comparison to SPAI preconditioner for solving linear systems

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