Question

Cant find what is wrong to fix the code. can you please fix the code.

The function is: sin^-1 (x/5)

#include <iostream>

#include <iomanip>

#include <math.h>

#include <cmath>

using namespace std;

double f(double x)

{

return pow(sin, -1)*(x / 5);

}

int main()

{

int i, n;

double a = 0.0, b =1.0, h, s = 0.0, x, xbar;

double s1, s2, s3;

cout << " Enter # of partitions n ";

cin >> n;

cout << " n = " << n << endl;

h = (b - a) / n;

for (i = 0; i < n; i++)

{

x = a + i * h;

s = s + f(x);

}

s = s * h;

cout << " Result Left End Points = " << s << endl;

s = 0.0;

for (i = 1; i <= n; i++)

{

x = a + i * h;

s = s + f(x);

}

s = s * h;

cout << " Result Right End Points = " << s << endl;

s = 0.0;

for (i = 1; i <= n; i++)

{

xbar = a + (2. * i - 1)*(h / 2.);

s = s + f(xbar);

}

s = s * h;

cout << " Result using Mid Point Rule = " << s << endl;

// Using Trpezoidal Rule

s = 0.0;

for (i = 1; i <= n - 1; i++)

{

x = a + i * h;

s = s + f(x);

}

s = (h / 2.) * (f(a) + f(b)) + h * s;

cout << " Result using Trapezoidal Rule = " << s << endl;

// Using Simpson's Rule

h = (b - a) / (2.0*n);

s1 = s2 = s3 = 0.0;

s1 = (f(a) + f(b));

for (i = 1; i < 2 * n; i = i + 2)

{

x = a + i * h;

s2 = s2 + f(x);

}

for (i = 2; i<2 * n; i = i + 2)

{

x = a + i * h;

s3 = s3 + f(x);

}

s = (h / 3.0)*(s1 + 4.0*s2 + 2.0*s3);

cout << " Result using Simpson's Rule = " << s << endl;

system("PAUSE");

return 0;

}

Answer 1

#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
using namespace std;
double f(double x)
{
    return asin(x/5);
}

int main()
{
    int i, n;
    double a = 0.0, b =1.0, h, s = 0.0, x, xbar;
    double s1, s2, s3;
    cout << " Enter # of partitions n ";
    cin >> n;
    cout << " n = " << n << endl;
    h = (b - a) / n;
    for (i = 0; i < n; i++)
    {
        x = a + i * h;
        s = s + f(x);
    }
    s = s * h;
    cout << " Result Left End Points = " << s << endl;
    s = 0.0;
    for (i = 1; i <= n; i++)
    {
        x = a + i * h;
        s = s + f(x);
    }
    s = s * h;
    cout << " Result Right End Points = " << s << endl;
    s = 0.0;
    for (i = 1; i <= n; i++)
    {
        xbar = a + (2. * i - 1)*(h / 2.);
        s = s + f(xbar);
    }
    s = s * h;
    cout << " Result using Mid Point Rule = " << s << endl;
// Using Trpezoidal Rule
    s = 0.0;
    for (i = 1; i <= n - 1; i++)
    {
        x = a + i * h;
        s = s + f(x);
    }
    s = (h / 2.) * (f(a) + f(b)) + h * s;
    cout << " Result using Trapezoidal Rule = " << s << endl;
// Using Simpson's Rule
    h = (b - a) / (2.0*n);
    s1 = s2 = s3 = 0.0;
    s1 = (f(a) + f(b));
    for (i = 1; i < 2 * n; i = i + 2)
    {
        x = a + i * h;
        s2 = s2 + f(x);
    }
    for (i = 2; i<2 * n; i = i + 2)
    {
        x = a + i * h;
        s3 = s3 + f(x);
    }
    s = (h / 3.0)*(s1 + 4.0*s2 + 2.0*s3);
    cout << " Result using Simpson's Rule = " << s << endl;
    system("PAUSE");
    return 0;
}

Enter # of part itions n 100 n100 Result Left End Points0.0993307 Result Right End Points-0.101344 Result using Mid Point Rule0.100337 Result using Trapezoidal Rule-0.100337 Result using Simpson's Rule0.100337 Press any key to continue .. .

$asin\;is\;used\;for\;sine\;inverse\;(sin^{-1})\;in\;c++$