From owner-freebsd-numerics@FreeBSD.ORG Sat Nov 2 17:30:21 2013 Return-Path: Delivered-To: freebsd-numerics@FreeBSD.org Received: from mx1.freebsd.org (mx1.freebsd.org [8.8.178.115]) (using TLSv1 with cipher ADH-AES256-SHA (256/256 bits)) (No client certificate requested) by hub.freebsd.org (Postfix) with ESMTP id 88694FA8; Sat, 2 Nov 2013 17:30:21 +0000 (UTC) (envelope-from sgk@troutmask.apl.washington.edu) Received: from troutmask.apl.washington.edu (troutmask.apl.washington.edu [128.95.76.21]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by mx1.freebsd.org (Postfix) with ESMTPS id 65EBA2F63; Sat, 2 Nov 2013 17:30:21 +0000 (UTC) Received: from troutmask.apl.washington.edu (localhost.apl.washington.edu [127.0.0.1]) by troutmask.apl.washington.edu (8.14.7/8.14.7) with ESMTP id rA2HUBS4095841; Sat, 2 Nov 2013 10:30:11 -0700 (PDT) (envelope-from sgk@troutmask.apl.washington.edu) Received: (from sgk@localhost) by troutmask.apl.washington.edu (8.14.7/8.14.7/Submit) id rA2HUBOD095840; Sat, 2 Nov 2013 10:30:11 -0700 (PDT) (envelope-from sgk) Date: Sat, 2 Nov 2013 10:30:11 -0700 From: Steve Kargl To: Bruce Evans Subject: Re: MUSL math functions Message-ID: <20131102173011.GB95769@troutmask.apl.washington.edu> References: <20131031133352.GA59918@troutmask.apl.washington.edu> <20131101072032.P1002@besplex.bde.org> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20131101072032.P1002@besplex.bde.org> User-Agent: Mutt/1.5.21 (2010-09-15) Cc: "freebsd-numerics@FreeBSD.org" , David Chisnall X-BeenThere: freebsd-numerics@freebsd.org X-Mailman-Version: 2.1.14 Precedence: list List-Id: "Discussions of high quality implementation of libm functions." List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 02 Nov 2013 17:30:21 -0000 On Fri, Nov 01, 2013 at 07:52:27AM +1100, Bruce Evans wrote: > On Thu, 31 Oct 2013, Steve Kargl wrote: >> On Thu, Oct 31, 2013 at 10:46:15AM +0000, David Chisnall wrote: >>> >>> erfcl, erfl >> >> I have code for erfcl and erfl. > > cerfl (not in C99) is apparently amazingly complicated. There is a > whole library libcerf for it on the net. openlibm includes http://ab-initio.mit.edu/wiki/index.php/Faddeeva_Package I haven't looked into the quality. The webpage claims 13 significant digits, which is not quite good enough for double. > erf support is very patchy in calculators. See the list in the NIST > web pages that update Abramowicz and Stegun. I find it hard to test > since it is not in pari. MPFR has implementations for erf and erfc. Testing on flame is extremely slow due to this. I think that I've only tested around 50000 values in the non-asymptotic range. -- Steve