Long Luo's Life Notes

每一天都是奇迹

By Long Luo

挖坑

f(x)=f(a)+f(x)f(a)=f(a)+axf(t)dt=f(a)axf(t)d(xt)=f(a)f(t)(xt)ax12axf(t)d[(xt)2]=f(a)+f(a)(xa)+f(a)2(xa)213!axf(t)d[(xt)]3\begin{aligned} f(x) & = f(a) + f(x) - f(a) \\ & = f(a) + \int_a^x f'(t) \mathrm{d}t \\ & = f(a) - \int_a^x f'(t) \mathrm{d}(x-t) \\ & = f(a) - f'(t)(x - t)|_a^x - \frac12 \int_a^x f''(t) \mathrm{d}[(x-t)^2] \\ & = f(a) + f'(a)(x - a) + {f''(a) \over 2}(x - a)^2 - {1 \over 3!} \int_a^x f'''(t) \mathrm{d}[(x-t)]^3 \end{aligned}

不断重复这一过程,可知当 f 的 n+1 阶导数连续时,有:

f(x)=k=0nf(k)(a)k!(xa)k+Rn(x)f(x) = \sum_{k=0}^n {f^{(k)}(a) \over k!}(x-a)^k + R_n(x)

其中积分余项 为:

Rn(x)=1n!axf(n+1)(t)(xt)ndtR_n(x) = {1 \over n!} \int_a^x f^{(n + 1)}(t)(x - t)^n \mathrm{d}t

参考文献

  1. Taylor’s theorem
  2. Taylor Series
  3. Intuition for Taylor Series

By Long Luo

挖坑!

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
/**
* Returns the trigonometric sine of an angle. Special cases:
* <ul><li>If the argument is NaN or an infinity, then the
* result is NaN.
* <li>If the argument is zero, then the result is a zero with the
* same sign as the argument.</ul>
*
* <p>The computed result must be within 1 ulp of the exact result.
* Results must be semi-monotonic.
*
* @param a an angle, in radians.
* @return the sine of the argument.
*/
@HotSpotIntrinsicCandidate
public static double sin(double a) {
return StrictMath.sin(a); // default impl. delegates to StrictMath
}
1
2
3
4
5
6
7
8
9
10
11
/**
* Returns the trigonometric sine of an angle. Special cases:
* <ul><li>If the argument is NaN or an infinity, then the
* result is NaN.
* <li>If the argument is zero, then the result is a zero with the
* same sign as the argument.</ul>
*
* @param a an angle, in radians.
* @return the sine of the argument.
*/
public static native double sin(double a);
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/* @(#)k_sin.c 1.3 95/01/18 */
/*
* ====================================================
* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
*
* Developed at SunSoft, a Sun Microsystems, Inc. business.
* Permission to use, copy, modify, and distribute this
* software is freely granted, provided that this notice
* is preserved.
* ====================================================
*/

/* __kernel_sin( x, y, iy)
* kernel sin function on [-pi/4, pi/4], pi/4 ~ 0.7854
* Input x is assumed to be bounded by ~pi/4 in magnitude.
* Input y is the tail of x.
* Input iy indicates whether y is 0. (if iy=0, y assume to be 0).
*
* Algorithm
* 1. Since sin(-x) = -sin(x), we need only to consider positive x.
* 2. if x < 2^-27 (hx<0x3e400000 0), return x with inexact if x!=0.
* 3. sin(x) is approximated by a polynomial of degree 13 on
* [0,pi/4]
* 3 13
* sin(x) ~ x + S1*x + ... + S6*x
* where
*
* |sin(x) 2 4 6 8 10 12 | -58
* |----- - (1+S1*x +S2*x +S3*x +S4*x +S5*x +S6*x )| <= 2
* | x |
*
* 4. sin(x+y) = sin(x) + sin'(x')*y
* ~ sin(x) + (1-x*x/2)*y
* For better accuracy, let
* 3 2 2 2 2
* r = x *(S2+x *(S3+x *(S4+x *(S5+x *S6))))
* then 3 2
* sin(x) = x + (S1*x + (x *(r-y/2)+y))
*/

#ifndef __FDLIBM_H__
#include "fdlibm.h"
#endif

double __kernel_sin(double x, double y, int iy)
{
double z, r, v;
int32_t ix;

static const double half = 5.00000000000000000000e-01; /* 0x3FE00000, 0x00000000 */
static const double S1 = -1.66666666666666324348e-01; /* 0xBFC55555, 0x55555549 */
static const double S2 = 8.33333333332248946124e-03; /* 0x3F811111, 0x1110F8A6 */
static const double S3 = -1.98412698298579493134e-04; /* 0xBF2A01A0, 0x19C161D5 */
static const double S4 = 2.75573137070700676789e-06; /* 0x3EC71DE3, 0x57B1FE7D */
static const double S5 = -2.50507602534068634195e-08; /* 0xBE5AE5E6, 0x8A2B9CEB */
static const double S6 = 1.58969099521155010221e-10; /* 0x3DE5D93A, 0x5ACFD57C */

GET_HIGH_WORD(ix, x);
ix &= IC(0x7fffffff); /* high word of x */
if (ix < IC(0x3e400000)) /* |x| < 2**-27 */
{
if ((int32_t) x == 0)
return x; /* generate inexact */
}
z = x * x;
v = z * x;
r = S2 + z * (S3 + z * (S4 + z * (S5 + z * S6)));
if (iy == 0)
return x + v * (S1 + z * r);
else
return x - ((z * (half * y - v * r) - y) - v * S1);
}

sin(x0+Δx)sin(x0)+sin(x0)Δx1!+sin(x0)Δx22!+sin(x0)Δx33!+\sin (x_0 + \Delta x) \approx \sin (x_0) + \sin'(x_0) \frac {\Delta x}{1!} + \sin''(x_0) \frac { \Delta x^2}{2!} + \sin'''(x_0) \frac {\Delta x^3}{3!} + \cdots

参考文献

  1. C mathematical functions
  2. Sine and cosine
0%