Re: Accelerating the Buddhabrot with the Metropolis-Hastings algorithm
- From: "Steckles" <captain_picard@xxxxxxxxx>
- Date: 12 Sep 2006 16:01:33 -0700
caos.snow@xxxxxxxxx wrote:
http://graphics.stanford.edu/courses/cs348b-03/lectures/metrofinal.pdf#search=%22%22Metropolis%20sampling%22%20%22
It's a hold over from my old MLT raytracer. The algorithm can produce a
that seems to make lot of sense with what I see in Steckles's (Alex's)
code. I have a question however: why do you use a exp/log
transformation to calculate the aceptance function? Is is because the
values on the fraction are very big and log()-ing and exp()-ing fixes
it? Thx.
lot of values that are very, very close to zero and exp(log(a')-log(a))
tends to be more stable than a' / a while giving results that are
equally usable. This is especially true when your primary data type are
floats rather than doubles. It's probably not needed because the
program doesn't rely on floats and it's not so much of a problem.
.
- References:
- Accelerating the Buddhabrot with the Metropolis-Hastings algorithm
- From: Steckles
- Re: Accelerating the Buddhabrot with the Metropolis-Hastings algorithm
- From: caos . snow
- Accelerating the Buddhabrot with the Metropolis-Hastings algorithm
- Prev by Date: Re: Accelerating the Buddhabrot with the Metropolis-Hastings algorithm
- Next by Date: Re: ifs image width and height
- Previous by thread: Re: Accelerating the Buddhabrot with the Metropolis-Hastings algorithm
- Next by thread: Re: Accelerating the Buddhabrot with the Metropolis-Hastings algorithm
- Index(es):
Relevant Pages
|
Loading