10 * See the License for the specific language governing permissions
11 * and limitations under the License.
12 *
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 *
19 * CDDL HEADER END
20 */
21
22 /*
23 * Copyright 2011 Nexenta Systems, Inc. All rights reserved.
24 */
25 /*
26 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
27 * Use is subject to license terms.
28 */
29
30 #pragma weak atanl = __atanl
31
32 /*
33 * atanl(x)
34 * Table look-up algorithm
35 * By K.C. Ng, March 9, 1989
36 *
37 * Algorithm.
38 *
39 * The algorithm is based on atan(x)=atan(y)+atan((x-y)/(1+x*y)).
40 * We use poly1(x) to approximate atan(x) for x in [0,1/8] with
41 * error (relative)
42 * |(atan(x)-poly1(x))/x|<= 2^-115.94 long double
43 * |(atan(x)-poly1(x))/x|<= 2^-58.85 double
44 * |(atan(x)-poly1(x))/x|<= 2^-25.53 float
45 * and use poly2(x) to approximate atan(x) for x in [0,1/65] with
46 * error (absolute)
47 * |atan(x)-poly2(x)|<= 2^-122.15 long double
48 * |atan(x)-poly2(x)|<= 2^-64.79 double
49 * |atan(x)-poly2(x)|<= 2^-35.36 float
50 * Here poly1 and poly2 are odd polynomial with the following form:
|
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
12 *
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 *
19 * CDDL HEADER END
20 */
21
22 /*
23 * Copyright 2011 Nexenta Systems, Inc. All rights reserved.
24 */
25 /*
26 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
27 * Use is subject to license terms.
28 */
29
30 #pragma weak __atanl = atanl
31
32 /*
33 * atanl(x)
34 * Table look-up algorithm
35 * By K.C. Ng, March 9, 1989
36 *
37 * Algorithm.
38 *
39 * The algorithm is based on atan(x)=atan(y)+atan((x-y)/(1+x*y)).
40 * We use poly1(x) to approximate atan(x) for x in [0,1/8] with
41 * error (relative)
42 * |(atan(x)-poly1(x))/x|<= 2^-115.94 long double
43 * |(atan(x)-poly1(x))/x|<= 2^-58.85 double
44 * |(atan(x)-poly1(x))/x|<= 2^-25.53 float
45 * and use poly2(x) to approximate atan(x) for x in [0,1/65] with
46 * error (absolute)
47 * |atan(x)-poly2(x)|<= 2^-122.15 long double
48 * |atan(x)-poly2(x)|<= 2^-64.79 double
49 * |atan(x)-poly2(x)|<= 2^-35.36 float
50 * Here poly1 and poly2 are odd polynomial with the following form:
|