To comment on the following update, log in, then open the issue: http://www.openoffice.org/issues/show_bug.cgi?id=19991
------- Additional comments from [EMAIL PROTECTED] Thu Oct 6 19:20:39 -0700 2005 ------- There is however one caveat; the original Maclaurin expansion is more accurate for values of x up to 4 while the Asymptotic expansion performs terribly. But for x larger than 4 the Asymptotic expansion is more accurate. Therefore, in my proposed patch, which will follow soon, the original Maclaurin expansion is used for 0 < x < 4 and the asymptotic expansion for x > 4. I have also compared against the values of erf and erfc computed by octave, gnumeric, and Excel 2003. My proposed algorithm performs comparably, though not identically, with octave and gnumeric (these two spit the identical numbers so I assume they use the same algorithm), but it converges to 1 more quickly than octave/gnumeric. However, when compared with Excel 2003's values they were almost identical, so much so that I'm pretty sure that Excel must use this same algorithm internally! The comparison table follows... --------------------------------------------------------------------- Please do not reply to this automatically generated notification from Issue Tracker. Please log onto the website and enter your comments. http://qa.openoffice.org/issue_handling/project_issues.html#notification --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
