From owner-freebsd-current@FreeBSD.ORG Tue Jul 10 16:50:46 2012 Return-Path: Delivered-To: freebsd-current@freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [69.147.83.52]) by hub.freebsd.org (Postfix) with ESMTP id 88C421065675 for ; Tue, 10 Jul 2012 16:50:46 +0000 (UTC) (envelope-from sgk@troutmask.apl.washington.edu) Received: from troutmask.apl.washington.edu (troutmask.apl.washington.edu [128.95.76.21]) by mx1.freebsd.org (Postfix) with ESMTP id 5F60C8FC1A for ; Tue, 10 Jul 2012 16:50:46 +0000 (UTC) Received: from troutmask.apl.washington.edu (localhost.apl.washington.edu [127.0.0.1]) by troutmask.apl.washington.edu (8.14.5/8.14.5) with ESMTP id q6AGojGC094871; Tue, 10 Jul 2012 09:50:45 -0700 (PDT) (envelope-from sgk@troutmask.apl.washington.edu) Received: (from sgk@localhost) by troutmask.apl.washington.edu (8.14.5/8.14.5/Submit) id q6AGojVZ094870; Tue, 10 Jul 2012 09:50:45 -0700 (PDT) (envelope-from sgk) Date: Tue, 10 Jul 2012 09:50:45 -0700 From: Steve Kargl To: Stephen Montgomery-Smith Message-ID: <20120710165045.GA94795@troutmask.apl.washington.edu> References: <20120529045612.GB4445@server.rulingia.com> <20120708124047.GA44061@zim.MIT.EDU> <210816F0-7ED7-4481-ABFF-C94A700A3EA0@bsdimp.com> <4FF9DA46.2010502@missouri.edu> <20120708235848.GB53462@troutmask.apl.washington.edu> <4FFA25EA.5090705@missouri.edu> <20120709020107.GA53977@troutmask.apl.washington.edu> <4FFA52F8.2080700@missouri.edu> <20120709050238.GA54634@troutmask.apl.washington.edu> <4FFC5ADF.2010601@missouri.edu> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <4FFC5ADF.2010601@missouri.edu> User-Agent: Mutt/1.4.2.3i Cc: freebsd-current@freebsd.org Subject: Re: Use of C99 extra long double math functions after r236148 X-BeenThere: freebsd-current@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: Discussions about the use of FreeBSD-current List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 10 Jul 2012 16:50:46 -0000 On Tue, Jul 10, 2012 at 11:39:59AM -0500, Stephen Montgomery-Smith wrote: > On 07/09/2012 12:02 AM, Steve Kargl wrote: > > >Yep. Another example is the use of upward recurion to compute > >Bessel functions where the argument is larger than the order. > >The algorithm is known to be unstable. > > By upward recursion, do you mean equation (1) in > http://mathworld.wolfram.com/BesselFunction.html? Yes. > So what do people use. Maybe something like > http://en.wikipedia.org/wiki/Bessel_function#Asymptotic_forms (second > set of equations), but finding some asymptotics with a few extra terms > in them? They use downward recursion, which is known to be stable. NIST has revised Abramowitz and Stegun, and it is available on line. For Bessel function computations, look at http://dlmf.nist.gov/10.74 and more importantly example 1 under the following link http://dlmf.nist.gov/3.6#v -- Steve