mirror of
https://github.com/golang/go
synced 2024-11-13 20:20:30 -07:00
88672de7af
As necessary, math functions were structured to use stubs, so that they can
be accelerated with assembly on any platform.
Technique used was minimax polynomial approximation using tables of
polynomial coefficients, with argument range reduction.
Benchmark New Old Speedup
BenchmarkAcos 12.2 47.5 3.89
BenchmarkAcosh 18.5 56.2 3.04
BenchmarkAsin 13.1 40.6 3.10
BenchmarkAsinh 19.4 62.8 3.24
BenchmarkAtan 10.1 23 2.28
BenchmarkAtanh 19.1 53.2 2.79
BenchmarkAtan2 16.5 33.9 2.05
BenchmarkCbrt 14.8 58 3.92
BenchmarkErf 10.8 20.1 1.86
BenchmarkErfc 11.2 23.5 2.10
BenchmarkExp 8.77 53.8 6.13
BenchmarkExpm1 10.1 38.3 3.79
BenchmarkLog 13.1 40.1 3.06
BenchmarkLog1p 12.7 38.3 3.02
BenchmarkPowInt 31.7 40.5 1.28
BenchmarkPowFrac 33.1 141 4.26
BenchmarkTan 11.5 30 2.61
Accuracy was tested against a high precision
reference function to determine maximum error.
Note: ulperr is error in "units in the last place"
max
ulperr
Acos 1.15
Acosh 1.07
Asin 2.22
Asinh 1.72
Atan 1.41
Atanh 3.00
Atan2 1.45
Cbrt 1.18
Erf 1.29
Erfc 4.82
Exp 1.00
Expm1 2.26
Log 0.94
Log1p 2.39
Tan 3.14
Pow will have 99.99% correctly rounded results with reasonable inputs
producing numeric (non Inf or NaN) results
Change-Id: I850e8cf7b70426e8b54ec49d74acd4cddc8c6cb2
Reviewed-on: https://go-review.googlesource.com/38585
Reviewed-by: Michael Munday <munday@ca.ibm.com>
Run-TryBot: Michael Munday <munday@ca.ibm.com>
TryBot-Result: Gobot Gobot <gobot@golang.org>
80 lines
1.9 KiB
Go
80 lines
1.9 KiB
Go
// Copyright 2010 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package math
|
|
|
|
// The original C code, the long comment, and the constants
|
|
// below are from FreeBSD's /usr/src/lib/msun/src/e_atanh.c
|
|
// and came with this notice. The go code is a simplified
|
|
// version of the original C.
|
|
//
|
|
// ====================================================
|
|
// Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
|
|
//
|
|
// Developed at SunPro, a Sun Microsystems, Inc. business.
|
|
// Permission to use, copy, modify, and distribute this
|
|
// software is freely granted, provided that this notice
|
|
// is preserved.
|
|
// ====================================================
|
|
//
|
|
//
|
|
// __ieee754_atanh(x)
|
|
// Method :
|
|
// 1. Reduce x to positive by atanh(-x) = -atanh(x)
|
|
// 2. For x>=0.5
|
|
// 1 2x x
|
|
// atanh(x) = --- * log(1 + -------) = 0.5 * log1p(2 * --------)
|
|
// 2 1 - x 1 - x
|
|
//
|
|
// For x<0.5
|
|
// atanh(x) = 0.5*log1p(2x+2x*x/(1-x))
|
|
//
|
|
// Special cases:
|
|
// atanh(x) is NaN if |x| > 1 with signal;
|
|
// atanh(NaN) is that NaN with no signal;
|
|
// atanh(+-1) is +-INF with signal.
|
|
//
|
|
|
|
// Atanh returns the inverse hyperbolic tangent of x.
|
|
//
|
|
// Special cases are:
|
|
// Atanh(1) = +Inf
|
|
// Atanh(±0) = ±0
|
|
// Atanh(-1) = -Inf
|
|
// Atanh(x) = NaN if x < -1 or x > 1
|
|
// Atanh(NaN) = NaN
|
|
func Atanh(x float64) float64
|
|
|
|
func atanh(x float64) float64 {
|
|
const NearZero = 1.0 / (1 << 28) // 2**-28
|
|
// special cases
|
|
switch {
|
|
case x < -1 || x > 1 || IsNaN(x):
|
|
return NaN()
|
|
case x == 1:
|
|
return Inf(1)
|
|
case x == -1:
|
|
return Inf(-1)
|
|
}
|
|
sign := false
|
|
if x < 0 {
|
|
x = -x
|
|
sign = true
|
|
}
|
|
var temp float64
|
|
switch {
|
|
case x < NearZero:
|
|
temp = x
|
|
case x < 0.5:
|
|
temp = x + x
|
|
temp = 0.5 * Log1p(temp+temp*x/(1-x))
|
|
default:
|
|
temp = 0.5 * Log1p((x+x)/(1-x))
|
|
}
|
|
if sign {
|
|
temp = -temp
|
|
}
|
|
return temp
|
|
}
|