Improving Monte Carlo Linear Solvers Through Better Iterative Processes
Monte Carlo (MC) linear solvers are fundamentally based on the ability to estimate a matrix-vector product, using a random sampling process. They use the fact that deterministic stationary iterative processes to solve linear systems can be written as sums of a series of matrix-vector products. Repla...
Other Authors: | Aggarwal, Vikram (authoraut) |
---|---|
Format: | Others |
Language: | English English |
Published: |
Florida State University
|
Subjects: | |
Online Access: | http://purl.flvc.org/fsu/fd/FSU_migr_etd-0017 |
Similar Items
-
Methods for increasing domains of convergence in iterative linear system solvers
by: Imberti, David M.
Published: (2014) -
Accelerated Discontinuous Galerkin Solvers with the Chebyshev Iterative Method on the Graphics Processing Unit
Published: (2013) -
Parallel variational iterative linear solvers
by: Raimondas Čiegis, et al.
Published: (2007-03-01) -
Continuous-Time Quantum Monte Carlo Impurity Solvers: Improvements and Applications
by: Sémon, Patrick
Published: (2014) -
Continuous-Time Quantum Monte Carlo Impurity Solvers: Improvements and Applications
by: Sémon, Patrick
Published: (2014)