Return-Path: Delivered-To: apmail-jakarta-commons-dev-archive@apache.org Received: (qmail 30943 invoked from network); 10 Jun 2003 13:47:06 -0000 Received: from exchange.sun.com (192.18.33.10) by daedalus.apache.org with SMTP; 10 Jun 2003 13:47:06 -0000 Received: (qmail 7787 invoked by uid 97); 10 Jun 2003 13:49:23 -0000 Delivered-To: qmlist-jakarta-archive-commons-dev@nagoya.betaversion.org Received: (qmail 7780 invoked from network); 10 Jun 2003 13:49:22 -0000 Received: from daedalus.apache.org (HELO apache.org) (208.185.179.12) by nagoya.betaversion.org with SMTP; 10 Jun 2003 13:49:22 -0000 Received: (qmail 30718 invoked by uid 500); 10 Jun 2003 13:47:02 -0000 Mailing-List: contact commons-dev-help@jakarta.apache.org; run by ezmlm Precedence: bulk List-Unsubscribe: List-Subscribe: List-Help: List-Post: List-Id: "Jakarta Commons Developers List" Reply-To: "Jakarta Commons Developers List" Delivered-To: mailing list commons-dev@jakarta.apache.org Received: (qmail 30674 invoked from network); 10 Jun 2003 13:47:01 -0000 Received: from unknown (HELO hume.tsdinc.steitz.com) (209.249.229.10) by daedalus.apache.org with SMTP; 10 Jun 2003 13:47:01 -0000 Content-Class: urn:content-classes:message Received: from Lavoie.tsdinc.steitz.com ([209.249.229.4]) by hume.tsdinc.steitz.com with Microsoft SMTPSVC(5.0.2195.5329); Tue, 10 Jun 2003 09:46:59 -0400 Received: from steitz.com ([130.13.162.175]) by Lavoie.tsdinc.steitz.com with Microsoft SMTPSVC(5.0.2195.5329); Tue, 10 Jun 2003 09:46:59 -0400 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1106 Message-ID: <3EE5E143.1080806@steitz.com> Date: Tue, 10 Jun 2003 06:46:43 -0700 From: "Phil Steitz" User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:0.9.9) Gecko/20020408 X-Accept-Language: en-us, en MIME-Version: 1.0 To: "Jakarta Commons Developers List" Subject: Re: [math] proposed ordering for task list, scope of initial release References: <20030610072636.12948.qmail@web41314.mail.yahoo.com> Content-Type: text/plain; format=flowed; charset="us-ascii" Content-Transfer-Encoding: 7bit X-OriginalArrivalTime: 10 Jun 2003 13:46:59.0753 (UTC) FILETIME=[C3F0B190:01C32F56] X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N Al Chou wrote: > --- Al Chou wrote: > >>--- Phil Steitz wrote: >>[deletia] >> >>>OK, long-winded disclaimer aside, here is how I see the task list ordered: >> > [deletia] > >>>* Framework and implementation strategie(s) for finding roots or >> >>real-valued >> >>>functions of one (real) variable. Here again -- largely done. I would >>>prefer >>>to wait until J gets back and let him submit his framework and R. Brent's >>>algorithm. Then "our" Brent's implementation and usage can be integrated >>>(actually not much to do, from the looks of the current code) and I will >> >>add >> >>>my "bean equations" stuff (in progress). >> >>I may have time to submit my Ridders' method implementation using J.'s >>framework before he returns 2 days hence. Should I bother to try, or should >>I >>wait until he submits his code as a patch via Bugzilla? > > > Well, I've just spent some time over the past 3 days reminding myself pf some > of the things that are so hard about numerics. > > BTW, in the process of using Herr Pietschmann's root finder framework, I > discovered a bug in setMaximalIterationCount (it sets > defaultMaximalIterationCount instead of maximalIterationCount). > > > So I pulled out Herr Pietschmann's Brent method class and tested it, and it > threw an exception telling me, "Possibly multiple zeros in interval or ill > conditioned function." > > The morals of the story are: > - More-sophisticated algorithms that are supposed to converge faster don't > always do so > - It's easy to outsmart yourself and create code that's too finicky for > non-numericist users. Good thing to keep reminding ourselves. > > As someone said recently on the list, a typical user probably is more > interested in an algorithm that's guaranteed to converge to a root (if there is > one) than in the rate of convergence, as long as it's not too ridiculously > slow. Given that we've repeatedly determined that commons-math is not to be a > general numerical mathematics library, I think now that we should provide only > a bisection method in the initial release (assuming we achieve one) and spend > time later making our implementations of the more sophisticated algorithms more > user-friendly, if we find they're even needed. +1, but maybe adding Secant method (I think J included this as well, if memory serves). > > Finally, having used the Pietschmann root finder framework, I think it needs > some modification to make it more user-friendly. As a lay user, I would have > been much happier dealing with Brent W.'s interface than Herr Pietschmann's, > which was kind of cumbersome. I think, though, with a little slimming down, it > would be quite workable. > We should let J comment on this. Also, the "bean equations" stuff that I am working on will be *very* easy to use (though less sophisticated). > > Al > > ===== > Albert Davidson Chou > > Get answers to Mac questions at http://www.Mac-Mgrs.org/ . > > __________________________________ > Do you Yahoo!? > Yahoo! Calendar - Free online calendar with sync to Outlook(TM). > http://calendar.yahoo.com > > --------------------------------------------------------------------- > To unsubscribe, e-mail: commons-dev-unsubscribe@jakarta.apache.org > For additional commands, e-mail: commons-dev-help@jakarta.apache.org > --------------------------------------------------------------------- To unsubscribe, e-mail: commons-dev-unsubscribe@jakarta.apache.org For additional commands, e-mail: commons-dev-help@jakarta.apache.org