Efficient Monte Carlo algorithms for inverting matrices arising in mixed finite element approximation

zbMATH Open0980.65037MaRDI QIDQ2751221

T. T. Dimov

Publication date: 10 March 2002

zbMATH Keywords

numerical examplesparallel computationiterative methodsMarkov chainmixed finite element methodMonte Carlo algorithmssecond-order elliptic equationsinverse matrix problem

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (1)

A way to obtain Monte Carlo matrix inversion with minimal error

This page was built for publication: Efficient Monte Carlo algorithms for inverting matrices arising in mixed finite element approximation

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