From owner-freebsd-numerics@FreeBSD.ORG Sun Jan 4 04:37:53 2015 Return-Path: Delivered-To: freebsd-numerics@FreeBSD.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:1900:2254:206a::19:1]) (using TLSv1.2 with cipher AECDH-AES256-SHA (256/256 bits)) (No client certificate requested) by hub.freebsd.org (Postfix) with ESMTPS id 157F7B9E; Sun, 4 Jan 2015 04:37:53 +0000 (UTC) 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)) (Client CN "troutmask", Issuer "troutmask" (not verified)) by mx1.freebsd.org (Postfix) with ESMTPS id E8DB02F0C; Sun, 4 Jan 2015 04:37:52 +0000 (UTC) Received: from troutmask.apl.washington.edu (localhost [127.0.0.1]) by troutmask.apl.washington.edu (8.14.9/8.14.9) with ESMTP id t044bjcA079396 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-GCM-SHA384 bits=256 verify=NO); Sat, 3 Jan 2015 20:37:45 -0800 (PST) (envelope-from sgk@troutmask.apl.washington.edu) Received: (from sgk@localhost) by troutmask.apl.washington.edu (8.14.9/8.14.9/Submit) id t044bjvI079395; Sat, 3 Jan 2015 20:37:45 -0800 (PST) (envelope-from sgk) Date: Sat, 3 Jan 2015 20:37:45 -0800 From: Steve Kargl To: Pedro Giffuni Subject: Re: glibc math improvements Message-ID: <20150104043745.GA79370@troutmask.apl.washington.edu> References: <884D1A4A-76B7-4E7B-939A-6FD7D6D6D18D@freebsd.org> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <884D1A4A-76B7-4E7B-939A-6FD7D6D6D18D@freebsd.org> User-Agent: Mutt/1.5.23 (2014-03-12) Cc: freebsd-numerics@FreeBSD.org X-BeenThere: freebsd-numerics@freebsd.org X-Mailman-Version: 2.1.18-1 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: Sun, 04 Jan 2015 04:37:53 -0000 On Sat, Jan 03, 2015 at 10:00:58PM -0500, Pedro Giffuni wrote: > > This blog post was covered by Phoronix: > http://developerblog.redhat.com/2015/01/02/improving-math-performance-in-glibc/ > > Not sure any of that stuff is applicable to our implementation but it looks like an interesting link to share nevertheless. > AFAICT, it is not applicable. The improvements are in a 768-bit multi-precision computation of pow() to get an accurate answer. The article mentions that the technique may be applied to exp() and log(), but the table-driven methods that Bruce, David, and I used for logl, expl, and exp2l are quite accurate (somewhere around ulp < 0.55 or so). -- Steve