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

MaRDI QIDQ5437704zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 2087124
• Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
• A new Monte Carlo method for solving system of linear algebraic equations
• scientific article; zbMATH DE number 1728371
• Numerical comparison of Monte Carlo methods for linear systems

Cited in

(2)

• Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
• scientific article; zbMATH DE number 2087124 (Why is no real title available?)

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)