Sciweavers

Share
495 search results - page 1 / 99
» Monte Carlo methods for matrix computations on the grid
Sort
View
FGCS
2008
127views more  FGCS 2008»
8 years 12 months ago
Monte Carlo methods for matrix computations on the grid
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
Simon Branford, Cihan Sahin, Ashish Thandavan, Chr...
ICCS
2007
Springer
9 years 6 months ago
Complexity of Monte Carlo Algorithms for a Class of Integral Equations
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
Ivan Dimov, Rayna Georgieva
PVM
1999
Springer
9 years 4 months ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
9 years 3 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova
ISBI
2004
IEEE
10 years 17 days ago
Reconstruction of 2D Pet Data with Monte Carlo Generated Natural Pixels
Abstract-In discrete detector PET, natural pixels are image basis functions calculated from responses of detector pairs. By using reconstruction with natural pixels the discretizat...
Charles L. Byrne, Stefaan Vandenberghe, Edward J. ...
books