C ++-使用泰勒级数逼近估计cos(x)

问题描述 投票:1回答:2

为了获得更多使用C ++的实践,我决定不使用数学库而做一些基本的数学函数。我已经完成了功能和阶乘功能,它们似乎运行良好。但是,我的泰勒级数余弦函数存在很多问题。

Wikipedia Cosine Taylor Series

它在cos(1),cos(2)处输出良好的近似值,并在cos(3)和cos(4)处开始失去精度。除此之外,它的答案变得完全错误。以下是来自./a.out

的结果
Input an angle in radians, output will be its cosine
1
Output is: 0.540302

Input an angle in radians, output will be its cosine
2
Output is: -0.415873

Input an angle in radians, output will be its cosine
3
Output is: -0.974777

Input an angle in radians, output will be its cosine
4
Output is: -0.396825                       <-------------Should be approx. -0.654

Input an angle in radians, output will be its cosine
5
Output is: 2.5284                          <-------------Should be approx.  0.284

这里是完整的源代码:

#include <iostream>
#include <iomanip>

using std::cout;
using std::cin;
using std::endl;

int factorial(int factorial_input) {

    int original_input = factorial_input;
    int loop_length = factorial_input - 1;

    if(factorial_input == 1 || factorial_input == 0) {

        return 1;
    }

    for(int i=1; i != loop_length; i++) {

        factorial_input = factorial_input - 1;

        original_input = original_input * factorial_input;

    }

    return original_input;
}

double power(double base_input, double exponent_input) {

    double power_output = base_input;

    if(exponent_input == 0) {

        return 1;
    }

    if(base_input == 0) {

        return 0;
    }

    for(int i=0; i < exponent_input -1; i++){

        power_output = power_output * base_input;

    }
    return power_output;

}

double cos(double user_input) {

    double sequence[5] = { 0 };  //The container for each generated elemement.
    double cos_value = 0;        //The final output.
    double variable_x = 0;       //The user input x, being raised to the power 2n

    int alternating_one = 0;     //The (-1) that is being raised to the nth power,so switches back and forth from -1 to 1 
    int factorial_denom = 0;     //Factorial denominator (2n)!
    int loop_lim = sizeof(sequence)/sizeof(double);            //The upper limit of the series (where to stop), depends on size of sequence. Bigger is more precision.

    for(int n=0; n < loop_lim; n++) {

        alternating_one = power(-1, n);
        variable_x = power(user_input, (n*2));
        factorial_denom = factorial((n*2));

        sequence[n] =  alternating_one * variable_x / factorial_denom;
        cout << "Element[" << n << "] is: " << sequence[n] << endl;     //Prints out the value of each element for debugging.
    }

    //This loop sums together all the elements of the sequence.
    for(int i=0; i < loop_lim; i++) {                   

        cos_value = cos_value + sequence[i];

    }

    return cos_value;
}

int main() {

    double user_input = 0;
    double cos_output;

    cout << "Input an angle in radians, output will be its cosine" << endl;
    cin >> user_input;
    cos_output = cos(user_input);

    cout << "Output is: " << cos_output << endl;

}

根据Desmos上的这张图,在五次迭代中,我的函数应保持精度直到x> 4.2之后:

Desmos Graph

此外,当我将系列设置为使用20次或更多次迭代时(它会生成越来越小的数字,这将使答案更加精确),元素开始表现得非常不可预测。这是启用了序列调试器的./a.out,以便我们可以看到每个元素包含的内容。输入为1。

Input an angle in radians, output will be its cosine
1
Element[0] is: 1
Element[1] is: -0.5
Element[2] is: 0.0416667
Element[3] is: -0.00138889
Element[4] is: 2.48016e-05
Element[5] is: -2.75573e-07
Element[6] is: 2.08768e-09
Element[7] is: -7.81894e-10
Element[8] is: 4.98955e-10
Element[9] is: 1.11305e-09
Element[10] is: -4.75707e-10
Element[11] is: 1.91309e-09
Element[12] is: -1.28875e-09
Element[13] is: 5.39409e-10
Element[14] is: -7.26886e-10
Element[15] is: -7.09579e-10
Element[16] is: -4.65661e-10
Element[17] is: -inf
Element[18] is: inf
Element[19] is: -inf
Output is: -nan

谁能指出我做错了什么,我应该做得更好?我是C ++的新手,所以我仍然有很多误解。非常感谢您抽出宝贵的时间阅读本文!

c++ double precision taylor-series
2个回答
0
投票

您有以下问题:


在图中显示的图形中,k包含在总和中,而您的代码中不包含它。因此,Desmos图中的k=5等于您代码中的double sequence[6] = { 0 }

这固定了user_input = 4的输出。

对于user_input = 5,您可以然后将其与图表进行比较以查看它也给出了相似的结果(已经偏离了真实值)


然后,您将遇到大量术语的错误,因为阶乘函数输出int,但是阶乘增长得如此之快,以至于它超出了int的值范围,该值可以快速保存,也可以快速移出任何整数类型的范围。如果要支持(虽然不是很多)更大的输入范围,则应该返回double并将original_input也设为double


power中,将指数取为double,但要像对待整数一样使用它。特别是将它用于循环迭代的限制。只要这些值足够小以可由double精确表示,它就将正确运行。一旦值变大,循环迭代次数将变得不精确。

int用作power的第二个参数。


[如果要使用这种方法实现cos,通常将首先使用cos对称性,以将范围缩小到较小的范围,例如[0,pi/2]首先,通过使用cos(x + 2pi) = cos(x)cos(x+pi) = - cos(x)cos(-x) = cos(x)


0
投票

问题来自您实现的factorial功能。我对您的代码进行了最小的更改,并且运行良好。只需#include <cmath>,然后将factorial((n*2))替换为tgamma(2*n+1)。然后输出显示为>

Input an angle in radians, output will be its cosine
Element[0] is: 1
Element[1] is: -0.5
Element[2] is: 0.0416667
Element[3] is: -0.00139082
Element[4] is: 2.48022e-05
Element[5] is: -2.75573e-07
Element[6] is: 2.08768e-09
Element[7] is: 4.65661e-10
Element[8] is: -4.65661e-10
Element[9] is: 4.65661e-10
Element[10] is: -4.65661e-10
Element[11] is: 4.65661e-10
Element[12] is: -4.65661e-10
Element[13] is: 4.65661e-10
Element[14] is: -4.65661e-10
Element[15] is: 4.65661e-10
Element[16] is: -4.65661e-10
Element[17] is: 4.65661e-10
Element[18] is: -4.65661e-10
Element[19] is: 4.65661e-10
Output is: 0.5403

这是预期的输出。

Run your modified code online

© www.soinside.com 2019 - 2024. All rights reserved.