Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles; site ea.UUCP
Path: utzoo!linus!decvax!mcnc!unc!ulysses!mhuxl!ihnp4!inuxc!pur-ee!uiucdcs!ea!mwm
From: mwm@ea.UUCP
Newsgroups: net.math
Subject: Non-random Monte-carlo? - (nf)
Message-ID: <6900002@ea.UUCP>
Date: Fri, 13-Apr-84 18:51:00 EST
Article-I.D.: ea.6900002
Posted: Fri Apr 13 18:51:00 1984
Date-Received: Wed, 18-Apr-84 01:14:26 EST
Lines: 20
Nf-ID: #N:ea:6900002:000:539
Nf-From: ea!mwm    Apr 13 17:51:00 1984

#N:ea:6900002:000:539
ea!mwm    Apr 13 17:51:00 1984

I am currently working on a problem that involves integration via
monte-carlo techniques. However, instead of choosing n*n random points, I'm
using a regularly spaced grid. The code I'm writing looks like:

	for i: int in int$from_to(1, n) do
		for j: int in int$from_to(1, n) do
			x := i * xdelta + xmin
			y := j * ydelta + ymin
			end
		end

As far as I can tell, this won't make things worse than using a true
monte-carlo, and should make things better. Could somebody with more
statistics than I have please comment?

	Thanx,
	<mike