1 day ago

my attempt to do the exercises in sicp.

## Monday, August 17, 2009

### sicp exercise 3.5

;; Exercise 3.5. Monte Carlo integration is a method of estimating definite integrals by means of Monte Carlo simulation. Consider computing the area of a region of space described by a predicate P(x, y) that is true for points (x, y) in the region and false for points not in the region. For example, the region contained within a circle of radius 3 centered at (5, 7) is described by the predicate that tests whether (x - 5)2 + (y - 7)2< 32. To estimate the area of the region described by such a predicate, begin by choosing a rectangle that contains the region. For example, a rectangle with diagonally opposite corners at (2, 4) and (8, 10) contains the circle above. The desired integral is the area of that portion of the rectangle that lies in the region. We can estimate the integral by picking, at random, points (x,y) that lie in the rectangle, and testing P(x, y) for each point to determine whether the point lies in the region. If we try this with many points, then the fraction of points that fall in the region should give an estimate of the proportion of the rectangle that lies in the region. Hence, multiplying this fraction by the area of the entire rectangle should produce an estimate of the integral.

;; Implement Monte Carlo integration as a procedure estimate-integral that takes as arguments a predicate P, upper and lower bounds x1, x2, y1, and y2 for the rectangle, and the number of trials to perform in order to produce the estimate. Your procedure should use the same monte-carlo procedure that was used above to estimate . Use your estimate-integral to produce an estimate of by measuring the area of a unit circle.

;; You will find it useful to have a procedure that returns a number chosen at random from a given range. The following random-in-range procedure implements this in terms of the random procedure used in section 1.2.6, which returns a nonnegative number less than its input.

;; (define (random-in-range low high)

;; (let ((range (- high low)))

;; (+ low (random range))))

(define (square x) (* x x))

(define (circle-predicate center radius)

(lambda(x y)

(<= (+ (square (- x (car center)))

(square (- y (cdr center))))

(square radius))))

(define (unit-circle x y)

(circle-predicate (cons x y) 1))

(define unit-circle-at-0-0

(unit-circle 0 0))

(define unit-circle-at-1-1

(unit-circle 1 1))

(define (monte-carlo trials experiment)

(define (iter trials-remaining trials-passed)

(cond ((= trials-remaining 0)

(exact->inexact (/ trials-passed trials)))

((experiment)

(iter (- trials-remaining 1) (+ trials-passed 1)))

(else

(iter (- trials-remaining 1) trials-passed))))

(iter trials 0))

(define (random-in-range low high)

(let ((range (- high low)))

(+ low (* range (random:uniform)))))

(define (estimate-integral integral x1 y1 x2 y2 trials)

(define (test)

(let ((x (random-in-range (min x1 x2) (max x1 x2)))

(y (random-in-range (min y1 y2) (max y1 y2))))

(integral x y)))

(let ((area (abs (* (- x1 x2) (- y1 y2)))))

(* area (monte-carlo trials test))))

(display (estimate-integral unit-circle-at-1-1 0 2 2 0 50000)) (newline)

(display (estimate-integral unit-circle-at-0-0 -1 1 1 -1 50000)) (newline)

Subscribe to:
Post Comments (Atom)

## No comments:

Post a Comment