0
comment
on 11/22/2014 3:18 PM
A while back I came upon a seemingly not-too-difficult programming exercise: Define a recurrence  by Compute . This isn't too hard to code up, using perhaps a recursive function to represent . With normal double-precision floats, as increases, the result converges neatly toward 100. Super! Unfortunately, 100 is not even close to the right answer. This … Continue reading Muller's Recurrence - roundoff gone wrong →
>> Read the full article on latkin.org
.
IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us
Built with WebSharper